./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix021.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/mix021.opt.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 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:10:27,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:10:27,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:10:27,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:10:27,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:10:27,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:10:27,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:10:27,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:10:27,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:10:27,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:10:27,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:10:27,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:10:27,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:10:27,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:10:27,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:10:27,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:10:27,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:10:27,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:10:27,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:10:27,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:10:27,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:10:27,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:10:27,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:10:27,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:10:27,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:10:27,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:10:27,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:10:27,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:10:27,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:10:27,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:10:27,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:10:27,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:10:27,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:10:27,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:10:27,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:10:27,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:10:27,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:10:27,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:10:27,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:10:27,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:10:27,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:10:27,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:10:27,986 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 -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db [2024-11-16 19:10:28,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:10:28,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:10:28,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:10:28,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:10:28,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:10:28,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021.opt.i [2024-11-16 19:10:29,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:10:29,755 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:10:29,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021.opt.i [2024-11-16 19:10:29,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e1290cf/33b1d0462965408d82e743f7c2a78520/FLAG539a07ca4 [2024-11-16 19:10:29,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e1290cf/33b1d0462965408d82e743f7c2a78520 [2024-11-16 19:10:29,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:10:29,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:10:29,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:10:29,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:10:29,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:10:29,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:10:29" (1/1) ... [2024-11-16 19:10:29,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e96dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:29, skipping insertion in model container [2024-11-16 19:10:29,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:10:29" (1/1) ... [2024-11-16 19:10:29,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:10:30,047 WARN L250 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-wmm/mix021.opt.i[944,957] [2024-11-16 19:10:30,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:10:30,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:10:30,240 WARN L250 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-wmm/mix021.opt.i[944,957] [2024-11-16 19:10:30,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:10:30,341 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:10:30,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30 WrapperNode [2024-11-16 19:10:30,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:10:30,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:10:30,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:10:30,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:10:30,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,384 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-11-16 19:10:30,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:10:30,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:10:30,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:10:30,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:10:30,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,418 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:10:30,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:10:30,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:10:30,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:10:30,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:10:30,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (1/1) ... [2024-11-16 19:10:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:10:30,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:10:30,471 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-11-16 19:10:30,480 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-11-16 19:10:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:10:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:10:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:10:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:10:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:10:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:10:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:10:30,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:10:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-16 19:10:30,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-16 19:10:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:10:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:10:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:10:30,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:10:30,527 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:10:30,655 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:10:30,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:10:30,958 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:10:30,959 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:10:31,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:10:31,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:10:31,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:10:31 BoogieIcfgContainer [2024-11-16 19:10:31,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:10:31,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:10:31,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:10:31,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:10:31,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:10:29" (1/3) ... [2024-11-16 19:10:31,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3e5674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:10:31, skipping insertion in model container [2024-11-16 19:10:31,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:30" (2/3) ... [2024-11-16 19:10:31,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3e5674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:10:31, skipping insertion in model container [2024-11-16 19:10:31,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:10:31" (3/3) ... [2024-11-16 19:10:31,127 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2024-11-16 19:10:31,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:10:31,148 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:10:31,148 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:10:31,200 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:10:31,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-11-16 19:10:31,246 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-11-16 19:10:31,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:10:31,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-16 19:10:31,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-11-16 19:10:31,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-11-16 19:10:31,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:10:31,263 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;@7e6ea465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:10:31,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-16 19:10:31,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:10:31,289 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-16 19:10:31,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:10:31,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:31,290 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:31,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 535059963, now seen corresponding path program 1 times [2024-11-16 19:10:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102601101] [2024-11-16 19:10:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:31,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:31,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:31,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102601101] [2024-11-16 19:10:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102601101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:31,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:31,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:10:31,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426545978] [2024-11-16 19:10:31,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:31,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:10:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:10:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:10:31,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:31,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-16 19:10:31,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:31,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:31,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:36,354 INFO L124 PetriNetUnfolderBase]: 45383/59987 cut-off events. [2024-11-16 19:10:36,355 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2024-11-16 19:10:36,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120019 conditions, 59987 events. 45383/59987 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 1775. Compared 346387 event pairs, 5855 based on Foata normal form. 1512/61464 useless extension candidates. Maximal degree in co-relation 120007. Up to 51193 conditions per place. [2024-11-16 19:10:36,665 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 56 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2024-11-16 19:10:36,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 264 flow [2024-11-16 19:10:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:10:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:10:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-16 19:10:36,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-11-16 19:10:36,676 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 93 transitions. [2024-11-16 19:10:36,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 264 flow [2024-11-16 19:10:36,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 260 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 19:10:36,683 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-11-16 19:10:36,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-16 19:10:36,688 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-16 19:10:36,688 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-11-16 19:10:36,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-16 19:10:36,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:36,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:36,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:10:36,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:36,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1309494725, now seen corresponding path program 1 times [2024-11-16 19:10:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018275373] [2024-11-16 19:10:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018275373] [2024-11-16 19:10:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018275373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:36,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:36,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:10:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151705144] [2024-11-16 19:10:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:36,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:10:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:10:36,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:10:36,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:36,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:36,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:36,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:36,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:40,609 INFO L124 PetriNetUnfolderBase]: 36511/51135 cut-off events. [2024-11-16 19:10:40,609 INFO L125 PetriNetUnfolderBase]: For 1560/1560 co-relation queries the response was YES. [2024-11-16 19:10:40,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101933 conditions, 51135 events. 36511/51135 cut-off events. For 1560/1560 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 330134 event pairs, 4407 based on Foata normal form. 1512/52624 useless extension candidates. Maximal degree in co-relation 101923. Up to 29929 conditions per place. [2024-11-16 19:10:40,954 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 75 selfloop transitions, 6 changer transitions 1/88 dead transitions. [2024-11-16 19:10:40,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 362 flow [2024-11-16 19:10:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:10:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:10:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-11-16 19:10:40,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-11-16 19:10:40,959 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 124 transitions. [2024-11-16 19:10:40,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 362 flow [2024-11-16 19:10:40,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:10:40,971 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-11-16 19:10:40,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-11-16 19:10:40,973 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-16 19:10:40,973 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-11-16 19:10:40,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:40,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:40,974 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] [2024-11-16 19:10:40,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:10:40,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:40,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash 343833574, now seen corresponding path program 1 times [2024-11-16 19:10:40,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:40,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15960138] [2024-11-16 19:10:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:40,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:41,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15960138] [2024-11-16 19:10:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15960138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:41,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:10:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527116137] [2024-11-16 19:10:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:10:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:10:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:10:41,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:41,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-16 19:10:41,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:41,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:43,282 INFO L124 PetriNetUnfolderBase]: 23071/32511 cut-off events. [2024-11-16 19:10:43,283 INFO L125 PetriNetUnfolderBase]: For 6336/6336 co-relation queries the response was YES. [2024-11-16 19:10:43,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72887 conditions, 32511 events. 23071/32511 cut-off events. For 6336/6336 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 196480 event pairs, 2563 based on Foata normal form. 1192/33680 useless extension candidates. Maximal degree in co-relation 72875. Up to 13513 conditions per place. [2024-11-16 19:10:43,449 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 97 selfloop transitions, 10 changer transitions 1/114 dead transitions. [2024-11-16 19:10:43,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 114 transitions, 515 flow [2024-11-16 19:10:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:10:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:10:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-11-16 19:10:43,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-11-16 19:10:43,452 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 160 transitions. [2024-11-16 19:10:43,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 114 transitions, 515 flow [2024-11-16 19:10:43,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 114 transitions, 504 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-16 19:10:43,459 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-11-16 19:10:43,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-16 19:10:43,459 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-11-16 19:10:43,460 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-11-16 19:10:43,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-16 19:10:43,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:43,460 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-11-16 19:10:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:10:43,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:43,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 883588245, now seen corresponding path program 1 times [2024-11-16 19:10:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926428149] [2024-11-16 19:10:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926428149] [2024-11-16 19:10:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926428149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:43,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:43,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:10:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808426489] [2024-11-16 19:10:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:43,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:43,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-11-16 19:10:43,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:43,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:43,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:45,235 INFO L124 PetriNetUnfolderBase]: 13599/18975 cut-off events. [2024-11-16 19:10:45,236 INFO L125 PetriNetUnfolderBase]: For 11710/11710 co-relation queries the response was YES. [2024-11-16 19:10:45,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46679 conditions, 18975 events. 13599/18975 cut-off events. For 11710/11710 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 102702 event pairs, 2215 based on Foata normal form. 584/19536 useless extension candidates. Maximal degree in co-relation 46665. Up to 5388 conditions per place. [2024-11-16 19:10:45,316 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 117 selfloop transitions, 14 changer transitions 1/138 dead transitions. [2024-11-16 19:10:45,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 138 transitions, 674 flow [2024-11-16 19:10:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:10:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:10:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-11-16 19:10:45,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6598639455782312 [2024-11-16 19:10:45,318 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 194 transitions. [2024-11-16 19:10:45,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 138 transitions, 674 flow [2024-11-16 19:10:45,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 138 transitions, 644 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-16 19:10:45,406 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-11-16 19:10:45,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-11-16 19:10:45,407 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-11-16 19:10:45,407 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-11-16 19:10:45,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-11-16 19:10:45,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:45,407 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, 1, 1, 1, 1, 1] [2024-11-16 19:10:45,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:10:45,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:45,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1307719856, now seen corresponding path program 1 times [2024-11-16 19:10:45,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882434767] [2024-11-16 19:10:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882434767] [2024-11-16 19:10:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882434767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:10:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386855769] [2024-11-16 19:10:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:10:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:10:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:10:45,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:45,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-11-16 19:10:45,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:45,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:46,569 INFO L124 PetriNetUnfolderBase]: 10399/14255 cut-off events. [2024-11-16 19:10:46,570 INFO L125 PetriNetUnfolderBase]: For 11302/11302 co-relation queries the response was YES. [2024-11-16 19:10:46,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36424 conditions, 14255 events. 10399/14255 cut-off events. For 11302/11302 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 73775 event pairs, 2043 based on Foata normal form. 152/14384 useless extension candidates. Maximal degree in co-relation 36409. Up to 5376 conditions per place. [2024-11-16 19:10:46,634 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 101 selfloop transitions, 18 changer transitions 1/126 dead transitions. [2024-11-16 19:10:46,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 126 transitions, 636 flow [2024-11-16 19:10:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:10:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:10:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-11-16 19:10:46,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5597667638483965 [2024-11-16 19:10:46,635 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 192 transitions. [2024-11-16 19:10:46,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 126 transitions, 636 flow [2024-11-16 19:10:46,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 590 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-16 19:10:46,789 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-11-16 19:10:46,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-11-16 19:10:46,789 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-11-16 19:10:46,790 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-11-16 19:10:46,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-11-16 19:10:46,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:46,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:46,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:10:46,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:46,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1970760872, now seen corresponding path program 1 times [2024-11-16 19:10:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:46,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813402231] [2024-11-16 19:10:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:47,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:47,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813402231] [2024-11-16 19:10:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813402231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:10:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663506727] [2024-11-16 19:10:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:47,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:47,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:47,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:47,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:47,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:47,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:49,112 INFO L124 PetriNetUnfolderBase]: 21047/28963 cut-off events. [2024-11-16 19:10:49,112 INFO L125 PetriNetUnfolderBase]: For 24400/24400 co-relation queries the response was YES. [2024-11-16 19:10:49,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74737 conditions, 28963 events. 21047/28963 cut-off events. For 24400/24400 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 165952 event pairs, 3983 based on Foata normal form. 32/28990 useless extension candidates. Maximal degree in co-relation 74721. Up to 12589 conditions per place. [2024-11-16 19:10:49,283 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 97 selfloop transitions, 9 changer transitions 42/154 dead transitions. [2024-11-16 19:10:49,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 154 transitions, 1002 flow [2024-11-16 19:10:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:10:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:10:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-11-16 19:10:49,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2024-11-16 19:10:49,284 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 8 states and 194 transitions. [2024-11-16 19:10:49,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 154 transitions, 1002 flow [2024-11-16 19:10:49,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 154 transitions, 720 flow, removed 51 selfloop flow, removed 10 redundant places. [2024-11-16 19:10:49,750 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 220 flow [2024-11-16 19:10:49,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-11-16 19:10:49,751 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2024-11-16 19:10:49,751 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 220 flow [2024-11-16 19:10:49,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:49,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:49,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:49,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:10:49,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:49,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:49,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1251145630, now seen corresponding path program 2 times [2024-11-16 19:10:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846463288] [2024-11-16 19:10:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846463288] [2024-11-16 19:10:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846463288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:50,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:50,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:10:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690817865] [2024-11-16 19:10:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:50,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:50,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:50,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:50,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:50,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:50,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:51,634 INFO L124 PetriNetUnfolderBase]: 15335/21347 cut-off events. [2024-11-16 19:10:51,634 INFO L125 PetriNetUnfolderBase]: For 8379/8379 co-relation queries the response was YES. [2024-11-16 19:10:51,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53389 conditions, 21347 events. 15335/21347 cut-off events. For 8379/8379 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 116210 event pairs, 3167 based on Foata normal form. 16/21361 useless extension candidates. Maximal degree in co-relation 53371. Up to 13064 conditions per place. [2024-11-16 19:10:51,760 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 65 selfloop transitions, 1 changer transitions 66/138 dead transitions. [2024-11-16 19:10:51,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 138 transitions, 759 flow [2024-11-16 19:10:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:10:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:10:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-16 19:10:51,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-11-16 19:10:51,761 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 220 flow. Second operand 6 states and 151 transitions. [2024-11-16 19:10:51,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 138 transitions, 759 flow [2024-11-16 19:10:51,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 735 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-16 19:10:51,770 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 212 flow [2024-11-16 19:10:51,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-11-16 19:10:51,771 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2024-11-16 19:10:51,771 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 212 flow [2024-11-16 19:10:51,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:51,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:51,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:51,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:10:51,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:51,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1322267814, now seen corresponding path program 3 times [2024-11-16 19:10:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266951233] [2024-11-16 19:10:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266951233] [2024-11-16 19:10:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266951233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:52,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:10:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761302365] [2024-11-16 19:10:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:10:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:10:52,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:10:52,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 49 [2024-11-16 19:10:52,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:52,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:52,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 49 [2024-11-16 19:10:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:53,905 INFO L124 PetriNetUnfolderBase]: 14581/20501 cut-off events. [2024-11-16 19:10:53,909 INFO L125 PetriNetUnfolderBase]: For 8573/8578 co-relation queries the response was YES. [2024-11-16 19:10:53,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50685 conditions, 20501 events. 14581/20501 cut-off events. For 8573/8578 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 114852 event pairs, 3147 based on Foata normal form. 16/20509 useless extension candidates. Maximal degree in co-relation 50667. Up to 11100 conditions per place. [2024-11-16 19:10:54,006 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 67 selfloop transitions, 6 changer transitions 58/137 dead transitions. [2024-11-16 19:10:54,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 731 flow [2024-11-16 19:10:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:10:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:10:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-16 19:10:54,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-11-16 19:10:54,008 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 212 flow. Second operand 6 states and 156 transitions. [2024-11-16 19:10:54,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 731 flow [2024-11-16 19:10:54,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 137 transitions, 719 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-16 19:10:54,023 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 208 flow [2024-11-16 19:10:54,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2024-11-16 19:10:54,024 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2024-11-16 19:10:54,024 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 208 flow [2024-11-16 19:10:54,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:54,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:54,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:54,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:10:54,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:10:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 322121608, now seen corresponding path program 4 times [2024-11-16 19:10:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804001688] [2024-11-16 19:10:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:10:54,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:10:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:10:54,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:10:54,210 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:10:54,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-16 19:10:54,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-16 19:10:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-16 19:10:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-16 19:10:54,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-16 19:10:54,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-16 19:10:54,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-16 19:10:54,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:10:54,217 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-16 19:10:54,312 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:10:54,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:10:54,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:10:54 BasicIcfg [2024-11-16 19:10:54,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:10:54,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:10:54,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:10:54,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:10:54,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:10:31" (3/4) ... [2024-11-16 19:10:54,322 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:10:54,415 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:10:54,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:10:54,415 INFO L158 Benchmark]: Toolchain (without parser) took 24607.46ms. Allocated memory was 132.1MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 103.5MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2024-11-16 19:10:54,416 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 132.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:10:54,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.43ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 103.3MB in the beginning and 145.4MB in the end (delta: -42.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 19:10:54,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.70ms. Allocated memory is still 197.1MB. Free memory was 145.4MB in the beginning and 142.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:10:54,416 INFO L158 Benchmark]: Boogie Preprocessor took 57.83ms. Allocated memory is still 197.1MB. Free memory was 142.3MB in the beginning and 139.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:10:54,416 INFO L158 Benchmark]: IcfgBuilder took 677.12ms. Allocated memory is still 197.1MB. Free memory was 139.1MB in the beginning and 75.2MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-16 19:10:54,417 INFO L158 Benchmark]: TraceAbstraction took 23198.32ms. Allocated memory was 197.1MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 75.2MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. [2024-11-16 19:10:54,417 INFO L158 Benchmark]: Witness Printer took 94.11ms. Allocated memory is still 9.4GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 19:10:54,418 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.10ms. Allocated memory is still 132.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.43ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 103.3MB in the beginning and 145.4MB in the end (delta: -42.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.70ms. Allocated memory is still 197.1MB. Free memory was 145.4MB in the beginning and 142.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.83ms. Allocated memory is still 197.1MB. Free memory was 142.3MB in the beginning and 139.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 677.12ms. Allocated memory is still 197.1MB. Free memory was 139.1MB in the beginning and 75.2MB in the end (delta: 64.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23198.32ms. Allocated memory was 197.1MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 75.2MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. * Witness Printer took 94.11ms. Allocated memory is still 9.4GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L862] 0 pthread_t t557; [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t558; [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t559; [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t560; [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557=-3, t558=-2, t559=-1, t560=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 865]: 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: 867]: 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: 863]: 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 9 procedures, 83 locations, 7 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: 23.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1486 IncrementalHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3 mSDtfsCounter, 1486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=5, InterpolantAutomatonStates: 45, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-11-16 19:10:54,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE