./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:29:21,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:29:21,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:29:21,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:29:21,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:29:21,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:29:21,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:29:21,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:29:21,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:29:21,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:29:21,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:29:21,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:29:21,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:29:21,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:29:21,678 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:29:21,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:29:21,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:29:21,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:29:21,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:29:21,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:29:21,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:29:21,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:29:21,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:29:21,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:29:21,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:29:21,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:29:21,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:29:21,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:29:21,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:29:21,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:29:21,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:29:21,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:29:21,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:21,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:29:21,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:29:21,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:29:21,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:29:21,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:29:21,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:29:21,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:29:21,689 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:29:21,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:29:21,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:29:21,690 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2024-06-27 17:29:21,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:29:21,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:29:21,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:29:21,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:29:21,894 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:29:21,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2024-06-27 17:29:23,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:29:23,356 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:29:23,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2024-06-27 17:29:23,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07ec5a53/d95c4952c9c4453c8e272c569db97c14/FLAG92c1973ad [2024-06-27 17:29:23,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07ec5a53/d95c4952c9c4453c8e272c569db97c14 [2024-06-27 17:29:23,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:29:23,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:29:23,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:23,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:29:23,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:29:23,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e89ba47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23, skipping insertion in model container [2024-06-27 17:29:23,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:29:23,539 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i[994,1007] [2024-06-27 17:29:23,729 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:23,740 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:29:23,752 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i[994,1007] [2024-06-27 17:29:23,785 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:23,817 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:29:23,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23 WrapperNode [2024-06-27 17:29:23,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:23,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:23,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:29:23,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:29:23,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,885 INFO L138 Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-06-27 17:29:23,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:23,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:29:23,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:29:23,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:29:23,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,930 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 4 writes are split as follows [0, 4]. [2024-06-27 17:29:23,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:29:23,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:29:23,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:29:23,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:29:23,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (1/1) ... [2024-06-27 17:29:23,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:29:24,015 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-06-27 17:29:24,035 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-06-27 17:29:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:29:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:29:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:29:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:29:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:29:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:29:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:29:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:29:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:29:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:29:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:29:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:29:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:29:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:29:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:29:24,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:29:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:29:24,067 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:29:24,179 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:29:24,181 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:29:24,480 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:29:24,481 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:29:24,727 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:29:24,727 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:29:24,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:24 BoogieIcfgContainer [2024-06-27 17:29:24,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:29:24,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:29:24,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:29:24,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:29:24,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:29:23" (1/3) ... [2024-06-27 17:29:24,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b1cce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:24, skipping insertion in model container [2024-06-27 17:29:24,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:23" (2/3) ... [2024-06-27 17:29:24,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b1cce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:24, skipping insertion in model container [2024-06-27 17:29:24,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:24" (3/3) ... [2024-06-27 17:29:24,736 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2024-06-27 17:29:24,744 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:29:24,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:29:24,752 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:29:24,752 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:29:24,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:29:24,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-06-27 17:29:24,855 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-06-27 17:29:24,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:24,862 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 5. Compared 68 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-06-27 17:29:24,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-06-27 17:29:24,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-06-27 17:29:24,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:29:24,887 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ad88d32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:29:24,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 17:29:24,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:29:24,898 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-06-27 17:29:24,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:24,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:24,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:24,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:24,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash -816665357, now seen corresponding path program 1 times [2024-06-27 17:29:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092143608] [2024-06-27 17:29:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092143608] [2024-06-27 17:29:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092143608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:29:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412858987] [2024-06-27 17:29:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:25,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:29:25,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:29:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:29:25,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2024-06-27 17:29:25,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-06-27 17:29:25,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:25,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2024-06-27 17:29:25,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:25,565 INFO L124 PetriNetUnfolderBase]: 317/580 cut-off events. [2024-06-27 17:29:25,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:25,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 580 events. 317/580 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3073 event pairs, 104 based on Foata normal form. 24/576 useless extension candidates. Maximal degree in co-relation 1098. Up to 382 conditions per place. [2024-06-27 17:29:25,575 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 23 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-06-27 17:29:25,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 149 flow [2024-06-27 17:29:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:29:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:29:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-06-27 17:29:25,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-06-27 17:29:25,588 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 87 transitions. [2024-06-27 17:29:25,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 149 flow [2024-06-27 17:29:25,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:29:25,594 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-06-27 17:29:25,596 INFO L264 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-06-27 17:29:25,599 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-06-27 17:29:25,599 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-06-27 17:29:25,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-06-27 17:29:25,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:25,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:25,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:29:25,600 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:25,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -363060017, now seen corresponding path program 1 times [2024-06-27 17:29:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710835139] [2024-06-27 17:29:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710835139] [2024-06-27 17:29:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710835139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:25,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831677782] [2024-06-27 17:29:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:25,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:25,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:25,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-06-27 17:29:25,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-06-27 17:29:25,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:25,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-06-27 17:29:25,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:26,365 INFO L124 PetriNetUnfolderBase]: 983/1738 cut-off events. [2024-06-27 17:29:26,366 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-06-27 17:29:26,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 1738 events. 983/1738 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11277 event pairs, 137 based on Foata normal form. 0/1677 useless extension candidates. Maximal degree in co-relation 3378. Up to 838 conditions per place. [2024-06-27 17:29:26,371 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 28 selfloop transitions, 2 changer transitions 39/81 dead transitions. [2024-06-27 17:29:26,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 324 flow [2024-06-27 17:29:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:29:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:29:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 17:29:26,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2024-06-27 17:29:26,374 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 191 transitions. [2024-06-27 17:29:26,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 324 flow [2024-06-27 17:29:26,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:29:26,376 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 86 flow [2024-06-27 17:29:26,376 INFO L264 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-06-27 17:29:26,377 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-06-27 17:29:26,377 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 86 flow [2024-06-27 17:29:26,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-06-27 17:29:26,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:26,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:26,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:29:26,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:26,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash 61576400, now seen corresponding path program 1 times [2024-06-27 17:29:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:26,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180239887] [2024-06-27 17:29:26,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:26,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180239887] [2024-06-27 17:29:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180239887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013005097] [2024-06-27 17:29:26,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:26,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:26,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-06-27 17:29:26,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:26,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:26,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-06-27 17:29:26,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:26,723 INFO L124 PetriNetUnfolderBase]: 339/748 cut-off events. [2024-06-27 17:29:26,724 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-06-27 17:29:26,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 748 events. 339/748 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4856 event pairs, 59 based on Foata normal form. 24/747 useless extension candidates. Maximal degree in co-relation 1450. Up to 353 conditions per place. [2024-06-27 17:29:26,727 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 27 selfloop transitions, 2 changer transitions 23/66 dead transitions. [2024-06-27 17:29:26,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 272 flow [2024-06-27 17:29:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:29:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:29:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 17:29:26,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6336996336996337 [2024-06-27 17:29:26,729 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 86 flow. Second operand 7 states and 173 transitions. [2024-06-27 17:29:26,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 272 flow [2024-06-27 17:29:26,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 252 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:26,731 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 90 flow [2024-06-27 17:29:26,732 INFO L264 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-06-27 17:29:26,732 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-27 17:29:26,732 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 90 flow [2024-06-27 17:29:26,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:26,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:26,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:26,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:29:26,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:26,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1513265105, now seen corresponding path program 1 times [2024-06-27 17:29:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171189248] [2024-06-27 17:29:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171189248] [2024-06-27 17:29:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171189248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:26,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:29:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966124315] [2024-06-27 17:29:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:26,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-06-27 17:29:26,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-06-27 17:29:26,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:26,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-06-27 17:29:26,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:27,116 INFO L124 PetriNetUnfolderBase]: 567/1012 cut-off events. [2024-06-27 17:29:27,116 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-06-27 17:29:27,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 1012 events. 567/1012 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6015 event pairs, 317 based on Foata normal form. 24/996 useless extension candidates. Maximal degree in co-relation 2286. Up to 595 conditions per place. [2024-06-27 17:29:27,121 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 28 selfloop transitions, 2 changer transitions 23/65 dead transitions. [2024-06-27 17:29:27,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 279 flow [2024-06-27 17:29:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:29:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:29:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-06-27 17:29:27,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860805860805861 [2024-06-27 17:29:27,123 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 90 flow. Second operand 7 states and 160 transitions. [2024-06-27 17:29:27,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 279 flow [2024-06-27 17:29:27,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 257 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:27,126 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 94 flow [2024-06-27 17:29:27,126 INFO L264 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-06-27 17:29:27,126 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-06-27 17:29:27,127 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 94 flow [2024-06-27 17:29:27,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-06-27 17:29:27,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:27,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:29:27,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:27,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash 532337255, now seen corresponding path program 1 times [2024-06-27 17:29:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113704651] [2024-06-27 17:29:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:27,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113704651] [2024-06-27 17:29:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113704651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978831680] [2024-06-27 17:29:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:27,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-06-27 17:29:27,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:27,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:27,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-06-27 17:29:27,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:27,426 INFO L124 PetriNetUnfolderBase]: 365/667 cut-off events. [2024-06-27 17:29:27,426 INFO L125 PetriNetUnfolderBase]: For 223/233 co-relation queries the response was YES. [2024-06-27 17:29:27,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 667 events. 365/667 cut-off events. For 223/233 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3905 event pairs, 77 based on Foata normal form. 20/665 useless extension candidates. Maximal degree in co-relation 1495. Up to 413 conditions per place. [2024-06-27 17:29:27,429 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 23 selfloop transitions, 2 changer transitions 19/57 dead transitions. [2024-06-27 17:29:27,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 247 flow [2024-06-27 17:29:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:29:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:29:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-06-27 17:29:27,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5787545787545788 [2024-06-27 17:29:27,431 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 94 flow. Second operand 7 states and 158 transitions. [2024-06-27 17:29:27,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 247 flow [2024-06-27 17:29:27,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 227 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:27,433 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 98 flow [2024-06-27 17:29:27,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, 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=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2024-06-27 17:29:27,434 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-06-27 17:29:27,434 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 98 flow [2024-06-27 17:29:27,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:27,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:27,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:27,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:29:27,435 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:27,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 515465650, now seen corresponding path program 1 times [2024-06-27 17:29:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467302493] [2024-06-27 17:29:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:27,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:27,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467302493] [2024-06-27 17:29:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467302493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:27,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:29:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054756568] [2024-06-27 17:29:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:27,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:27,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-06-27 17:29:27,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 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-06-27 17:29:27,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:27,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-06-27 17:29:27,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:27,882 INFO L124 PetriNetUnfolderBase]: 915/1619 cut-off events. [2024-06-27 17:29:27,882 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2024-06-27 17:29:27,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3711 conditions, 1619 events. 915/1619 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10315 event pairs, 118 based on Foata normal form. 16/1625 useless extension candidates. Maximal degree in co-relation 3693. Up to 591 conditions per place. [2024-06-27 17:29:27,888 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 32 selfloop transitions, 3 changer transitions 19/65 dead transitions. [2024-06-27 17:29:27,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 292 flow [2024-06-27 17:29:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-27 17:29:27,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.594017094017094 [2024-06-27 17:29:27,890 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 98 flow. Second operand 6 states and 139 transitions. [2024-06-27 17:29:27,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 292 flow [2024-06-27 17:29:27,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 274 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:27,894 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 100 flow [2024-06-27 17:29:27,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=6, PETRI_FLOW=100, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2024-06-27 17:29:27,896 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-27 17:29:27,896 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 100 flow [2024-06-27 17:29:27,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 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-06-27 17:29:27,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:27,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:27,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:29:27,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:27,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1468866156, now seen corresponding path program 2 times [2024-06-27 17:29:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:27,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135587984] [2024-06-27 17:29:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135587984] [2024-06-27 17:29:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135587984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:28,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:28,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668247444] [2024-06-27 17:29:28,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:28,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:29:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:28,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:29:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:29:28,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-06-27 17:29:28,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-06-27 17:29:28,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:28,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-06-27 17:29:28,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:28,811 INFO L124 PetriNetUnfolderBase]: 315/608 cut-off events. [2024-06-27 17:29:28,811 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2024-06-27 17:29:28,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 608 events. 315/608 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3346 event pairs, 23 based on Foata normal form. 16/612 useless extension candidates. Maximal degree in co-relation 1323. Up to 311 conditions per place. [2024-06-27 17:29:28,815 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 33 selfloop transitions, 6 changer transitions 23/76 dead transitions. [2024-06-27 17:29:28,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 343 flow [2024-06-27 17:29:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 17:29:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 17:29:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 252 transitions. [2024-06-27 17:29:28,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5874125874125874 [2024-06-27 17:29:28,816 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 100 flow. Second operand 11 states and 252 transitions. [2024-06-27 17:29:28,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 343 flow [2024-06-27 17:29:28,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 313 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:28,818 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 139 flow [2024-06-27 17:29:28,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=139, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2024-06-27 17:29:28,819 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-06-27 17:29:28,819 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 139 flow [2024-06-27 17:29:28,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-06-27 17:29:28,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:28,820 INFO L208 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-06-27 17:29:28,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:29:28,820 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:28,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1750741777, now seen corresponding path program 1 times [2024-06-27 17:29:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000476412] [2024-06-27 17:29:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000476412] [2024-06-27 17:29:29,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000476412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:29,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:29,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 17:29:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471064508] [2024-06-27 17:29:29,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:29,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:29:29,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:29:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:29:29,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-06-27 17:29:29,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 139 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 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-06-27 17:29:29,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:29,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-06-27 17:29:29,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:29,777 INFO L124 PetriNetUnfolderBase]: 303/591 cut-off events. [2024-06-27 17:29:29,777 INFO L125 PetriNetUnfolderBase]: For 593/603 co-relation queries the response was YES. [2024-06-27 17:29:29,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 591 events. 303/591 cut-off events. For 593/603 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3308 event pairs, 31 based on Foata normal form. 14/590 useless extension candidates. Maximal degree in co-relation 1641. Up to 332 conditions per place. [2024-06-27 17:29:29,780 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 8 changer transitions 15/73 dead transitions. [2024-06-27 17:29:29,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 394 flow [2024-06-27 17:29:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:29:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:29:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-06-27 17:29:29,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2024-06-27 17:29:29,797 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 139 flow. Second operand 9 states and 210 transitions. [2024-06-27 17:29:29,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 394 flow [2024-06-27 17:29:29,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 372 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 17:29:29,800 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 216 flow [2024-06-27 17:29:29,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-06-27 17:29:29,801 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-06-27 17:29:29,801 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 216 flow [2024-06-27 17:29:29,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 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-06-27 17:29:29,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:29,801 INFO L208 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-06-27 17:29:29,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:29:29,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:29,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash 476420681, now seen corresponding path program 2 times [2024-06-27 17:29:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864095433] [2024-06-27 17:29:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:29,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864095433] [2024-06-27 17:29:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864095433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551220348] [2024-06-27 17:29:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:29,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:29,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-06-27 17:29:29,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-06-27 17:29:29,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:29,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-06-27 17:29:29,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:30,292 INFO L124 PetriNetUnfolderBase]: 740/1406 cut-off events. [2024-06-27 17:29:30,292 INFO L125 PetriNetUnfolderBase]: For 3065/3065 co-relation queries the response was YES. [2024-06-27 17:29:30,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4376 conditions, 1406 events. 740/1406 cut-off events. For 3065/3065 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9524 event pairs, 273 based on Foata normal form. 12/1401 useless extension candidates. Maximal degree in co-relation 4350. Up to 558 conditions per place. [2024-06-27 17:29:30,298 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 2 changer transitions 51/103 dead transitions. [2024-06-27 17:29:30,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 769 flow [2024-06-27 17:29:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:29:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:29:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 17:29:30,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-27 17:29:30,300 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 216 flow. Second operand 7 states and 156 transitions. [2024-06-27 17:29:30,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 769 flow [2024-06-27 17:29:30,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 709 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 17:29:30,306 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 210 flow [2024-06-27 17:29:30,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-06-27 17:29:30,306 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-06-27 17:29:30,307 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 210 flow [2024-06-27 17:29:30,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-06-27 17:29:30,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:30,307 INFO L208 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-06-27 17:29:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:29:30,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:30,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash 550191331, now seen corresponding path program 3 times [2024-06-27 17:29:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:30,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912830761] [2024-06-27 17:29:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:30,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912830761] [2024-06-27 17:29:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912830761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:30,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:29:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5146331] [2024-06-27 17:29:30,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:30,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:29:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:30,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:29:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:29:30,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-06-27 17:29:30,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-06-27 17:29:30,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:30,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-06-27 17:29:30,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:30,667 INFO L124 PetriNetUnfolderBase]: 927/1518 cut-off events. [2024-06-27 17:29:30,667 INFO L125 PetriNetUnfolderBase]: For 2308/2310 co-relation queries the response was YES. [2024-06-27 17:29:30,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 1518 events. 927/1518 cut-off events. For 2308/2310 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8134 event pairs, 98 based on Foata normal form. 71/1571 useless extension candidates. Maximal degree in co-relation 4492. Up to 818 conditions per place. [2024-06-27 17:29:30,677 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 53 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2024-06-27 17:29:30,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 462 flow [2024-06-27 17:29:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:29:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:29:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-27 17:29:30,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 17:29:30,679 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 210 flow. Second operand 4 states and 104 transitions. [2024-06-27 17:29:30,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 462 flow [2024-06-27 17:29:30,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 448 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:30,683 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 230 flow [2024-06-27 17:29:30,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-06-27 17:29:30,684 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-06-27 17:29:30,684 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 230 flow [2024-06-27 17:29:30,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-06-27 17:29:30,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:30,685 INFO L208 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] [2024-06-27 17:29:30,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:29:30,685 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:30,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1263327042, now seen corresponding path program 1 times [2024-06-27 17:29:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366274827] [2024-06-27 17:29:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366274827] [2024-06-27 17:29:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366274827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:30,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594716058] [2024-06-27 17:29:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:30,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:30,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:30,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:30,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-06-27 17:29:30,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-06-27 17:29:30,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:30,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-06-27 17:29:30,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:31,011 INFO L124 PetriNetUnfolderBase]: 677/1137 cut-off events. [2024-06-27 17:29:31,011 INFO L125 PetriNetUnfolderBase]: For 1723/1737 co-relation queries the response was YES. [2024-06-27 17:29:31,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 1137 events. 677/1137 cut-off events. For 1723/1737 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5462 event pairs, 35 based on Foata normal form. 66/1189 useless extension candidates. Maximal degree in co-relation 3629. Up to 461 conditions per place. [2024-06-27 17:29:31,017 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2024-06-27 17:29:31,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 521 flow [2024-06-27 17:29:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:29:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:29:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-06-27 17:29:31,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-06-27 17:29:31,020 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 230 flow. Second operand 5 states and 131 transitions. [2024-06-27 17:29:31,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 521 flow [2024-06-27 17:29:31,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 501 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 17:29:31,029 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 244 flow [2024-06-27 17:29:31,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2024-06-27 17:29:31,029 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2024-06-27 17:29:31,030 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 244 flow [2024-06-27 17:29:31,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-06-27 17:29:31,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:31,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:31,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:29:31,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:31,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2026493999, now seen corresponding path program 1 times [2024-06-27 17:29:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:31,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019693455] [2024-06-27 17:29:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:31,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:31,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019693455] [2024-06-27 17:29:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019693455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:31,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:31,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:29:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354273201] [2024-06-27 17:29:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:31,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:31,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:31,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-06-27 17:29:31,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:31,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:31,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-06-27 17:29:31,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:31,387 INFO L124 PetriNetUnfolderBase]: 400/682 cut-off events. [2024-06-27 17:29:31,387 INFO L125 PetriNetUnfolderBase]: For 1378/1406 co-relation queries the response was YES. [2024-06-27 17:29:31,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 682 events. 400/682 cut-off events. For 1378/1406 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2804 event pairs, 24 based on Foata normal form. 42/710 useless extension candidates. Maximal degree in co-relation 2289. Up to 268 conditions per place. [2024-06-27 17:29:31,391 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 47 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-06-27 17:29:31,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 458 flow [2024-06-27 17:29:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-06-27 17:29:31,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-06-27 17:29:31,392 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 244 flow. Second operand 6 states and 144 transitions. [2024-06-27 17:29:31,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 458 flow [2024-06-27 17:29:31,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 356 flow, removed 22 selfloop flow, removed 14 redundant places. [2024-06-27 17:29:31,396 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 186 flow [2024-06-27 17:29:31,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-06-27 17:29:31,397 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-06-27 17:29:31,398 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 186 flow [2024-06-27 17:29:31,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:31,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:31,398 INFO L208 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-06-27 17:29:31,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:29:31,399 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:31,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -354085448, now seen corresponding path program 1 times [2024-06-27 17:29:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444679497] [2024-06-27 17:29:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444679497] [2024-06-27 17:29:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444679497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313992810] [2024-06-27 17:29:31,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:31,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:31,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-06-27 17:29:31,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-06-27 17:29:31,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:31,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-06-27 17:29:31,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:31,718 INFO L124 PetriNetUnfolderBase]: 449/901 cut-off events. [2024-06-27 17:29:31,718 INFO L125 PetriNetUnfolderBase]: For 666/680 co-relation queries the response was YES. [2024-06-27 17:29:31,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 901 events. 449/901 cut-off events. For 666/680 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4718 event pairs, 155 based on Foata normal form. 8/868 useless extension candidates. Maximal degree in co-relation 2309. Up to 344 conditions per place. [2024-06-27 17:29:31,722 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 24 selfloop transitions, 1 changer transitions 24/66 dead transitions. [2024-06-27 17:29:31,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 356 flow [2024-06-27 17:29:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-27 17:29:31,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 17:29:31,724 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 186 flow. Second operand 6 states and 130 transitions. [2024-06-27 17:29:31,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 356 flow [2024-06-27 17:29:31,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 292 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 17:29:31,727 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 129 flow [2024-06-27 17:29:31,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2024-06-27 17:29:31,728 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-06-27 17:29:31,728 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 129 flow [2024-06-27 17:29:31,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-06-27 17:29:31,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:31,728 INFO L208 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-06-27 17:29:31,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 17:29:31,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:31,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1081313670, now seen corresponding path program 2 times [2024-06-27 17:29:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:31,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031439505] [2024-06-27 17:29:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:31,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031439505] [2024-06-27 17:29:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031439505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:31,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:31,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506899023] [2024-06-27 17:29:31,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:31,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:31,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:31,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:31,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-06-27 17:29:31,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-06-27 17:29:31,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:31,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-06-27 17:29:31,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:32,047 INFO L124 PetriNetUnfolderBase]: 363/754 cut-off events. [2024-06-27 17:29:32,047 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-06-27 17:29:32,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 754 events. 363/754 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3756 event pairs, 242 based on Foata normal form. 8/722 useless extension candidates. Maximal degree in co-relation 1711. Up to 336 conditions per place. [2024-06-27 17:29:32,051 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 23 selfloop transitions, 2 changer transitions 25/67 dead transitions. [2024-06-27 17:29:32,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 311 flow [2024-06-27 17:29:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:29:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:29:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-27 17:29:32,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457875457875457 [2024-06-27 17:29:32,052 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 129 flow. Second operand 7 states and 149 transitions. [2024-06-27 17:29:32,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 311 flow [2024-06-27 17:29:32,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 285 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 17:29:32,055 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 128 flow [2024-06-27 17:29:32,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2024-06-27 17:29:32,055 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-06-27 17:29:32,056 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 128 flow [2024-06-27 17:29:32,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-06-27 17:29:32,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:32,056 INFO L208 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-06-27 17:29:32,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 17:29:32,056 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:29:32,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash -64211468, now seen corresponding path program 3 times [2024-06-27 17:29:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902647003] [2024-06-27 17:29:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:29:32,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:29:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:29:32,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:29:32,130 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:29:32,130 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-06-27 17:29:32,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 17:29:32,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-06-27 17:29:32,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-27 17:29:32,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-27 17:29:32,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 17:29:32,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 17:29:32,133 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:32,137 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:29:32,137 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:29:32,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:29:32 BasicIcfg [2024-06-27 17:29:32,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:29:32,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:29:32,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:29:32,196 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:29:32,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:24" (3/4) ... [2024-06-27 17:29:32,196 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:29:32,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:29:32,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:29:32,277 INFO L158 Benchmark]: Toolchain (without parser) took 8892.18ms. Allocated memory was 172.0MB in the beginning and 534.8MB in the end (delta: 362.8MB). Free memory was 134.0MB in the beginning and 312.1MB in the end (delta: -178.1MB). Peak memory consumption was 187.5MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,277 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:29:32,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.84ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 108.7MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.37ms. Allocated memory is still 172.0MB. Free memory was 108.7MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,278 INFO L158 Benchmark]: Boogie Preprocessor took 78.64ms. Allocated memory is still 172.0MB. Free memory was 105.8MB in the beginning and 102.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,278 INFO L158 Benchmark]: RCFGBuilder took 762.79ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 105.4MB in the end (delta: -3.2MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,278 INFO L158 Benchmark]: TraceAbstraction took 7464.83ms. Allocated memory was 172.0MB in the beginning and 534.8MB in the end (delta: 362.8MB). Free memory was 105.4MB in the beginning and 331.0MB in the end (delta: -225.6MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,279 INFO L158 Benchmark]: Witness Printer took 81.36ms. Allocated memory is still 534.8MB. Free memory was 331.0MB in the beginning and 312.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 17:29:32,280 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.17ms. Allocated memory is still 172.0MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.84ms. Allocated memory is still 172.0MB. Free memory was 134.0MB in the beginning and 108.7MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.37ms. Allocated memory is still 172.0MB. Free memory was 108.7MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.64ms. Allocated memory is still 172.0MB. Free memory was 105.8MB in the beginning and 102.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 762.79ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 105.4MB in the end (delta: -3.2MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7464.83ms. Allocated memory was 172.0MB in the beginning and 534.8MB in the end (delta: 362.8MB). Free memory was 105.4MB in the beginning and 331.0MB in the end (delta: -225.6MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. * Witness Printer took 81.36ms. Allocated memory is still 534.8MB. Free memory was 331.0MB in the beginning and 312.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, weak$$choice0=0, weak$$choice1=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={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, t2101=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L848] 0 pthread_t t2102; [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, 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={3:0}] [L795] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100=-1, t2101=0, t2102=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 19]: 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: 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. - UnprovableResult [Line: 845]: 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: 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. - 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: 7.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1736 IncrementalHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 36 mSDtfsCounter, 1736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=11, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-06-27 17:29:32,302 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