./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:39:05,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:39:05,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:39:05,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:39:05,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:39:05,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:39:05,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:39:05,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:39:05,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:39:05,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:39:05,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:39:05,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:39:05,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:39:05,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:39:05,735 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:39:05,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:39:05,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:39:05,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:39:05,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:39:05,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:39:05,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:39:05,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:39:05,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:39:05,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:39:05,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:39:05,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:39:05,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:39:05,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:39:05,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:39:05,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:39:05,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:39:05,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:39:05,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:39:05,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:39:05,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:39:05,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:39:05,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:39:05,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:39:05,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:39:05,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:39:05,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:39:05,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:39:05,741 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-10-24 12:39:05,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:39:05,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:39:05,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:39:05,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:39:05,998 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:39:05,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-10-24 12:39:07,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:39:07,584 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:39:07,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-10-24 12:39:07,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800db2f21/aedbaace84514ef8b5ce8ba85dfb3688/FLAG3e7723701 [2024-10-24 12:39:07,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800db2f21/aedbaace84514ef8b5ce8ba85dfb3688 [2024-10-24 12:39:07,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:39:07,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:39:07,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:39:07,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:39:07,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:39:07,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:39:07" (1/1) ... [2024-10-24 12:39:07,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29594b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:07, skipping insertion in model container [2024-10-24 12:39:07,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:39:07" (1/1) ... [2024-10-24 12:39:07,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:39:08,138 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-10-24 12:39:08,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:39:08,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:39:08,203 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-10-24 12:39:08,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:39:08,253 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:39:08,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08 WrapperNode [2024-10-24 12:39:08,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:39:08,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:39:08,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:39:08,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:39:08,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,297 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-10-24 12:39:08,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:39:08,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:39:08,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:39:08,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:39:08,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,326 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-10-24 12:39:08,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:39:08,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:39:08,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:39:08,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:39:08,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (1/1) ... [2024-10-24 12:39:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:39:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:39:08,396 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-10-24 12:39:08,399 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-10-24 12:39:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 12:39:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 12:39:08,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 12:39:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 12:39:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 12:39:08,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 12:39:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 12:39:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 12:39:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 12:39:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:39:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:39:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:39:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 12:39:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:39:08,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:39:08,452 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:39:08,607 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:39:08,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:39:08,788 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:39:08,788 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:39:08,943 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:39:08,944 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-24 12:39:08,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:39:08 BoogieIcfgContainer [2024-10-24 12:39:08,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:39:08,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:39:08,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:39:08,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:39:08,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:39:07" (1/3) ... [2024-10-24 12:39:08,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ced6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:39:08, skipping insertion in model container [2024-10-24 12:39:08,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:08" (2/3) ... [2024-10-24 12:39:08,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ced6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:39:08, skipping insertion in model container [2024-10-24 12:39:08,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:39:08" (3/3) ... [2024-10-24 12:39:08,956 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-10-24 12:39:08,972 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:39:08,973 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:39:08,973 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:39:09,015 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 12:39:09,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-10-24 12:39:09,128 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-10-24 12:39:09,129 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 12:39:09,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2024-10-24 12:39:09,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-10-24 12:39:09,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 76 flow [2024-10-24 12:39:09,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:39:09,150 INFO L333 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, 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;@3f559f0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:39:09,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-24 12:39:09,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:39:09,168 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-10-24 12:39:09,168 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 12:39:09,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:09,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:09,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:09,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash -875147706, now seen corresponding path program 1 times [2024-10-24 12:39:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66646080] [2024-10-24 12:39:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:39:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66646080] [2024-10-24 12:39:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66646080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:39:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:39:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:39:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376132104] [2024-10-24 12:39:09,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:39:09,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:39:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:39:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:39:09,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-10-24 12:39:09,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:39:09,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:09,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-10-24 12:39:09,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:09,778 INFO L124 PetriNetUnfolderBase]: 429/782 cut-off events. [2024-10-24 12:39:09,779 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-10-24 12:39:09,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 782 events. 429/782 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3649 event pairs, 169 based on Foata normal form. 18/787 useless extension candidates. Maximal degree in co-relation 1424. Up to 399 conditions per place. [2024-10-24 12:39:09,790 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 38 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-10-24 12:39:09,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 193 flow [2024-10-24 12:39:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:39:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:39:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-10-24 12:39:09,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2024-10-24 12:39:09,801 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-10-24 12:39:09,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 193 flow [2024-10-24 12:39:09,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 183 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 12:39:09,808 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 80 flow [2024-10-24 12:39:09,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2024-10-24 12:39:09,813 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-10-24 12:39:09,815 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 80 flow [2024-10-24 12:39:09,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:39:09,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:09,816 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:09,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:39:09,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:09,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 156033436, now seen corresponding path program 1 times [2024-10-24 12:39:09,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:09,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640546437] [2024-10-24 12:39:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:39:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640546437] [2024-10-24 12:39:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640546437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:39:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:39:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:39:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089846159] [2024-10-24 12:39:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:39:09,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:39:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:39:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:39:09,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-10-24 12:39:09,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-24 12:39:09,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:09,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-10-24 12:39:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:10,098 INFO L124 PetriNetUnfolderBase]: 732/1317 cut-off events. [2024-10-24 12:39:10,098 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-10-24 12:39:10,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 1317 events. 732/1317 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6663 event pairs, 295 based on Foata normal form. 29/1324 useless extension candidates. Maximal degree in co-relation 974. Up to 683 conditions per place. [2024-10-24 12:39:10,109 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 39 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-10-24 12:39:10,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 207 flow [2024-10-24 12:39:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:39:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:39:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-10-24 12:39:10,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2024-10-24 12:39:10,112 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 80 flow. Second operand 3 states and 79 transitions. [2024-10-24 12:39:10,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 207 flow [2024-10-24 12:39:10,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:39:10,115 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 90 flow [2024-10-24 12:39:10,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2024-10-24 12:39:10,117 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-10-24 12:39:10,118 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 90 flow [2024-10-24 12:39:10,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-24 12:39:10,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:10,118 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:10,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:39:10,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2032794052, now seen corresponding path program 1 times [2024-10-24 12:39:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153192663] [2024-10-24 12:39:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:39:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:10,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153192663] [2024-10-24 12:39:10,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153192663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:39:10,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:39:10,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:39:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767864719] [2024-10-24 12:39:10,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:39:10,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:39:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:39:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:39:10,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-10-24 12:39:10,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-10-24 12:39:10,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:10,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-10-24 12:39:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:10,404 INFO L124 PetriNetUnfolderBase]: 427/899 cut-off events. [2024-10-24 12:39:10,404 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-10-24 12:39:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 899 events. 427/899 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4315 event pairs, 182 based on Foata normal form. 64/962 useless extension candidates. Maximal degree in co-relation 632. Up to 372 conditions per place. [2024-10-24 12:39:10,409 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 29 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-10-24 12:39:10,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 208 flow [2024-10-24 12:39:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:39:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:39:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-10-24 12:39:10,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-24 12:39:10,413 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 90 flow. Second operand 3 states and 76 transitions. [2024-10-24 12:39:10,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 208 flow [2024-10-24 12:39:10,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:39:10,415 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 104 flow [2024-10-24 12:39:10,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2024-10-24 12:39:10,416 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-10-24 12:39:10,417 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 104 flow [2024-10-24 12:39:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-10-24 12:39:10,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:10,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:10,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:39:10,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -195138254, now seen corresponding path program 2 times [2024-10-24 12:39:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:10,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584313086] [2024-10-24 12:39:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:39:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584313086] [2024-10-24 12:39:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584313086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:39:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965992395] [2024-10-24 12:39:10,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 12:39:10,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:39:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:39:10,499 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-10-24 12:39:10,501 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-10-24 12:39:10,603 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 12:39:10,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:39:10,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 12:39:10,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:39:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:39:10,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:39:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:39:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965992395] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:39:10,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:39:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-24 12:39:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929398652] [2024-10-24 12:39:10,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:39:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:39:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:39:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:39:10,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-10-24 12:39:10,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-10-24 12:39:10,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:10,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-10-24 12:39:10,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:11,105 INFO L124 PetriNetUnfolderBase]: 1117/2174 cut-off events. [2024-10-24 12:39:11,105 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2024-10-24 12:39:11,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5149 conditions, 2174 events. 1117/2174 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11489 event pairs, 71 based on Foata normal form. 128/2294 useless extension candidates. Maximal degree in co-relation 1343. Up to 370 conditions per place. [2024-10-24 12:39:11,119 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 150 selfloop transitions, 27 changer transitions 0/185 dead transitions. [2024-10-24 12:39:11,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 185 transitions, 971 flow [2024-10-24 12:39:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:39:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 12:39:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 343 transitions. [2024-10-24 12:39:11,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.694331983805668 [2024-10-24 12:39:11,123 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 104 flow. Second operand 13 states and 343 transitions. [2024-10-24 12:39:11,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 185 transitions, 971 flow [2024-10-24 12:39:11,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 185 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:39:11,132 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 312 flow [2024-10-24 12:39:11,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=312, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2024-10-24 12:39:11,133 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2024-10-24 12:39:11,133 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 312 flow [2024-10-24 12:39:11,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-10-24 12:39:11,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:11,134 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:11,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:39:11,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:39:11,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1300723632, now seen corresponding path program 3 times [2024-10-24 12:39:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844663903] [2024-10-24 12:39:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 12:39:11,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844663903] [2024-10-24 12:39:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844663903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:39:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139663776] [2024-10-24 12:39:11,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 12:39:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:39:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:39:11,454 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-10-24 12:39:11,459 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-10-24 12:39:11,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 12:39:11,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:39:11,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 12:39:11,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:39:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 12:39:11,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:39:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139663776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:39:11,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:39:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-24 12:39:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213432846] [2024-10-24 12:39:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:39:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:39:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:39:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:39:11,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-10-24 12:39:11,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-10-24 12:39:11,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:11,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-10-24 12:39:11,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:11,898 INFO L124 PetriNetUnfolderBase]: 1107/2236 cut-off events. [2024-10-24 12:39:11,898 INFO L125 PetriNetUnfolderBase]: For 4299/4299 co-relation queries the response was YES. [2024-10-24 12:39:11,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6639 conditions, 2236 events. 1107/2236 cut-off events. For 4299/4299 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 12064 event pairs, 270 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 4858. Up to 1062 conditions per place. [2024-10-24 12:39:11,919 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 73 selfloop transitions, 4 changer transitions 0/87 dead transitions. [2024-10-24 12:39:11,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 667 flow [2024-10-24 12:39:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:39:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:39:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-10-24 12:39:11,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723684210526315 [2024-10-24 12:39:11,921 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 312 flow. Second operand 4 states and 87 transitions. [2024-10-24 12:39:11,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 667 flow [2024-10-24 12:39:11,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 607 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-10-24 12:39:11,936 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 303 flow [2024-10-24 12:39:11,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-10-24 12:39:11,937 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2024-10-24 12:39:11,938 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 303 flow [2024-10-24 12:39:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-10-24 12:39:11,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:11,938 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:11,955 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-10-24 12:39:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:39:12,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2027455614, now seen corresponding path program 4 times [2024-10-24 12:39:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746648490] [2024-10-24 12:39:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 12:39:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746648490] [2024-10-24 12:39:12,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746648490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:39:12,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:39:12,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:39:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294393882] [2024-10-24 12:39:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:39:12,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:39:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:39:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:39:12,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-10-24 12:39:12,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-24 12:39:12,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:12,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-10-24 12:39:12,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:12,448 INFO L124 PetriNetUnfolderBase]: 748/1548 cut-off events. [2024-10-24 12:39:12,448 INFO L125 PetriNetUnfolderBase]: For 3223/3223 co-relation queries the response was YES. [2024-10-24 12:39:12,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1548 events. 748/1548 cut-off events. For 3223/3223 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7742 event pairs, 192 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 3910. Up to 1078 conditions per place. [2024-10-24 12:39:12,464 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 57 selfloop transitions, 3 changer transitions 2/72 dead transitions. [2024-10-24 12:39:12,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 495 flow [2024-10-24 12:39:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:39:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:39:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-10-24 12:39:12,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2024-10-24 12:39:12,466 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 303 flow. Second operand 3 states and 73 transitions. [2024-10-24 12:39:12,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 495 flow [2024-10-24 12:39:12,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:39:12,476 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 318 flow [2024-10-24 12:39:12,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-10-24 12:39:12,477 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-10-24 12:39:12,478 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 318 flow [2024-10-24 12:39:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-10-24 12:39:12,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:12,479 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:12,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:39:12,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:12,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2016807770, now seen corresponding path program 5 times [2024-10-24 12:39:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:12,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280285036] [2024-10-24 12:39:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:39:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 12:39:12,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:39:12,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280285036] [2024-10-24 12:39:12,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280285036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:39:12,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497887564] [2024-10-24 12:39:12,619 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 12:39:12,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:39:12,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:39:12,621 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-10-24 12:39:12,628 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-10-24 12:39:12,750 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-24 12:39:12,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:39:12,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 12:39:12,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:39:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 12:39:12,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:39:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 12:39:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497887564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:39:12,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:39:12,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-10-24 12:39:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090988865] [2024-10-24 12:39:12,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:39:12,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:39:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:39:12,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:39:12,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:39:12,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-10-24 12:39:12,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-10-24 12:39:12,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:39:12,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-10-24 12:39:12,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:39:13,109 INFO L124 PetriNetUnfolderBase]: 822/1684 cut-off events. [2024-10-24 12:39:13,109 INFO L125 PetriNetUnfolderBase]: For 3797/3806 co-relation queries the response was YES. [2024-10-24 12:39:13,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5184 conditions, 1684 events. 822/1684 cut-off events. For 3797/3806 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8178 event pairs, 103 based on Foata normal form. 49/1718 useless extension candidates. Maximal degree in co-relation 3891. Up to 546 conditions per place. [2024-10-24 12:39:13,123 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 74 selfloop transitions, 12 changer transitions 1/100 dead transitions. [2024-10-24 12:39:13,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 692 flow [2024-10-24 12:39:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:39:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:39:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-10-24 12:39:13,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6736842105263158 [2024-10-24 12:39:13,124 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 318 flow. Second operand 5 states and 128 transitions. [2024-10-24 12:39:13,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 692 flow [2024-10-24 12:39:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 680 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 12:39:13,134 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 350 flow [2024-10-24 12:39:13,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-10-24 12:39:13,135 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2024-10-24 12:39:13,135 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 350 flow [2024-10-24 12:39:13,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-10-24 12:39:13,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:39:13,136 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:39:13,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 12:39:13,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:39:13,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-24 12:39:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:39:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2092047594, now seen corresponding path program 6 times [2024-10-24 12:39:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:39:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196832063] [2024-10-24 12:39:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:39:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:39:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:39:13,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:39:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:39:13,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:39:13,406 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:39:13,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-24 12:39:13,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-24 12:39:13,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-24 12:39:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:39:13,409 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-10-24 12:39:13,469 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 12:39:13,469 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:39:13,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:39:13 BasicIcfg [2024-10-24 12:39:13,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:39:13,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:39:13,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:39:13,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:39:13,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:39:08" (3/4) ... [2024-10-24 12:39:13,477 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 12:39:13,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 12:39:13,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:39:13,541 INFO L158 Benchmark]: Toolchain (without parser) took 5920.60ms. Allocated memory was 192.9MB in the beginning and 274.7MB in the end (delta: 81.8MB). Free memory was 133.5MB in the beginning and 101.8MB in the end (delta: 31.6MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,541 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:39:13,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.08ms. Allocated memory is still 192.9MB. Free memory was 132.9MB in the beginning and 148.6MB in the end (delta: -15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 192.9MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,542 INFO L158 Benchmark]: Boogie Preprocessor took 55.72ms. Allocated memory is still 192.9MB. Free memory was 146.5MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,542 INFO L158 Benchmark]: RCFGBuilder took 590.20ms. Allocated memory is still 192.9MB. Free memory was 144.4MB in the beginning and 106.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,542 INFO L158 Benchmark]: TraceAbstraction took 4526.76ms. Allocated memory was 192.9MB in the beginning and 274.7MB in the end (delta: 81.8MB). Free memory was 106.6MB in the beginning and 114.4MB in the end (delta: -7.8MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,542 INFO L158 Benchmark]: Witness Printer took 64.99ms. Allocated memory is still 274.7MB. Free memory was 114.4MB in the beginning and 101.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 12:39:13,543 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.09ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.08ms. Allocated memory is still 192.9MB. Free memory was 132.9MB in the beginning and 148.6MB in the end (delta: -15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 192.9MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.72ms. Allocated memory is still 192.9MB. Free memory was 146.5MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.20ms. Allocated memory is still 192.9MB. Free memory was 144.4MB in the beginning and 106.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4526.76ms. Allocated memory was 192.9MB in the beginning and 274.7MB in the end (delta: 81.8MB). Free memory was 106.6MB in the beginning and 114.4MB in the end (delta: -7.8MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. * Witness Printer took 64.99ms. Allocated memory is still 274.7MB. Free memory was 114.4MB in the beginning and 101.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-2, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-2, t2=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=2, m={3:0}, num=0, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, t1=-2, t2=-1, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] - UnprovableResult [Line: 913]: 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: 914]: 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, 55 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: 4.3s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 603 IncrementalHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=7, InterpolantAutomatonStates: 34, 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, 0.9s InterpolantComputationTime, 382 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 143/183 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-10-24 12:39:13,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 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