./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:07:14,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:07:14,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:07:14,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:07:14,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:07:14,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:07:14,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:07:14,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:07:14,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:07:14,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:07:14,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:07:14,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:07:14,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:07:14,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:07:14,250 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:07:14,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:07:14,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:07:14,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:07:14,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:07:14,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:07:14,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:07:14,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:07:14,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:07:14,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:07:14,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:07:14,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:07:14,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:07:14,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:07:14,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:07:14,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:07:14,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:07:14,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:07:14,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:14,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:07:14,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:07:14,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:07:14,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:07:14,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:07:14,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:07:14,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:07:14,272 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:07:14,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:07:14,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:07:14,272 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-01-27 16:07:14,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:07:14,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:07:14,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:07:14,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:07:14,508 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:07:14,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2024-01-27 16:07:15,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:07:15,737 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:07:15,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2024-01-27 16:07:15,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1d983ed4/7013a9c469164cfca62e888107cfea75/FLAG41d55dd71 [2024-01-27 16:07:15,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1d983ed4/7013a9c469164cfca62e888107cfea75 [2024-01-27 16:07:15,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:07:15,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:07:15,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:15,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:07:15,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:07:15,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:15" (1/1) ... [2024-01-27 16:07:15,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfb084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:15, skipping insertion in model container [2024-01-27 16:07:15,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:15" (1/1) ... [2024-01-27 16:07:15,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:07:16,058 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2024-01-27 16:07:16,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:16,070 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:07:16,111 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2024-01-27 16:07:16,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:16,149 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:07:16,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16 WrapperNode [2024-01-27 16:07:16,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:16,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:16,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:07:16,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:07:16,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,196 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-01-27 16:07:16,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:16,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:07:16,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:07:16,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:07:16,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,226 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 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-01-27 16:07:16,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:07:16,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:07:16,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:07:16,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:07:16,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (1/1) ... [2024-01-27 16:07:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:16,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:07:16,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:07:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:07:16,309 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:07:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:07:16,309 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:07:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:07:16,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:07:16,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:07:16,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:07:16,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:07:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:07:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:07:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:07:16,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:07:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:07:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:07:16,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:07:16,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:07:16,337 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:07:16,473 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:07:16,476 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:07:16,607 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:07:16,607 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:07:16,675 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:07:16,675 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:07:16,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:16 BoogieIcfgContainer [2024-01-27 16:07:16,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:07:16,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:07:16,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:07:16,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:07:16,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:07:15" (1/3) ... [2024-01-27 16:07:16,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2981284f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:16, skipping insertion in model container [2024-01-27 16:07:16,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:16" (2/3) ... [2024-01-27 16:07:16,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2981284f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:16, skipping insertion in model container [2024-01-27 16:07:16,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:16" (3/3) ... [2024-01-27 16:07:16,682 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-01-27 16:07:16,689 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:07:16,697 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:07:16,698 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:07:16,698 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:07:16,741 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:07:16,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-01-27 16:07:16,783 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-01-27 16:07:16,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:07:16,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-01-27 16:07:16,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-01-27 16:07:16,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-01-27 16:07:16,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:07:16,818 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2486cfe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:07:16,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 16:07:16,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:07:16,836 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-01-27 16:07:16,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:07:16,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:16,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:16,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:16,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1796875976, now seen corresponding path program 1 times [2024-01-27 16:07:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078735921] [2024-01-27 16:07:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078735921] [2024-01-27 16:07:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078735921] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:07:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934862359] [2024-01-27 16:07:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:17,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:07:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:17,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:07:17,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:07:17,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:17,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:17,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:17,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:17,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:17,389 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-01-27 16:07:17,390 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:07:17,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2187 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-01-27 16:07:17,395 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-01-27 16:07:17,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-01-27 16:07:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:07:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:07:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-01-27 16:07:17,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:07:17,406 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2024-01-27 16:07:17,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2024-01-27 16:07:17,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:17,409 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2024-01-27 16:07:17,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2024-01-27 16:07:17,413 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2024-01-27 16:07:17,413 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2024-01-27 16:07:17,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:17,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:17,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:17,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:07:17,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:17,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 676521124, now seen corresponding path program 1 times [2024-01-27 16:07:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194206733] [2024-01-27 16:07:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:17,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194206733] [2024-01-27 16:07:17,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194206733] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:17,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:17,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:07:17,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715210938] [2024-01-27 16:07:17,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:17,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:17,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:17,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:17,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:17,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:17,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-01-27 16:07:17,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:17,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:17,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:17,729 INFO L124 PetriNetUnfolderBase]: 382/689 cut-off events. [2024-01-27 16:07:17,729 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2024-01-27 16:07:17,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 689 events. 382/689 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2926 event pairs, 65 based on Foata normal form. 33/721 useless extension candidates. Maximal degree in co-relation 1572. Up to 246 conditions per place. [2024-01-27 16:07:17,733 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2024-01-27 16:07:17,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2024-01-27 16:07:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:07:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:07:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-01-27 16:07:17,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-01-27 16:07:17,735 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2024-01-27 16:07:17,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2024-01-27 16:07:17,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:17,738 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2024-01-27 16:07:17,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-01-27 16:07:17,739 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2024-01-27 16:07:17,739 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2024-01-27 16:07:17,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-01-27 16:07:17,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:17,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:17,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:07:17,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:17,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1193097064, now seen corresponding path program 2 times [2024-01-27 16:07:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439152748] [2024-01-27 16:07:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439152748] [2024-01-27 16:07:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439152748] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:07:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406284275] [2024-01-27 16:07:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:17,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:17,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-01-27 16:07:17,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:17,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:17,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:18,037 INFO L124 PetriNetUnfolderBase]: 328/605 cut-off events. [2024-01-27 16:07:18,039 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2024-01-27 16:07:18,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 605 events. 328/605 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2534 event pairs, 65 based on Foata normal form. 57/661 useless extension candidates. Maximal degree in co-relation 1713. Up to 234 conditions per place. [2024-01-27 16:07:18,042 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2024-01-27 16:07:18,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2024-01-27 16:07:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:07:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:07:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-01-27 16:07:18,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-01-27 16:07:18,047 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2024-01-27 16:07:18,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2024-01-27 16:07:18,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:18,055 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2024-01-27 16:07:18,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-01-27 16:07:18,056 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-01-27 16:07:18,056 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2024-01-27 16:07:18,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-01-27 16:07:18,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:18,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:18,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:07:18,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:18,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -330137667, now seen corresponding path program 1 times [2024-01-27 16:07:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791078711] [2024-01-27 16:07:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791078711] [2024-01-27 16:07:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791078711] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193553101] [2024-01-27 16:07:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:18,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:07:18,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:07:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:07:18,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:18,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:18,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:18,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:18,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:18,392 INFO L124 PetriNetUnfolderBase]: 337/617 cut-off events. [2024-01-27 16:07:18,393 INFO L125 PetriNetUnfolderBase]: For 1712/1724 co-relation queries the response was YES. [2024-01-27 16:07:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 617 events. 337/617 cut-off events. For 1712/1724 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2601 event pairs, 68 based on Foata normal form. 30/646 useless extension candidates. Maximal degree in co-relation 1916. Up to 237 conditions per place. [2024-01-27 16:07:18,396 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2024-01-27 16:07:18,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2024-01-27 16:07:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:07:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:07:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-01-27 16:07:18,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-01-27 16:07:18,398 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2024-01-27 16:07:18,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2024-01-27 16:07:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-01-27 16:07:18,402 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2024-01-27 16:07:18,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2024-01-27 16:07:18,403 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2024-01-27 16:07:18,403 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2024-01-27 16:07:18,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:18,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:18,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:18,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:07:18,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:18,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash 350538865, now seen corresponding path program 2 times [2024-01-27 16:07:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913229719] [2024-01-27 16:07:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913229719] [2024-01-27 16:07:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913229719] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770108269] [2024-01-27 16:07:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:18,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:07:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:07:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:07:18,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:18,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:18,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:18,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:18,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:18,704 INFO L124 PetriNetUnfolderBase]: 508/929 cut-off events. [2024-01-27 16:07:18,705 INFO L125 PetriNetUnfolderBase]: For 3237/3255 co-relation queries the response was YES. [2024-01-27 16:07:18,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 929 events. 508/929 cut-off events. For 3237/3255 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4215 event pairs, 53 based on Foata normal form. 45/971 useless extension candidates. Maximal degree in co-relation 3046. Up to 253 conditions per place. [2024-01-27 16:07:18,709 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 57 selfloop transitions, 20 changer transitions 23/103 dead transitions. [2024-01-27 16:07:18,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 771 flow [2024-01-27 16:07:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:07:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:07:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-01-27 16:07:18,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-01-27 16:07:18,710 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 141 transitions. [2024-01-27 16:07:18,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 771 flow [2024-01-27 16:07:18,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 705 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-01-27 16:07:18,716 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 376 flow [2024-01-27 16:07:18,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2024-01-27 16:07:18,717 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2024-01-27 16:07:18,717 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 376 flow [2024-01-27 16:07:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:18,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:18,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:18,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:07:18,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:18,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1387768189, now seen corresponding path program 3 times [2024-01-27 16:07:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:18,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070744050] [2024-01-27 16:07:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070744050] [2024-01-27 16:07:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070744050] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551779897] [2024-01-27 16:07:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:18,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:07:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:18,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:07:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:07:18,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:18,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:18,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:18,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:18,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:18,993 INFO L124 PetriNetUnfolderBase]: 481/884 cut-off events. [2024-01-27 16:07:18,994 INFO L125 PetriNetUnfolderBase]: For 5184/5202 co-relation queries the response was YES. [2024-01-27 16:07:18,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3384 conditions, 884 events. 481/884 cut-off events. For 5184/5202 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4004 event pairs, 59 based on Foata normal form. 63/944 useless extension candidates. Maximal degree in co-relation 3352. Up to 154 conditions per place. [2024-01-27 16:07:18,999 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 25 changer transitions 33/106 dead transitions. [2024-01-27 16:07:18,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 964 flow [2024-01-27 16:07:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:07:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:07:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-01-27 16:07:19,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-01-27 16:07:19,000 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 376 flow. Second operand 11 states and 138 transitions. [2024-01-27 16:07:19,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 964 flow [2024-01-27 16:07:19,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 893 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-01-27 16:07:19,009 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 475 flow [2024-01-27 16:07:19,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2024-01-27 16:07:19,010 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 47 predicate places. [2024-01-27 16:07:19,010 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 475 flow [2024-01-27 16:07:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:19,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:19,011 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:19,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:07:19,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:19,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash 200573649, now seen corresponding path program 1 times [2024-01-27 16:07:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535851242] [2024-01-27 16:07:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535851242] [2024-01-27 16:07:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535851242] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893968985] [2024-01-27 16:07:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:19,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:19,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 16:07:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:19,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 16:07:19,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:19,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:19,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893968985] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:19,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:19,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-01-27 16:07:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693090529] [2024-01-27 16:07:19,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:19,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:07:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:07:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:07:19,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:19,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 475 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:19,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:19,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:19,637 INFO L124 PetriNetUnfolderBase]: 589/1094 cut-off events. [2024-01-27 16:07:19,637 INFO L125 PetriNetUnfolderBase]: For 10490/10508 co-relation queries the response was YES. [2024-01-27 16:07:19,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 1094 events. 589/1094 cut-off events. For 10490/10508 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4676 event pairs, 149 based on Foata normal form. 81/1174 useless extension candidates. Maximal degree in co-relation 4699. Up to 522 conditions per place. [2024-01-27 16:07:19,644 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 67 selfloop transitions, 17 changer transitions 67/154 dead transitions. [2024-01-27 16:07:19,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 154 transitions, 1547 flow [2024-01-27 16:07:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 16:07:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 16:07:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2024-01-27 16:07:19,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-01-27 16:07:19,645 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 475 flow. Second operand 19 states and 231 transitions. [2024-01-27 16:07:19,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 154 transitions, 1547 flow [2024-01-27 16:07:19,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 154 transitions, 1448 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-01-27 16:07:19,658 INFO L231 Difference]: Finished difference. Result has 93 places, 54 transitions, 604 flow [2024-01-27 16:07:19,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=604, PETRI_PLACES=93, PETRI_TRANSITIONS=54} [2024-01-27 16:07:19,658 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 67 predicate places. [2024-01-27 16:07:19,659 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 54 transitions, 604 flow [2024-01-27 16:07:19,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:19,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:19,659 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:19,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:19,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:19,871 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:19,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1017903249, now seen corresponding path program 2 times [2024-01-27 16:07:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649396020] [2024-01-27 16:07:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649396020] [2024-01-27 16:07:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649396020] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232850353] [2024-01-27 16:07:19,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:07:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:19,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:20,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 16:07:20,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:20,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:20,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 16:07:20,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:20,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232850353] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:20,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:20,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-01-27 16:07:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405906143] [2024-01-27 16:07:20,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:20,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:07:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:07:20,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:07:20,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:20,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 54 transitions, 604 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:20,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:20,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:20,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:20,690 INFO L124 PetriNetUnfolderBase]: 877/1613 cut-off events. [2024-01-27 16:07:20,690 INFO L125 PetriNetUnfolderBase]: For 36575/36593 co-relation queries the response was YES. [2024-01-27 16:07:20,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9220 conditions, 1613 events. 877/1613 cut-off events. For 36575/36593 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7694 event pairs, 68 based on Foata normal form. 90/1702 useless extension candidates. Maximal degree in co-relation 9174. Up to 312 conditions per place. [2024-01-27 16:07:20,700 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 88 selfloop transitions, 47 changer transitions 80/218 dead transitions. [2024-01-27 16:07:20,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 218 transitions, 2806 flow [2024-01-27 16:07:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-01-27 16:07:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-01-27 16:07:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 334 transitions. [2024-01-27 16:07:20,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-01-27 16:07:20,701 INFO L175 Difference]: Start difference. First operand has 93 places, 54 transitions, 604 flow. Second operand 27 states and 334 transitions. [2024-01-27 16:07:20,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 218 transitions, 2806 flow [2024-01-27 16:07:20,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 218 transitions, 2262 flow, removed 261 selfloop flow, removed 12 redundant places. [2024-01-27 16:07:20,722 INFO L231 Difference]: Finished difference. Result has 119 places, 70 transitions, 1007 flow [2024-01-27 16:07:20,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1007, PETRI_PLACES=119, PETRI_TRANSITIONS=70} [2024-01-27 16:07:20,723 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 93 predicate places. [2024-01-27 16:07:20,723 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 70 transitions, 1007 flow [2024-01-27 16:07:20,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:20,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:20,724 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:20,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-01-27 16:07:20,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:20,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -783274912, now seen corresponding path program 1 times [2024-01-27 16:07:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272722676] [2024-01-27 16:07:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272722676] [2024-01-27 16:07:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272722676] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836107622] [2024-01-27 16:07:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:21,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:21,036 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-01-27 16:07:21,060 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-01-27 16:07:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:21,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 16:07:21,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:21,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836107622] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:21,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:21,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-01-27 16:07:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956561673] [2024-01-27 16:07:21,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 16:07:21,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 16:07:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-01-27 16:07:21,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:21,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 70 transitions, 1007 flow. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:21,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:21,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:21,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:21,886 INFO L124 PetriNetUnfolderBase]: 1111/2082 cut-off events. [2024-01-27 16:07:21,886 INFO L125 PetriNetUnfolderBase]: For 86453/86459 co-relation queries the response was YES. [2024-01-27 16:07:21,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14592 conditions, 2082 events. 1111/2082 cut-off events. For 86453/86459 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10761 event pairs, 153 based on Foata normal form. 69/2148 useless extension candidates. Maximal degree in co-relation 14534. Up to 490 conditions per place. [2024-01-27 16:07:21,902 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 99 selfloop transitions, 51 changer transitions 67/220 dead transitions. [2024-01-27 16:07:21,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 220 transitions, 3619 flow [2024-01-27 16:07:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-27 16:07:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-01-27 16:07:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 309 transitions. [2024-01-27 16:07:21,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-01-27 16:07:21,904 INFO L175 Difference]: Start difference. First operand has 119 places, 70 transitions, 1007 flow. Second operand 25 states and 309 transitions. [2024-01-27 16:07:21,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 220 transitions, 3619 flow [2024-01-27 16:07:21,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 220 transitions, 3039 flow, removed 274 selfloop flow, removed 15 redundant places. [2024-01-27 16:07:21,967 INFO L231 Difference]: Finished difference. Result has 135 places, 81 transitions, 1293 flow [2024-01-27 16:07:21,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1293, PETRI_PLACES=135, PETRI_TRANSITIONS=81} [2024-01-27 16:07:21,968 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 109 predicate places. [2024-01-27 16:07:21,968 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 81 transitions, 1293 flow [2024-01-27 16:07:21,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:21,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:21,968 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:21,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 16:07:22,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:22,180 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:22,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1082973550, now seen corresponding path program 2 times [2024-01-27 16:07:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419778156] [2024-01-27 16:07:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419778156] [2024-01-27 16:07:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419778156] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862716916] [2024-01-27 16:07:22,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:07:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:22,272 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-01-27 16:07:22,295 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-01-27 16:07:22,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:22,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:22,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 16:07:22,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:22,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:22,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862716916] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:22,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-01-27 16:07:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126238987] [2024-01-27 16:07:22,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:22,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 16:07:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 16:07:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-01-27 16:07:22,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:22,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 81 transitions, 1293 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:22,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:22,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:22,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:23,279 INFO L124 PetriNetUnfolderBase]: 1228/2335 cut-off events. [2024-01-27 16:07:23,279 INFO L125 PetriNetUnfolderBase]: For 138016/138022 co-relation queries the response was YES. [2024-01-27 16:07:23,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17618 conditions, 2335 events. 1228/2335 cut-off events. For 138016/138022 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12358 event pairs, 38 based on Foata normal form. 141/2475 useless extension candidates. Maximal degree in co-relation 17553. Up to 498 conditions per place. [2024-01-27 16:07:23,300 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 92 selfloop transitions, 78 changer transitions 102/275 dead transitions. [2024-01-27 16:07:23,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 275 transitions, 5195 flow [2024-01-27 16:07:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-01-27 16:07:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-01-27 16:07:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 369 transitions. [2024-01-27 16:07:23,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-01-27 16:07:23,303 INFO L175 Difference]: Start difference. First operand has 135 places, 81 transitions, 1293 flow. Second operand 30 states and 369 transitions. [2024-01-27 16:07:23,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 275 transitions, 5195 flow [2024-01-27 16:07:23,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 275 transitions, 4432 flow, removed 348 selfloop flow, removed 18 redundant places. [2024-01-27 16:07:23,455 INFO L231 Difference]: Finished difference. Result has 158 places, 102 transitions, 1932 flow [2024-01-27 16:07:23,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1932, PETRI_PLACES=158, PETRI_TRANSITIONS=102} [2024-01-27 16:07:23,456 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 132 predicate places. [2024-01-27 16:07:23,456 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 102 transitions, 1932 flow [2024-01-27 16:07:23,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:23,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:23,456 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:23,470 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-01-27 16:07:23,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:23,668 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:23,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 628730026, now seen corresponding path program 3 times [2024-01-27 16:07:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836214363] [2024-01-27 16:07:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836214363] [2024-01-27 16:07:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836214363] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212917736] [2024-01-27 16:07:23,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:07:23,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:23,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:23,822 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-01-27 16:07:23,845 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-01-27 16:07:23,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-27 16:07:23,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:23,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 16:07:23,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:23,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212917736] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:24,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:24,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-01-27 16:07:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60449507] [2024-01-27 16:07:24,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:24,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 16:07:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 16:07:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-01-27 16:07:24,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:24,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 102 transitions, 1932 flow. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:24,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:24,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:24,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:25,046 INFO L124 PetriNetUnfolderBase]: 1444/2688 cut-off events. [2024-01-27 16:07:25,046 INFO L125 PetriNetUnfolderBase]: For 202493/202499 co-relation queries the response was YES. [2024-01-27 16:07:25,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22273 conditions, 2688 events. 1444/2688 cut-off events. For 202493/202499 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 13805 event pairs, 42 based on Foata normal form. 60/2747 useless extension candidates. Maximal degree in co-relation 22198. Up to 570 conditions per place. [2024-01-27 16:07:25,070 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 114 selfloop transitions, 100 changer transitions 91/308 dead transitions. [2024-01-27 16:07:25,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 308 transitions, 6322 flow [2024-01-27 16:07:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-27 16:07:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-01-27 16:07:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2024-01-27 16:07:25,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2024-01-27 16:07:25,072 INFO L175 Difference]: Start difference. First operand has 158 places, 102 transitions, 1932 flow. Second operand 34 states and 417 transitions. [2024-01-27 16:07:25,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 308 transitions, 6322 flow [2024-01-27 16:07:25,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 308 transitions, 5234 flow, removed 514 selfloop flow, removed 20 redundant places. [2024-01-27 16:07:25,312 INFO L231 Difference]: Finished difference. Result has 179 places, 124 transitions, 2472 flow [2024-01-27 16:07:25,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2472, PETRI_PLACES=179, PETRI_TRANSITIONS=124} [2024-01-27 16:07:25,313 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 153 predicate places. [2024-01-27 16:07:25,313 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 124 transitions, 2472 flow [2024-01-27 16:07:25,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:25,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:25,313 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:25,330 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-01-27 16:07:25,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 16:07:25,528 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:25,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2090442361, now seen corresponding path program 4 times [2024-01-27 16:07:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:25,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206496571] [2024-01-27 16:07:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:25,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:07:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:25,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:07:25,562 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:07:25,563 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-01-27 16:07:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-01-27 16:07:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-01-27 16:07:25,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:07:25,565 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2024-01-27 16:07:25,569 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:07:25,569 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:07:25,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:07:25 BasicIcfg [2024-01-27 16:07:25,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:07:25,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:07:25,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:07:25,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:07:25,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:16" (3/4) ... [2024-01-27 16:07:25,604 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:07:25,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:07:25,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:07:25,647 INFO L158 Benchmark]: Toolchain (without parser) took 9881.33ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 91.2MB in the beginning and 124.8MB in the end (delta: -33.7MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,647 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 89.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:07:25,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.01ms. Allocated memory is still 125.8MB. Free memory was 91.2MB in the beginning and 70.9MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.91ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 69.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,648 INFO L158 Benchmark]: Boogie Preprocessor took 52.54ms. Allocated memory is still 125.8MB. Free memory was 69.2MB in the beginning and 66.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,648 INFO L158 Benchmark]: RCFGBuilder took 425.54ms. Allocated memory is still 125.8MB. Free memory was 66.8MB in the beginning and 82.6MB in the end (delta: -15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,649 INFO L158 Benchmark]: TraceAbstraction took 8925.63ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 81.8MB in the beginning and 133.2MB in the end (delta: -51.4MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,649 INFO L158 Benchmark]: Witness Printer took 43.86ms. Allocated memory is still 308.3MB. Free memory was 133.2MB in the beginning and 124.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:07:25,650 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 89.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.01ms. Allocated memory is still 125.8MB. Free memory was 91.2MB in the beginning and 70.9MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.91ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 69.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.54ms. Allocated memory is still 125.8MB. Free memory was 69.2MB in the beginning and 66.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.54ms. Allocated memory is still 125.8MB. Free memory was 66.8MB in the beginning and 82.6MB in the end (delta: -15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8925.63ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 81.8MB in the beginning and 133.2MB in the end (delta: -51.4MB). Peak memory consumption was 132.8MB. Max. memory is 16.1GB. * Witness Printer took 43.86ms. Allocated memory is still 308.3MB. Free memory was 133.2MB in the beginning and 124.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, argc=51, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6, k=0] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, i=7, id1={5:0}, id2={3:0}, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, condJ=1, i=15, id1={5:0}, id2={3:0}, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1765 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1740 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2879 IncrementalHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 8 mSDtfsCounter, 2879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2472occurred in iteration=11, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1545 SizeOfPredicates, 27 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:07:25,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE