./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:17:21,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:17:21,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:17:21,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:17:21,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:17:21,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:17:21,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:17:21,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:17:21,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:17:21,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:17:21,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:17:21,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:17:21,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:17:21,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:17:21,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:17:21,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:17:21,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:17:21,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:17:21,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:17:21,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:17:21,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:17:21,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:17:21,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:17:21,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:17:21,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:17:21,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:17:21,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:17:21,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:17:21,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:17:21,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:17:21,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:17:21,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:17:21,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:17:21,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:17:21,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:17:21,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:17:21,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:17:21,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:17:21,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:17:21,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:17:21,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:17:21,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:17:21,470 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2024-11-10 10:17:21,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:17:21,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:17:21,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:17:21,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:17:21,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:17:21,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:17:23,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:17:23,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:17:23,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:17:23,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0260013/26ca5bfee6dc4f4487199be47d8153ac/FLAGeae40abe0 [2024-11-10 10:17:23,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0260013/26ca5bfee6dc4f4487199be47d8153ac [2024-11-10 10:17:23,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:17:23,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:17:23,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:17:23,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:17:23,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:17:23,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:17:23" (1/1) ... [2024-11-10 10:17:23,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2a2193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:23, skipping insertion in model container [2024-11-10 10:17:23,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:17:23" (1/1) ... [2024-11-10 10:17:23,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:17:24,162 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2024-11-10 10:17:24,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:17:24,477 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:17:24,491 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2024-11-10 10:17:24,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:17:24,633 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:17:24,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24 WrapperNode [2024-11-10 10:17:24,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:17:24,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:17:24,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:17:24,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:17:24,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,707 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-11-10 10:17:24,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:17:24,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:17:24,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:17:24,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:17:24,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,753 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-10 10:17:24,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:17:24,790 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:17:24,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:17:24,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:17:24,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (1/1) ... [2024-11-10 10:17:24,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:17:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:17:24,829 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-10 10:17:24,836 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-10 10:17:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:17:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:17:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 10:17:24,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 10:17:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 10:17:24,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 10:17:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 10:17:24,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 10:17:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:17:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:17:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:17:24,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:17:24,887 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:17:25,057 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:17:25,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:17:25,483 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:17:25,483 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:17:25,778 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:17:25,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:17:25,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:17:25 BoogieIcfgContainer [2024-11-10 10:17:25,780 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:17:25,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:17:25,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:17:25,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:17:25,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:17:23" (1/3) ... [2024-11-10 10:17:25,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3198ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:17:25, skipping insertion in model container [2024-11-10 10:17:25,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:17:24" (2/3) ... [2024-11-10 10:17:25,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3198ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:17:25, skipping insertion in model container [2024-11-10 10:17:25,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:17:25" (3/3) ... [2024-11-10 10:17:25,825 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:17:25,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:17:25,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:17:25,844 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:17:25,904 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:17:25,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-10 10:17:25,972 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-10 10:17:25,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:17:25,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-10 10:17:25,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-10 10:17:25,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-10 10:17:25,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:17:26,001 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;@3bd0be1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:17:26,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:17:26,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:17:26,006 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-10 10:17:26,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:17:26,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:26,007 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 10:17:26,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:26,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash 13519431, now seen corresponding path program 1 times [2024-11-10 10:17:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169636596] [2024-11-10 10:17:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:26,445 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-10 10:17:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169636596] [2024-11-10 10:17:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169636596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:26,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 10:17:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308601730] [2024-11-10 10:17:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:26,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:17:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:17:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:17:26,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:17:26,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-10 10:17:26,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:26,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:17:26,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:27,794 INFO L124 PetriNetUnfolderBase]: 4775/6874 cut-off events. [2024-11-10 10:17:27,794 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-10 10:17:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13769 conditions, 6874 events. 4775/6874 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 38112 event pairs, 515 based on Foata normal form. 216/7081 useless extension candidates. Maximal degree in co-relation 13758. Up to 5951 conditions per place. [2024-11-10 10:17:27,846 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 47 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-10 10:17:27,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 229 flow [2024-11-10 10:17:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:17:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:17:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-10 10:17:27,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-10 10:17:27,860 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 78 transitions. [2024-11-10 10:17:27,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 229 flow [2024-11-10 10:17:27,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:17:27,868 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-10 10:17:27,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-10 10:17:27,875 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-10 10:17:27,877 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-10 10:17:27,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-10 10:17:27,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:27,878 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:17:27,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:17:27,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 409485166, now seen corresponding path program 1 times [2024-11-10 10:17:27,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922506666] [2024-11-10 10:17:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:29,122 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-10 10:17:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922506666] [2024-11-10 10:17:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922506666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:29,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:17:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961177205] [2024-11-10 10:17:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:29,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:17:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:17:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:17:29,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:29,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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-10 10:17:29,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:29,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:29,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:30,623 INFO L124 PetriNetUnfolderBase]: 5831/8555 cut-off events. [2024-11-10 10:17:30,623 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2024-11-10 10:17:30,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17431 conditions, 8555 events. 5831/8555 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 46978 event pairs, 827 based on Foata normal form. 0/8362 useless extension candidates. Maximal degree in co-relation 17421. Up to 4993 conditions per place. [2024-11-10 10:17:30,673 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 40 selfloop transitions, 2 changer transitions 70/116 dead transitions. [2024-11-10 10:17:30,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 116 transitions, 478 flow [2024-11-10 10:17:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:17:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:17:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-11-10 10:17:30,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2024-11-10 10:17:30,678 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 170 transitions. [2024-11-10 10:17:30,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 116 transitions, 478 flow [2024-11-10 10:17:30,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 116 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:17:30,682 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 86 flow [2024-11-10 10:17:30,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2024-11-10 10:17:30,683 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-10 10:17:30,684 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 86 flow [2024-11-10 10:17:30,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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-10 10:17:30,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:30,685 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:17:30,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:17:30,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash -858496273, now seen corresponding path program 1 times [2024-11-10 10:17:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542916868] [2024-11-10 10:17:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:31,460 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-10 10:17:31,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542916868] [2024-11-10 10:17:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542916868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:17:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840609001] [2024-11-10 10:17:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:31,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:17:31,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:17:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:17:31,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:31,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10 10:17:31,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:31,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:31,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:32,594 INFO L124 PetriNetUnfolderBase]: 4448/6580 cut-off events. [2024-11-10 10:17:32,595 INFO L125 PetriNetUnfolderBase]: For 1308/1308 co-relation queries the response was YES. [2024-11-10 10:17:32,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14598 conditions, 6580 events. 4448/6580 cut-off events. For 1308/1308 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 35225 event pairs, 645 based on Foata normal form. 180/6752 useless extension candidates. Maximal degree in co-relation 14583. Up to 4836 conditions per place. [2024-11-10 10:17:32,640 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 42 selfloop transitions, 2 changer transitions 49/97 dead transitions. [2024-11-10 10:17:32,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 97 transitions, 417 flow [2024-11-10 10:17:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:17:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:17:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-11-10 10:17:32,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2024-11-10 10:17:32,645 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 86 flow. Second operand 7 states and 144 transitions. [2024-11-10 10:17:32,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 97 transitions, 417 flow [2024-11-10 10:17:32,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 97 transitions, 395 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 10:17:32,699 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 90 flow [2024-11-10 10:17:32,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2024-11-10 10:17:32,700 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-11-10 10:17:32,700 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 90 flow [2024-11-10 10:17:32,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10 10:17:32,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:32,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:17:32,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:17:32,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:32,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 784280240, now seen corresponding path program 1 times [2024-11-10 10:17:32,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117611255] [2024-11-10 10:17:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:32,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:32,993 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-10 10:17:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:32,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117611255] [2024-11-10 10:17:32,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117611255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:32,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:32,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:17:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485695805] [2024-11-10 10:17:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:32,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:17:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:32,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:17:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:17:32,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:32,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:32,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:32,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:32,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:33,888 INFO L124 PetriNetUnfolderBase]: 4083/6039 cut-off events. [2024-11-10 10:17:33,888 INFO L125 PetriNetUnfolderBase]: For 1614/1614 co-relation queries the response was YES. [2024-11-10 10:17:33,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13687 conditions, 6039 events. 4083/6039 cut-off events. For 1614/1614 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 31088 event pairs, 1109 based on Foata normal form. 150/6176 useless extension candidates. Maximal degree in co-relation 13671. Up to 3715 conditions per place. [2024-11-10 10:17:33,926 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 40 selfloop transitions, 2 changer transitions 47/93 dead transitions. [2024-11-10 10:17:33,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 405 flow [2024-11-10 10:17:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:17:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:17:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-11-10 10:17:33,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-11-10 10:17:33,928 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 90 flow. Second operand 7 states and 140 transitions. [2024-11-10 10:17:33,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 405 flow [2024-11-10 10:17:33,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 93 transitions, 383 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 10:17:33,983 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 94 flow [2024-11-10 10:17:33,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2024-11-10 10:17:33,984 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-10 10:17:33,985 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 94 flow [2024-11-10 10:17:33,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:33,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:33,985 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:17:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:17:33,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1269002994, now seen corresponding path program 1 times [2024-11-10 10:17:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761816748] [2024-11-10 10:17:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:34,292 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-10 10:17:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761816748] [2024-11-10 10:17:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761816748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:34,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:17:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879089979] [2024-11-10 10:17:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:17:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:17:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:17:34,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:34,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:34,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:34,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:34,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:35,333 INFO L124 PetriNetUnfolderBase]: 5111/7483 cut-off events. [2024-11-10 10:17:35,334 INFO L125 PetriNetUnfolderBase]: For 1804/1804 co-relation queries the response was YES. [2024-11-10 10:17:35,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17208 conditions, 7483 events. 5111/7483 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 40659 event pairs, 935 based on Foata normal form. 120/7597 useless extension candidates. Maximal degree in co-relation 17191. Up to 2933 conditions per place. [2024-11-10 10:17:35,369 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 52 selfloop transitions, 3 changer transitions 51/110 dead transitions. [2024-11-10 10:17:35,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 110 transitions, 497 flow [2024-11-10 10:17:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:17:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:17:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-11-10 10:17:35,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2024-11-10 10:17:35,372 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 94 flow. Second operand 8 states and 164 transitions. [2024-11-10 10:17:35,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 110 transitions, 497 flow [2024-11-10 10:17:35,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 110 transitions, 463 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-11-10 10:17:35,392 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 100 flow [2024-11-10 10:17:35,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2024-11-10 10:17:35,393 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2024-11-10 10:17:35,393 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 100 flow [2024-11-10 10:17:35,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:35,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:35,394 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] [2024-11-10 10:17:35,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:17:35,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1453329710, now seen corresponding path program 1 times [2024-11-10 10:17:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074003950] [2024-11-10 10:17:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:36,347 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-10 10:17:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074003950] [2024-11-10 10:17:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074003950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:36,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:36,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:17:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547024716] [2024-11-10 10:17:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:36,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:17:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:17:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:17:36,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:36,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 100 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10 10:17:36,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:36,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:37,337 INFO L124 PetriNetUnfolderBase]: 3938/5849 cut-off events. [2024-11-10 10:17:37,337 INFO L125 PetriNetUnfolderBase]: For 2085/2085 co-relation queries the response was YES. [2024-11-10 10:17:37,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13807 conditions, 5849 events. 3938/5849 cut-off events. For 2085/2085 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 29703 event pairs, 456 based on Foata normal form. 80/5928 useless extension candidates. Maximal degree in co-relation 13789. Up to 2786 conditions per place. [2024-11-10 10:17:37,363 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 57 selfloop transitions, 7 changer transitions 34/102 dead transitions. [2024-11-10 10:17:37,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 102 transitions, 483 flow [2024-11-10 10:17:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:17:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:17:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-11-10 10:17:37,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5421245421245421 [2024-11-10 10:17:37,365 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 100 flow. Second operand 7 states and 148 transitions. [2024-11-10 10:17:37,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 102 transitions, 483 flow [2024-11-10 10:17:37,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 102 transitions, 441 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-10 10:17:37,387 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 132 flow [2024-11-10 10:17:37,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2024-11-10 10:17:37,388 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-10 10:17:37,388 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 132 flow [2024-11-10 10:17:37,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10 10:17:37,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:37,389 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] [2024-11-10 10:17:37,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:17:37,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1530867542, now seen corresponding path program 2 times [2024-11-10 10:17:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669648863] [2024-11-10 10:17:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:37,883 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-10 10:17:37,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:37,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669648863] [2024-11-10 10:17:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669648863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:17:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911116048] [2024-11-10 10:17:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:37,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:17:37,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:17:37,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:17:37,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:37,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:37,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:37,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:37,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:38,889 INFO L124 PetriNetUnfolderBase]: 6249/9257 cut-off events. [2024-11-10 10:17:38,889 INFO L125 PetriNetUnfolderBase]: For 3233/3233 co-relation queries the response was YES. [2024-11-10 10:17:38,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22922 conditions, 9257 events. 6249/9257 cut-off events. For 3233/3233 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 50882 event pairs, 2115 based on Foata normal form. 80/9336 useless extension candidates. Maximal degree in co-relation 22906. Up to 4710 conditions per place. [2024-11-10 10:17:38,926 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 54 selfloop transitions, 5 changer transitions 32/95 dead transitions. [2024-11-10 10:17:38,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 493 flow [2024-11-10 10:17:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:17:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:17:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-11-10 10:17:38,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2024-11-10 10:17:38,928 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 132 flow. Second operand 6 states and 125 transitions. [2024-11-10 10:17:38,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 493 flow [2024-11-10 10:17:38,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 479 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 10:17:38,940 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 158 flow [2024-11-10 10:17:38,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-11-10 10:17:38,941 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-11-10 10:17:38,941 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 158 flow [2024-11-10 10:17:38,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:38,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:38,942 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] [2024-11-10 10:17:38,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:17:38,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:38,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2097290168, now seen corresponding path program 3 times [2024-11-10 10:17:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:38,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263274408] [2024-11-10 10:17:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:39,388 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-10 10:17:39,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:39,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263274408] [2024-11-10 10:17:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263274408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:39,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:39,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:17:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244279234] [2024-11-10 10:17:39,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:39,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:17:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:17:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:17:39,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:39,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:39,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:39,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:39,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:40,183 INFO L124 PetriNetUnfolderBase]: 4981/7437 cut-off events. [2024-11-10 10:17:40,184 INFO L125 PetriNetUnfolderBase]: For 4761/4766 co-relation queries the response was YES. [2024-11-10 10:17:40,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18893 conditions, 7437 events. 4981/7437 cut-off events. For 4761/4766 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 39797 event pairs, 1631 based on Foata normal form. 82/7517 useless extension candidates. Maximal degree in co-relation 18875. Up to 3735 conditions per place. [2024-11-10 10:17:40,220 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 55 selfloop transitions, 7 changer transitions 30/96 dead transitions. [2024-11-10 10:17:40,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 529 flow [2024-11-10 10:17:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:17:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:17:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-11-10 10:17:40,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5427350427350427 [2024-11-10 10:17:40,222 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 158 flow. Second operand 6 states and 127 transitions. [2024-11-10 10:17:40,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 529 flow [2024-11-10 10:17:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 508 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-10 10:17:40,239 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 192 flow [2024-11-10 10:17:40,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-10 10:17:40,240 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-11-10 10:17:40,241 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 192 flow [2024-11-10 10:17:40,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:17:40,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:40,241 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] [2024-11-10 10:17:40,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:17:40,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 876862092, now seen corresponding path program 4 times [2024-11-10 10:17:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467668907] [2024-11-10 10:17:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:40,935 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-10 10:17:40,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:40,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467668907] [2024-11-10 10:17:40,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467668907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:40,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:40,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:17:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213876366] [2024-11-10 10:17:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:40,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:17:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:40,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:17:40,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:17:40,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:40,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 192 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10 10:17:40,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:40,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:40,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:41,759 INFO L124 PetriNetUnfolderBase]: 2795/4265 cut-off events. [2024-11-10 10:17:41,759 INFO L125 PetriNetUnfolderBase]: For 4030/4030 co-relation queries the response was YES. [2024-11-10 10:17:41,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11556 conditions, 4265 events. 2795/4265 cut-off events. For 4030/4030 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21276 event pairs, 338 based on Foata normal form. 80/4345 useless extension candidates. Maximal degree in co-relation 11536. Up to 2588 conditions per place. [2024-11-10 10:17:41,781 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 54 selfloop transitions, 10 changer transitions 50/118 dead transitions. [2024-11-10 10:17:41,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 118 transitions, 673 flow [2024-11-10 10:17:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:17:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:17:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-11-10 10:17:41,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49002849002849 [2024-11-10 10:17:41,784 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 192 flow. Second operand 9 states and 172 transitions. [2024-11-10 10:17:41,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 118 transitions, 673 flow [2024-11-10 10:17:41,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 640 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-10 10:17:41,798 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 230 flow [2024-11-10 10:17:41,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=230, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2024-11-10 10:17:41,799 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2024-11-10 10:17:41,799 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 230 flow [2024-11-10 10:17:41,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10 10:17:41,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:41,799 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] [2024-11-10 10:17:41,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:17:41,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1111463607, now seen corresponding path program 1 times [2024-11-10 10:17:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301340039] [2024-11-10 10:17:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:42,903 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-10 10:17:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301340039] [2024-11-10 10:17:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301340039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:17:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603507239] [2024-11-10 10:17:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:17:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:17:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:17:42,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:42,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 230 flow. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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-10 10:17:42,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:42,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:42,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:44,061 INFO L124 PetriNetUnfolderBase]: 3001/4512 cut-off events. [2024-11-10 10:17:44,061 INFO L125 PetriNetUnfolderBase]: For 7384/7384 co-relation queries the response was YES. [2024-11-10 10:17:44,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13334 conditions, 4512 events. 3001/4512 cut-off events. For 7384/7384 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22032 event pairs, 261 based on Foata normal form. 60/4572 useless extension candidates. Maximal degree in co-relation 13310. Up to 2208 conditions per place. [2024-11-10 10:17:44,087 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 73 selfloop transitions, 12 changer transitions 47/136 dead transitions. [2024-11-10 10:17:44,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 136 transitions, 851 flow [2024-11-10 10:17:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 10:17:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 10:17:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 222 transitions. [2024-11-10 10:17:44,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4378698224852071 [2024-11-10 10:17:44,090 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 230 flow. Second operand 13 states and 222 transitions. [2024-11-10 10:17:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 136 transitions, 851 flow [2024-11-10 10:17:44,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 771 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-11-10 10:17:44,106 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 290 flow [2024-11-10 10:17:44,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=290, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2024-11-10 10:17:44,108 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-11-10 10:17:44,109 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 290 flow [2024-11-10 10:17:44,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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-10 10:17:44,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:44,110 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] [2024-11-10 10:17:44,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:17:44,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:44,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1913022824, now seen corresponding path program 1 times [2024-11-10 10:17:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973756845] [2024-11-10 10:17:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:44,314 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-10 10:17:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973756845] [2024-11-10 10:17:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973756845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:17:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150100430] [2024-11-10 10:17:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:17:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:17:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:17:44,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:17:44,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 45 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-10 10:17:44,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:44,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:17:44,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:44,678 INFO L124 PetriNetUnfolderBase]: 2293/3561 cut-off events. [2024-11-10 10:17:44,678 INFO L125 PetriNetUnfolderBase]: For 5782/5784 co-relation queries the response was YES. [2024-11-10 10:17:44,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10630 conditions, 3561 events. 2293/3561 cut-off events. For 5782/5784 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18144 event pairs, 299 based on Foata normal form. 178/3738 useless extension candidates. Maximal degree in co-relation 10601. Up to 1918 conditions per place. [2024-11-10 10:17:44,691 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 62 selfloop transitions, 5 changer transitions 1/72 dead transitions. [2024-11-10 10:17:44,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 529 flow [2024-11-10 10:17:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:17:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:17:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-11-10 10:17:44,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-10 10:17:44,692 INFO L175 Difference]: Start difference. First operand has 74 places, 45 transitions, 290 flow. Second operand 4 states and 91 transitions. [2024-11-10 10:17:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 529 flow [2024-11-10 10:17:44,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 438 flow, removed 28 selfloop flow, removed 14 redundant places. [2024-11-10 10:17:44,707 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 186 flow [2024-11-10 10:17:44,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-11-10 10:17:44,707 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-11-10 10:17:44,708 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 186 flow [2024-11-10 10:17:44,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-10 10:17:44,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:44,708 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] [2024-11-10 10:17:44,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:17:44,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:44,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2119413029, now seen corresponding path program 1 times [2024-11-10 10:17:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909618106] [2024-11-10 10:17:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:45,995 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-10 10:17:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909618106] [2024-11-10 10:17:45,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909618106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:45,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:45,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:17:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015352079] [2024-11-10 10:17:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:45,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:17:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:17:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:17:46,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:46,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 186 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10 10:17:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:46,698 INFO L124 PetriNetUnfolderBase]: 2226/3418 cut-off events. [2024-11-10 10:17:46,698 INFO L125 PetriNetUnfolderBase]: For 4050/4050 co-relation queries the response was YES. [2024-11-10 10:17:46,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10548 conditions, 3418 events. 2226/3418 cut-off events. For 4050/4050 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16121 event pairs, 1135 based on Foata normal form. 32/3450 useless extension candidates. Maximal degree in co-relation 10527. Up to 2980 conditions per place. [2024-11-10 10:17:46,711 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 60 selfloop transitions, 16 changer transitions 24/104 dead transitions. [2024-11-10 10:17:46,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 654 flow [2024-11-10 10:17:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:17:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:17:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-11-10 10:17:46,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40093240093240096 [2024-11-10 10:17:46,712 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 186 flow. Second operand 11 states and 172 transitions. [2024-11-10 10:17:46,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 654 flow [2024-11-10 10:17:46,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 631 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-10 10:17:46,722 INFO L231 Difference]: Finished difference. Result has 74 places, 50 transitions, 310 flow [2024-11-10 10:17:46,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=74, PETRI_TRANSITIONS=50} [2024-11-10 10:17:46,724 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-11-10 10:17:46,724 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 50 transitions, 310 flow [2024-11-10 10:17:46,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10 10:17:46,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:46,725 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] [2024-11-10 10:17:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:17:46,725 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:46,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1499618063, now seen corresponding path program 2 times [2024-11-10 10:17:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385085050] [2024-11-10 10:17:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:47,630 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-10 10:17:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:47,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385085050] [2024-11-10 10:17:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385085050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:47,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:17:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580252154] [2024-11-10 10:17:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:47,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:17:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:17:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:17:47,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:47,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 50 transitions, 310 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-10 10:17:47,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:47,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:47,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:48,449 INFO L124 PetriNetUnfolderBase]: 2805/4303 cut-off events. [2024-11-10 10:17:48,449 INFO L125 PetriNetUnfolderBase]: For 11305/11305 co-relation queries the response was YES. [2024-11-10 10:17:48,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15027 conditions, 4303 events. 2805/4303 cut-off events. For 11305/11305 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21223 event pairs, 431 based on Foata normal form. 44/4347 useless extension candidates. Maximal degree in co-relation 14999. Up to 1964 conditions per place. [2024-11-10 10:17:48,468 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 79 selfloop transitions, 20 changer transitions 24/127 dead transitions. [2024-11-10 10:17:48,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 127 transitions, 940 flow [2024-11-10 10:17:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:17:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:17:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-11-10 10:17:48,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4672364672364672 [2024-11-10 10:17:48,469 INFO L175 Difference]: Start difference. First operand has 74 places, 50 transitions, 310 flow. Second operand 9 states and 164 transitions. [2024-11-10 10:17:48,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 127 transitions, 940 flow [2024-11-10 10:17:48,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 885 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-11-10 10:17:48,491 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 460 flow [2024-11-10 10:17:48,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2024-11-10 10:17:48,492 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-11-10 10:17:48,493 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 460 flow [2024-11-10 10:17:48,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-10 10:17:48,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:48,493 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] [2024-11-10 10:17:48,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:17:48,493 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:48,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1705897529, now seen corresponding path program 3 times [2024-11-10 10:17:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933425892] [2024-11-10 10:17:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:49,745 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-10 10:17:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933425892] [2024-11-10 10:17:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933425892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:17:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272859911] [2024-11-10 10:17:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:17:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:17:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:17:49,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:49,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 460 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10 10:17:49,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:49,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:49,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:50,860 INFO L124 PetriNetUnfolderBase]: 4424/6752 cut-off events. [2024-11-10 10:17:50,860 INFO L125 PetriNetUnfolderBase]: For 19158/19158 co-relation queries the response was YES. [2024-11-10 10:17:50,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24691 conditions, 6752 events. 4424/6752 cut-off events. For 19158/19158 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 36826 event pairs, 770 based on Foata normal form. 88/6840 useless extension candidates. Maximal degree in co-relation 24661. Up to 2557 conditions per place. [2024-11-10 10:17:50,895 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 98 selfloop transitions, 26 changer transitions 82/210 dead transitions. [2024-11-10 10:17:50,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 210 transitions, 1643 flow [2024-11-10 10:17:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 10:17:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-10 10:17:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 272 transitions. [2024-11-10 10:17:50,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46495726495726497 [2024-11-10 10:17:50,897 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 460 flow. Second operand 15 states and 272 transitions. [2024-11-10 10:17:50,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 210 transitions, 1643 flow [2024-11-10 10:17:50,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 210 transitions, 1609 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-10 10:17:50,929 INFO L231 Difference]: Finished difference. Result has 96 places, 69 transitions, 603 flow [2024-11-10 10:17:50,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=603, PETRI_PLACES=96, PETRI_TRANSITIONS=69} [2024-11-10 10:17:50,930 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-11-10 10:17:50,930 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 69 transitions, 603 flow [2024-11-10 10:17:50,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10 10:17:50,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:50,931 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] [2024-11-10 10:17:50,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 10:17:50,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:50,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 56532759, now seen corresponding path program 4 times [2024-11-10 10:17:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:50,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549635055] [2024-11-10 10:17:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:52,267 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-10 10:17:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:52,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549635055] [2024-11-10 10:17:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549635055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:17:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313602390] [2024-11-10 10:17:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:52,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:17:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:17:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:17:52,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:52,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 69 transitions, 603 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-10 10:17:52,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:52,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:52,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:53,012 INFO L124 PetriNetUnfolderBase]: 2433/3759 cut-off events. [2024-11-10 10:17:53,012 INFO L125 PetriNetUnfolderBase]: For 19843/19843 co-relation queries the response was YES. [2024-11-10 10:17:53,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16091 conditions, 3759 events. 2433/3759 cut-off events. For 19843/19843 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18350 event pairs, 873 based on Foata normal form. 56/3815 useless extension candidates. Maximal degree in co-relation 16053. Up to 2819 conditions per place. [2024-11-10 10:17:53,035 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 75 selfloop transitions, 31 changer transitions 36/146 dead transitions. [2024-11-10 10:17:53,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 146 transitions, 1382 flow [2024-11-10 10:17:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:17:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:17:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-11-10 10:17:53,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.441025641025641 [2024-11-10 10:17:53,036 INFO L175 Difference]: Start difference. First operand has 96 places, 69 transitions, 603 flow. Second operand 10 states and 172 transitions. [2024-11-10 10:17:53,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 146 transitions, 1382 flow [2024-11-10 10:17:53,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 1191 flow, removed 79 selfloop flow, removed 12 redundant places. [2024-11-10 10:17:53,083 INFO L231 Difference]: Finished difference. Result has 92 places, 79 transitions, 678 flow [2024-11-10 10:17:53,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=678, PETRI_PLACES=92, PETRI_TRANSITIONS=79} [2024-11-10 10:17:53,084 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-11-10 10:17:53,084 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 79 transitions, 678 flow [2024-11-10 10:17:53,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-10 10:17:53,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:53,084 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] [2024-11-10 10:17:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 10:17:53,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1464201199, now seen corresponding path program 5 times [2024-11-10 10:17:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371076638] [2024-11-10 10:17:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:53,324 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-10 10:17:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371076638] [2024-11-10 10:17:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371076638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:53,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:17:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191318162] [2024-11-10 10:17:53,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:53,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:17:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:53,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:17:53,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:17:53,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:17:53,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 79 transitions, 678 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-10 10:17:53,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:53,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:17:53,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:53,784 INFO L124 PetriNetUnfolderBase]: 1691/2693 cut-off events. [2024-11-10 10:17:53,784 INFO L125 PetriNetUnfolderBase]: For 12465/12467 co-relation queries the response was YES. [2024-11-10 10:17:53,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10460 conditions, 2693 events. 1691/2693 cut-off events. For 12465/12467 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13096 event pairs, 129 based on Foata normal form. 168/2861 useless extension candidates. Maximal degree in co-relation 10423. Up to 953 conditions per place. [2024-11-10 10:17:53,803 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 119 selfloop transitions, 8 changer transitions 1/132 dead transitions. [2024-11-10 10:17:53,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 132 transitions, 1384 flow [2024-11-10 10:17:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:17:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:17:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-10 10:17:53,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-11-10 10:17:53,805 INFO L175 Difference]: Start difference. First operand has 92 places, 79 transitions, 678 flow. Second operand 5 states and 111 transitions. [2024-11-10 10:17:53,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 132 transitions, 1384 flow [2024-11-10 10:17:53,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 132 transitions, 1153 flow, removed 95 selfloop flow, removed 13 redundant places. [2024-11-10 10:17:53,829 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 509 flow [2024-11-10 10:17:53,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=509, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-11-10 10:17:53,829 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2024-11-10 10:17:53,830 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 509 flow [2024-11-10 10:17:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-10 10:17:53,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:53,830 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] [2024-11-10 10:17:53,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 10:17:53,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:53,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1916704210, now seen corresponding path program 1 times [2024-11-10 10:17:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:53,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896434683] [2024-11-10 10:17:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:55,551 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-10 10:17:55,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:55,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896434683] [2024-11-10 10:17:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896434683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:17:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071904910] [2024-11-10 10:17:55,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:55,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:17:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:55,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:17:55,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:17:55,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-10 10:17:55,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 509 flow. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 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-10 10:17:55,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:55,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-10 10:17:55,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:56,341 INFO L124 PetriNetUnfolderBase]: 2244/3542 cut-off events. [2024-11-10 10:17:56,341 INFO L125 PetriNetUnfolderBase]: For 7926/7926 co-relation queries the response was YES. [2024-11-10 10:17:56,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13153 conditions, 3542 events. 2244/3542 cut-off events. For 7926/7926 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17526 event pairs, 636 based on Foata normal form. 44/3586 useless extension candidates. Maximal degree in co-relation 13123. Up to 1690 conditions per place. [2024-11-10 10:17:56,361 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 65 selfloop transitions, 9 changer transitions 83/161 dead transitions. [2024-11-10 10:17:56,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 161 transitions, 1370 flow [2024-11-10 10:17:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:17:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:17:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-11-10 10:17:56,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4219114219114219 [2024-11-10 10:17:56,364 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 509 flow. Second operand 11 states and 181 transitions. [2024-11-10 10:17:56,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 161 transitions, 1370 flow [2024-11-10 10:17:56,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 161 transitions, 1287 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-10 10:17:56,391 INFO L231 Difference]: Finished difference. Result has 93 places, 59 transitions, 435 flow [2024-11-10 10:17:56,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=435, PETRI_PLACES=93, PETRI_TRANSITIONS=59} [2024-11-10 10:17:56,392 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2024-11-10 10:17:56,392 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 59 transitions, 435 flow [2024-11-10 10:17:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 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-10 10:17:56,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:56,393 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] [2024-11-10 10:17:56,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 10:17:56,393 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 112966328, now seen corresponding path program 2 times [2024-11-10 10:17:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992795219] [2024-11-10 10:17:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:17:56,644 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-10 10:17:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:17:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992795219] [2024-11-10 10:17:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992795219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:17:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:17:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:17:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242245419] [2024-11-10 10:17:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:17:56,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:17:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:17:56,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:17:56,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:17:56,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-10 10:17:56,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 59 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10 10:17:56,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:17:56,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-10 10:17:56,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:17:56,938 INFO L124 PetriNetUnfolderBase]: 755/1254 cut-off events. [2024-11-10 10:17:56,938 INFO L125 PetriNetUnfolderBase]: For 3058/3060 co-relation queries the response was YES. [2024-11-10 10:17:56,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 1254 events. 755/1254 cut-off events. For 3058/3060 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5278 event pairs, 67 based on Foata normal form. 72/1326 useless extension candidates. Maximal degree in co-relation 4218. Up to 488 conditions per place. [2024-11-10 10:17:56,945 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 71 selfloop transitions, 11 changer transitions 4/90 dead transitions. [2024-11-10 10:17:56,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 771 flow [2024-11-10 10:17:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:17:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:17:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-11-10 10:17:56,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2024-11-10 10:17:56,946 INFO L175 Difference]: Start difference. First operand has 93 places, 59 transitions, 435 flow. Second operand 6 states and 110 transitions. [2024-11-10 10:17:56,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 771 flow [2024-11-10 10:17:56,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 606 flow, removed 42 selfloop flow, removed 24 redundant places. [2024-11-10 10:17:56,952 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 313 flow [2024-11-10 10:17:56,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-11-10 10:17:56,952 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-11-10 10:17:56,953 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 313 flow [2024-11-10 10:17:56,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10 10:17:56,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:17:56,953 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] [2024-11-10 10:17:56,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 10:17:56,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:17:56,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:17:56,954 INFO L85 PathProgramCache]: Analyzing trace with hash 285495899, now seen corresponding path program 1 times [2024-11-10 10:17:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:17:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531129915] [2024-11-10 10:17:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:17:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:17:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:17:57,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:17:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:17:57,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:17:57,184 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:17:57,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:17:57,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:17:57,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 10:17:57,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-10 10:17:57,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-10 10:17:57,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:17:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 10:17:57,190 INFO L407 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:17:57,277 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:17:57,278 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:17:57,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:17:57 BasicIcfg [2024-11-10 10:17:57,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:17:57,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:17:57,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:17:57,285 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:17:57,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:17:25" (3/4) ... [2024-11-10 10:17:57,286 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:17:57,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:17:57,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:17:57,376 INFO L158 Benchmark]: Toolchain (without parser) took 33514.97ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,376 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:17:57,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.61ms. Allocated memory is still 174.1MB. Free memory was 104.3MB in the beginning and 133.2MB in the end (delta: -28.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.12ms. Allocated memory is still 174.1MB. Free memory was 133.2MB in the beginning and 130.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,377 INFO L158 Benchmark]: Boogie Preprocessor took 76.59ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 126.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,377 INFO L158 Benchmark]: IcfgBuilder took 990.35ms. Allocated memory is still 174.1MB. Free memory was 126.2MB in the beginning and 52.8MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,377 INFO L158 Benchmark]: TraceAbstraction took 31501.49ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 52.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,378 INFO L158 Benchmark]: Witness Printer took 90.80ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 10:17:57,379 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.21ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.61ms. Allocated memory is still 174.1MB. Free memory was 104.3MB in the beginning and 133.2MB in the end (delta: -28.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.12ms. Allocated memory is still 174.1MB. Free memory was 133.2MB in the beginning and 130.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.59ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 126.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 990.35ms. Allocated memory is still 174.1MB. Free memory was 126.2MB in the beginning and 52.8MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31501.49ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 52.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. * Witness Printer took 90.80ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849=-3, t1850=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 847]: 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: 851]: 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: 849]: 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 7 procedures, 64 locations, 6 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: 31.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1530 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1527 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4326 IncrementalHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 3 mSDtfsCounter, 4326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=678occurred in iteration=15, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 3830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-10 10:17:57,412 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