./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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-threaded-sum-2.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 e4c79b7a5b8db7237eb9e98d6143d48d2d4ec5b8465b95c5ccb44c5e387749db --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:08:01,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:08:01,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:08:01,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:08:01,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:08:01,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:08:01,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:08:01,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:08:01,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:08:01,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:08:01,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:08:01,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:08:01,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:08:01,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:08:01,904 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:08:01,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:08:01,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:08:01,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:08:01,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:08:01,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:08:01,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:08:01,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:08:01,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:08:01,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:08:01,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:08:01,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:08:01,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:08:01,907 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:08:01,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:08:01,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:08:01,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:08:01,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:08:01,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:08:01,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:08:01,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:08:01,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:08:01,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:08:01,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:08:01,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:08:01,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:08:01,910 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:08:01,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:08:01,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:08:01,910 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 -> e4c79b7a5b8db7237eb9e98d6143d48d2d4ec5b8465b95c5ccb44c5e387749db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:08:02,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:08:02,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:08:02,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:08:02,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:08:02,134 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:08:02,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-02-20 12:08:03,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:08:03,320 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:08:03,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-02-20 12:08:03,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d514da21/882298395f3843e5afa4409b67ced247/FLAGd537a4d20 [2024-02-20 12:08:03,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d514da21/882298395f3843e5afa4409b67ced247 [2024-02-20 12:08:03,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:08:03,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:08:03,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:08:03,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:08:03,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:08:03,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f02e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03, skipping insertion in model container [2024-02-20 12:08:03,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,364 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:08:03,508 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-threaded-sum-2.wvr.c[2476,2489] [2024-02-20 12:08:03,538 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:08:03,552 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:08:03,567 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-threaded-sum-2.wvr.c[2476,2489] [2024-02-20 12:08:03,567 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:08:03,579 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:08:03,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03 WrapperNode [2024-02-20 12:08:03,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:08:03,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:08:03,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:08:03,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:08:03,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,604 INFO L138 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-02-20 12:08:03,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:08:03,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:08:03,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:08:03,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:08:03,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,626 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 12:08:03,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:08:03,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:08:03,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:08:03,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:08:03,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (1/1) ... [2024-02-20 12:08:03,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:08:03,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:08:03,699 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-20 12:08:03,720 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-20 12:08:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:08:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:08:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:08:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:08:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:08:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:08:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:08:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:08:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:08:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:08:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:08:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:08:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:08:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:08:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:08:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:08:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:08:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:08:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:08:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:08:03,751 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:08:03,853 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:08:03,856 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:08:04,018 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:08:04,019 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:08:04,122 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:08:04,122 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-20 12:08:04,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:08:04 BoogieIcfgContainer [2024-02-20 12:08:04,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:08:04,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:08:04,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:08:04,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:08:04,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:08:03" (1/3) ... [2024-02-20 12:08:04,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636f4247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:08:04, skipping insertion in model container [2024-02-20 12:08:04,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:08:03" (2/3) ... [2024-02-20 12:08:04,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636f4247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:08:04, skipping insertion in model container [2024-02-20 12:08:04,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:08:04" (3/3) ... [2024-02-20 12:08:04,130 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2024-02-20 12:08:04,144 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:08:04,145 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:08:04,145 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:08:04,180 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 12:08:04,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2024-02-20 12:08:04,225 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2024-02-20 12:08:04,227 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:08:04,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-02-20 12:08:04,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2024-02-20 12:08:04,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2024-02-20 12:08:04,241 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:08:04,247 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;@156d524d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:08:04,247 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 12:08:04,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:08:04,255 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2024-02-20 12:08:04,255 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:08:04,255 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:04,256 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:04,256 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:04,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1119396265, now seen corresponding path program 1 times [2024-02-20 12:08:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:04,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087124986] [2024-02-20 12:08:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:04,714 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-20 12:08:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087124986] [2024-02-20 12:08:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087124986] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:08:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:08:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:08:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641766004] [2024-02-20 12:08:04,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:08:04,724 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:08:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:08:04,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:08:04,771 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2024-02-20 12:08:04,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-20 12:08:04,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:04,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2024-02-20 12:08:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:04,863 INFO L124 PetriNetUnfolderBase]: 69/153 cut-off events. [2024-02-20 12:08:04,864 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-02-20 12:08:04,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 153 events. 69/153 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 586 event pairs, 6 based on Foata normal form. 8/158 useless extension candidates. Maximal degree in co-relation 223. Up to 79 conditions per place. [2024-02-20 12:08:04,867 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 25 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-02-20 12:08:04,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 33 transitions, 140 flow [2024-02-20 12:08:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:08:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:08:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2024-02-20 12:08:04,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-02-20 12:08:04,883 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2024-02-20 12:08:04,883 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 33 transitions, 140 flow [2024-02-20 12:08:04,884 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-20 12:08:04,884 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:04,885 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:04,885 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:08:04,885 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:04,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 337880122, now seen corresponding path program 1 times [2024-02-20 12:08:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131221663] [2024-02-20 12:08:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:05,107 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-20 12:08:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131221663] [2024-02-20 12:08:05,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131221663] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:08:05,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:08:05,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:08:05,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074323709] [2024-02-20 12:08:05,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:08:05,111 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:08:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:08:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:08:05,126 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2024-02-20 12:08:05,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 33 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:08:05,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:05,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2024-02-20 12:08:05,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:05,248 INFO L124 PetriNetUnfolderBase]: 83/166 cut-off events. [2024-02-20 12:08:05,248 INFO L125 PetriNetUnfolderBase]: For 48/50 co-relation queries the response was YES. [2024-02-20 12:08:05,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 166 events. 83/166 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 509 event pairs, 12 based on Foata normal form. 11/177 useless extension candidates. Maximal degree in co-relation 383. Up to 91 conditions per place. [2024-02-20 12:08:05,253 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 26 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2024-02-20 12:08:05,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 201 flow [2024-02-20 12:08:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:08:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:08:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2024-02-20 12:08:05,256 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-20 12:08:05,257 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2024-02-20 12:08:05,257 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 201 flow [2024-02-20 12:08:05,257 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:08:05,257 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:05,258 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:05,258 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:08:05,258 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:05,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2129940392, now seen corresponding path program 2 times [2024-02-20 12:08:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017280410] [2024-02-20 12:08:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017280410] [2024-02-20 12:08:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017280410] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:08:05,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:08:05,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:08:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238790642] [2024-02-20 12:08:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:08:05,454 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:08:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:08:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:08:05,475 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2024-02-20 12:08:05,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 35 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-20 12:08:05,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:05,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2024-02-20 12:08:05,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:05,579 INFO L124 PetriNetUnfolderBase]: 108/216 cut-off events. [2024-02-20 12:08:05,579 INFO L125 PetriNetUnfolderBase]: For 177/189 co-relation queries the response was YES. [2024-02-20 12:08:05,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 216 events. 108/216 cut-off events. For 177/189 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 773 event pairs, 22 based on Foata normal form. 14/223 useless extension candidates. Maximal degree in co-relation 662. Up to 129 conditions per place. [2024-02-20 12:08:05,584 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 31 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2024-02-20 12:08:05,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 307 flow [2024-02-20 12:08:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:08:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:08:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-02-20 12:08:05,588 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-02-20 12:08:05,590 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2024-02-20 12:08:05,590 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 41 transitions, 307 flow [2024-02-20 12:08:05,590 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-20 12:08:05,590 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:05,591 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:05,591 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:08:05,591 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:05,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 32301366, now seen corresponding path program 3 times [2024-02-20 12:08:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898389442] [2024-02-20 12:08:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898389442] [2024-02-20 12:08:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898389442] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:08:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333669595] [2024-02-20 12:08:06,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:08:06,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:08:06,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:08:06,145 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-20 12:08:06,172 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-20 12:08:06,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-20 12:08:06,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:08:06,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-20 12:08:06,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:08:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:06,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:08:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333669595] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:08:06,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:08:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-02-20 12:08:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391032065] [2024-02-20 12:08:06,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:08:06,708 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 12:08:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 12:08:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-02-20 12:08:06,800 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2024-02-20 12:08:06,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 41 transitions, 307 flow. Second operand has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 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-20 12:08:06,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:06,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2024-02-20 12:08:06,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:08,069 INFO L124 PetriNetUnfolderBase]: 656/1211 cut-off events. [2024-02-20 12:08:08,069 INFO L125 PetriNetUnfolderBase]: For 1923/1989 co-relation queries the response was YES. [2024-02-20 12:08:08,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 1211 events. 656/1211 cut-off events. For 1923/1989 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6269 event pairs, 30 based on Foata normal form. 13/1202 useless extension candidates. Maximal degree in co-relation 4814. Up to 807 conditions per place. [2024-02-20 12:08:08,078 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 140 selfloop transitions, 81 changer transitions 28/253 dead transitions. [2024-02-20 12:08:08,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 253 transitions, 2402 flow [2024-02-20 12:08:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-02-20 12:08:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-02-20 12:08:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 368 transitions. [2024-02-20 12:08:08,081 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-02-20 12:08:08,082 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2024-02-20 12:08:08,082 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 253 transitions, 2402 flow [2024-02-20 12:08:08,083 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 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-20 12:08:08,083 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:08,083 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:08,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-20 12:08:08,295 WARN L489 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-02-20 12:08:08,295 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:08,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash -727830827, now seen corresponding path program 4 times [2024-02-20 12:08:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312239175] [2024-02-20 12:08:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:08,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312239175] [2024-02-20 12:08:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312239175] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:08:08,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:08:08,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 12:08:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341761594] [2024-02-20 12:08:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:08:08,478 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:08:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:08:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:08:08,486 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-20 12:08:08,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 253 transitions, 2402 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-02-20 12:08:08,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:08,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-20 12:08:08,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:08,753 INFO L124 PetriNetUnfolderBase]: 1057/1814 cut-off events. [2024-02-20 12:08:08,754 INFO L125 PetriNetUnfolderBase]: For 5416/5500 co-relation queries the response was YES. [2024-02-20 12:08:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9109 conditions, 1814 events. 1057/1814 cut-off events. For 5416/5500 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9288 event pairs, 9 based on Foata normal form. 90/1885 useless extension candidates. Maximal degree in co-relation 8820. Up to 1223 conditions per place. [2024-02-20 12:08:08,770 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 355 selfloop transitions, 73 changer transitions 58/506 dead transitions. [2024-02-20 12:08:08,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 506 transitions, 5810 flow [2024-02-20 12:08:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 12:08:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 12:08:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-02-20 12:08:08,772 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-20 12:08:08,774 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 47 predicate places. [2024-02-20 12:08:08,774 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 506 transitions, 5810 flow [2024-02-20 12:08:08,774 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-02-20 12:08:08,775 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:08,775 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:08,775 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:08:08,775 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:08,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1071088710, now seen corresponding path program 1 times [2024-02-20 12:08:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054263998] [2024-02-20 12:08:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:08,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054263998] [2024-02-20 12:08:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054263998] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:08:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91535741] [2024-02-20 12:08:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:09,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:08:09,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:08:09,505 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-20 12:08:09,509 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-20 12:08:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:09,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-20 12:08:09,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:08:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:17,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:08:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91535741] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:08:17,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:08:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-02-20 12:08:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336521110] [2024-02-20 12:08:17,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:08:17,814 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-20 12:08:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:08:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-20 12:08:17,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=396, Unknown=1, NotChecked=0, Total=506 [2024-02-20 12:08:21,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:08:25,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:08:25,909 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-20 12:08:25,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 506 transitions, 5810 flow. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 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-20 12:08:25,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:08:25,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-20 12:08:25,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:08:39,366 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 64 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:08:43,585 INFO L124 PetriNetUnfolderBase]: 2675/4674 cut-off events. [2024-02-20 12:08:43,585 INFO L125 PetriNetUnfolderBase]: For 15724/15724 co-relation queries the response was YES. [2024-02-20 12:08:43,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27602 conditions, 4674 events. 2675/4674 cut-off events. For 15724/15724 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 28806 event pairs, 30 based on Foata normal form. 13/4687 useless extension candidates. Maximal degree in co-relation 26913. Up to 3214 conditions per place. [2024-02-20 12:08:43,626 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 788 selfloop transitions, 369 changer transitions 396/1558 dead transitions. [2024-02-20 12:08:43,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1558 transitions, 21203 flow [2024-02-20 12:08:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-02-20 12:08:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-02-20 12:08:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 502 transitions. [2024-02-20 12:08:43,630 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4450354609929078 [2024-02-20 12:08:43,632 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 93 predicate places. [2024-02-20 12:08:43,633 INFO L507 AbstractCegarLoop]: Abstraction has has 119 places, 1558 transitions, 21203 flow [2024-02-20 12:08:43,633 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 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-20 12:08:43,633 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:08:43,633 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:08:43,652 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-02-20 12:08:43,848 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-20 12:08:43,848 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:08:43,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:08:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash -687391626, now seen corresponding path program 2 times [2024-02-20 12:08:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:08:43,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127069476] [2024-02-20 12:08:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:08:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:08:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:08:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:08:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:08:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127069476] [2024-02-20 12:08:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127069476] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:08:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983071062] [2024-02-20 12:08:44,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:08:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:08:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:08:44,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:08:44,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-20 12:08:44,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:08:44,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:08:44,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 12:08:44,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:09:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:09:03,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:09:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:09:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983071062] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:09:07,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:09:07,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-02-20 12:09:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999420967] [2024-02-20 12:09:07,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:09:07,694 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-20 12:09:07,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:09:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-20 12:09:07,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=681, Unknown=4, NotChecked=0, Total=870 [2024-02-20 12:09:09,411 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-20 12:09:09,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1558 transitions, 21203 flow. Second operand has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:09:09,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:09:09,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-20 12:09:09,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:09:21,904 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:09:30,047 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 90 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:09:41,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:09:58,554 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 75 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:10:03,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:12,919 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 76 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:10:19,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:23,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:27,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:44,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:48,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:53,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:10:57,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:11:13,599 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 88 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:11:17,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:11:21,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:11:25,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:11:30,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:11:34,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:11:43,492 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 89 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:11:52,921 INFO L124 PetriNetUnfolderBase]: 4423/7906 cut-off events. [2024-02-20 12:11:52,921 INFO L125 PetriNetUnfolderBase]: For 32952/32952 co-relation queries the response was YES. [2024-02-20 12:11:52,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54465 conditions, 7906 events. 4423/7906 cut-off events. For 32952/32952 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 54782 event pairs, 24 based on Foata normal form. 18/7924 useless extension candidates. Maximal degree in co-relation 53320. Up to 5776 conditions per place. [2024-02-20 12:11:52,978 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 1363 selfloop transitions, 574 changer transitions 1000/2942 dead transitions. [2024-02-20 12:11:52,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 2942 transitions, 46047 flow [2024-02-20 12:11:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-02-20 12:11:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2024-02-20 12:11:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 753 transitions. [2024-02-20 12:11:52,981 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4297945205479452 [2024-02-20 12:11:52,982 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 165 predicate places. [2024-02-20 12:11:52,982 INFO L507 AbstractCegarLoop]: Abstraction has has 191 places, 2942 transitions, 46047 flow [2024-02-20 12:11:52,982 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:11:52,982 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:11:52,982 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:11:52,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-20 12:11:53,197 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:11:53,197 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:11:53,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:11:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 133773148, now seen corresponding path program 3 times [2024-02-20 12:11:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:11:53,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629750490] [2024-02-20 12:11:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:11:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:11:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:11:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:11:56,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:11:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629750490] [2024-02-20 12:11:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629750490] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:11:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827973070] [2024-02-20 12:11:56,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:11:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:11:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:11:56,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:11:56,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-20 12:11:57,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-20 12:11:57,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:11:57,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 12:11:57,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:12:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:12:26,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:12:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:12:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827973070] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:12:32,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:12:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2024-02-20 12:12:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712332157] [2024-02-20 12:12:32,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:12:32,194 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-20 12:12:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:12:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-20 12:12:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=692, Unknown=6, NotChecked=0, Total=870 [2024-02-20 12:12:36,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:12:41,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:12:41,343 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-20 12:12:41,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 2942 transitions, 46047 flow. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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-20 12:12:41,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:12:41,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-20 12:12:41,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:12:45,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:13:15,104 WARN L293 SmtUtils]: Spent 15.39s on a formula simplification. DAG size of input: 67 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:13:33,441 WARN L293 SmtUtils]: Spent 12.62s on a formula simplification. DAG size of input: 79 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:13:40,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:13:43,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:13:47,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:13:55,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:14:05,425 WARN L293 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 67 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:14:28,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:14:32,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:14:37,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:14:42,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:14:54,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:14:58,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:15:15,150 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 85 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:15:26,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:15:59,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:16:35,624 WARN L293 SmtUtils]: Spent 24.18s on a formula simplification. DAG size of input: 107 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:16:39,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:16:43,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:17:17,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:17:21,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:17:25,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:17:29,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:17:33,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:17:37,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:18:02,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:18:18,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:18:22,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:18:45,863 WARN L293 SmtUtils]: Spent 18.58s on a formula simplification. DAG size of input: 109 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:18:50,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:18:54,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:00,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:04,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:10,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:29,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:33,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:37,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:42,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:46,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:19:52,884 INFO L124 PetriNetUnfolderBase]: 6717/12040 cut-off events. [2024-02-20 12:19:52,884 INFO L125 PetriNetUnfolderBase]: For 61858/61858 co-relation queries the response was YES. [2024-02-20 12:19:52,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94018 conditions, 12040 events. 6717/12040 cut-off events. For 61858/61858 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 90502 event pairs, 18 based on Foata normal form. 13/12053 useless extension candidates. Maximal degree in co-relation 92327. Up to 9000 conditions per place. [2024-02-20 12:19:52,987 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 2226 selfloop transitions, 852 changer transitions 1608/4691 dead transitions. [2024-02-20 12:19:52,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 4691 transitions, 82700 flow [2024-02-20 12:19:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-02-20 12:19:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2024-02-20 12:19:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 797 transitions. [2024-02-20 12:19:52,990 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40497967479674796 [2024-02-20 12:19:52,991 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 246 predicate places. [2024-02-20 12:19:52,991 INFO L507 AbstractCegarLoop]: Abstraction has has 272 places, 4691 transitions, 82700 flow [2024-02-20 12:19:52,991 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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-20 12:19:52,992 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:19:52,992 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:19:53,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-20 12:19:53,204 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:53,205 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:19:53,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:19:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -10540132, now seen corresponding path program 4 times [2024-02-20 12:19:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:19:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154280203] [2024-02-20 12:19:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:19:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:19:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:19:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:19:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:19:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154280203] [2024-02-20 12:19:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154280203] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:19:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735028161] [2024-02-20 12:19:54,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 12:19:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:19:54,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:19:54,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-20 12:19:54,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 12:19:54,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:19:54,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-20 12:19:54,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:20:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:20:02,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:20:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:20:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735028161] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:20:12,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:20:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-02-20 12:20:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939267793] [2024-02-20 12:20:12,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:20:12,059 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-20 12:20:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:20:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-20 12:20:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=393, Unknown=4, NotChecked=0, Total=506 [2024-02-20 12:20:17,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:20:21,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:20:21,796 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-20 12:20:21,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 4691 transitions, 82700 flow. Second operand has 23 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 23 states have internal predecessors, (146), 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-20 12:20:21,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:20:21,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-20 12:20:21,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:20:34,033 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:20:42,113 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:21:00,005 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 52 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:21:08,695 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 75 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:21:16,851 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 60 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:21:21,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:21:25,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:21:37,084 INFO L124 PetriNetUnfolderBase]: 8363/14962 cut-off events. [2024-02-20 12:21:37,085 INFO L125 PetriNetUnfolderBase]: For 94650/94650 co-relation queries the response was YES. [2024-02-20 12:21:37,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130561 conditions, 14962 events. 8363/14962 cut-off events. For 94650/94650 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 117118 event pairs, 22 based on Foata normal form. 9/14971 useless extension candidates. Maximal degree in co-relation 128451. Up to 11262 conditions per place. [2024-02-20 12:21:37,193 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 2927 selfloop transitions, 978 changer transitions 2005/5915 dead transitions. [2024-02-20 12:21:37,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 5915 transitions, 115818 flow [2024-02-20 12:21:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-02-20 12:21:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2024-02-20 12:21:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 431 transitions. [2024-02-20 12:21:37,195 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4081439393939394 [2024-02-20 12:21:37,196 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 289 predicate places. [2024-02-20 12:21:37,196 INFO L507 AbstractCegarLoop]: Abstraction has has 315 places, 5915 transitions, 115818 flow [2024-02-20 12:21:37,196 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 23 states have internal predecessors, (146), 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-20 12:21:37,196 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:21:37,196 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:21:37,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-20 12:21:37,409 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:21:37,410 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:21:37,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:21:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -6629127, now seen corresponding path program 5 times [2024-02-20 12:21:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:21:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069902009] [2024-02-20 12:21:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:21:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:21:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:21:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:21:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:21:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069902009] [2024-02-20 12:21:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069902009] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:21:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211289337] [2024-02-20 12:21:38,152 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 12:21:38,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:21:38,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:21:38,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:21:38,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-20 12:21:38,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-20 12:21:38,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:21:38,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2024-02-20 12:21:38,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:21:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:21:43,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:21:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:21:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211289337] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:21:44,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:21:44,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 34 [2024-02-20 12:21:44,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192197691] [2024-02-20 12:21:44,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:21:44,740 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-02-20 12:21:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:21:44,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-02-20 12:21:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=978, Unknown=1, NotChecked=0, Total=1190 [2024-02-20 12:21:44,919 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2024-02-20 12:21:44,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 5915 transitions, 115818 flow. Second operand has 35 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 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-20 12:21:44,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:21:44,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2024-02-20 12:21:44,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:21:50,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:21:55,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:22:06,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:22:11,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:22:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:22:20,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:22:24,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 12:22:29,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15