./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.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/mix019_power.oepc_pso.oepc_rmo.oepc.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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:25:49,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:25:49,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:25:49,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:25:49,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:25:49,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:25:49,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:25:49,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:25:49,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:25:49,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:25:49,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:25:49,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:25:49,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:25:49,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:25:49,155 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:25:49,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:25:49,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:25:49,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:25:49,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:25:49,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:25:49,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:25:49,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:25:49,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:25:49,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:25:49,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:25:49,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:25:49,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:25:49,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:25:49,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:25:49,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:25:49,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:25:49,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:25:49,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:25:49,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:25:49,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:25:49,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:25:49,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:25:49,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:25:49,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:25:49,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:25:49,161 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:25:49,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:25:49,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:25:49,162 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2024-06-27 17:25:49,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:25:49,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:25:49,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:25:49,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:25:49,415 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:25:49,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 17:25:50,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:25:50,691 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:25:50,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 17:25:50,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791cfea20/8ef50190c75e442d926b989943291141/FLAGae29db350 [2024-06-27 17:25:50,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791cfea20/8ef50190c75e442d926b989943291141 [2024-06-27 17:25:50,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:25:50,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:25:50,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:25:50,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:25:50,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:25:50,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:25:50" (1/1) ... [2024-06-27 17:25:50,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d903afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:50, skipping insertion in model container [2024-06-27 17:25:50,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:25:50" (1/1) ... [2024-06-27 17:25:50,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:25:50,894 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 17:25:51,086 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:25:51,097 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:25:51,106 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 17:25:51,147 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:25:51,186 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:25:51,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51 WrapperNode [2024-06-27 17:25:51,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:25:51,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:25:51,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:25:51,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:25:51,194 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:25:51" (1/1) ... [2024-06-27 17:25:51,221 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:25:51" (1/1) ... [2024-06-27 17:25:51,238 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-06-27 17:25:51,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:25:51,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:25:51,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:25:51,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:25:51,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:25:51,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:25:51,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:25:51,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:25:51,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:25:51,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (1/1) ... [2024-06-27 17:25:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:25:51,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:25:51,334 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:25:51,336 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:25:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:25:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:25:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:25:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:25:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:25:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:25:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:25:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:25:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:25:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:25:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:25:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:25:51,371 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:25:51,469 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:25:51,471 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:25:51,727 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:25:51,729 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:25:51,924 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:25:51,924 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:25:51,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:25:51 BoogieIcfgContainer [2024-06-27 17:25:51,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:25:51,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:25:51,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:25:51,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:25:51,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:25:50" (1/3) ... [2024-06-27 17:25:51,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc8eb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:25:51, skipping insertion in model container [2024-06-27 17:25:51,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:51" (2/3) ... [2024-06-27 17:25:51,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc8eb3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:25:51, skipping insertion in model container [2024-06-27 17:25:51,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:25:51" (3/3) ... [2024-06-27 17:25:51,936 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 17:25:51,943 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:25:51,950 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:25:51,951 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:25:51,951 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:25:51,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:25:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-06-27 17:25:52,058 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-06-27 17:25:52,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:25:52,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-06-27 17:25:52,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-06-27 17:25:52,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-06-27 17:25:52,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:25:52,086 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;@3d30bc17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:25:52,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 17:25:52,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:25:52,093 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 17:25:52,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:25:52,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:52,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-06-27 17:25:52,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:52,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash 11076540, now seen corresponding path program 1 times [2024-06-27 17:25:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915761405] [2024-06-27 17:25:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:52,403 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:25:52,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:52,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915761405] [2024-06-27 17:25:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915761405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:52,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:25:52,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937006313] [2024-06-27 17:25:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:52,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:25:52,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:52,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:25:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:25:52,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-06-27 17:25:52,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:25:52,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:52,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-06-27 17:25:52,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:52,717 INFO L124 PetriNetUnfolderBase]: 617/1160 cut-off events. [2024-06-27 17:25:52,718 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-06-27 17:25:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 1160 events. 617/1160 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7202 event pairs, 95 based on Foata normal form. 45/1183 useless extension candidates. Maximal degree in co-relation 2126. Up to 763 conditions per place. [2024-06-27 17:25:52,730 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 29 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-06-27 17:25:52,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 179 flow [2024-06-27 17:25:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:25:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:25:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 17:25:52,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-06-27 17:25:52,744 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 93 transitions. [2024-06-27 17:25:52,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 179 flow [2024-06-27 17:25:52,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:25:52,751 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-06-27 17:25:52,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-06-27 17:25:52,755 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-06-27 17:25:52,755 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-06-27 17:25:52,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:25:52,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:52,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:52,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:25:52,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:52,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash -174449605, now seen corresponding path program 1 times [2024-06-27 17:25:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570719180] [2024-06-27 17:25:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:52,956 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:25:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570719180] [2024-06-27 17:25:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570719180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:25:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585607564] [2024-06-27 17:25:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:52,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:25:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:25:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:25:52,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:25:52,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 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:25:52,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:52,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:25:52,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:53,335 INFO L124 PetriNetUnfolderBase]: 1280/2088 cut-off events. [2024-06-27 17:25:53,335 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-06-27 17:25:53,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4212 conditions, 2088 events. 1280/2088 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12752 event pairs, 205 based on Foata normal form. 0/2014 useless extension candidates. Maximal degree in co-relation 4202. Up to 1065 conditions per place. [2024-06-27 17:25:53,344 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 27 selfloop transitions, 2 changer transitions 42/83 dead transitions. [2024-06-27 17:25:53,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 330 flow [2024-06-27 17:25:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:25:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:25:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 17:25:53,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.603125 [2024-06-27 17:25:53,350 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 193 transitions. [2024-06-27 17:25:53,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 330 flow [2024-06-27 17:25:53,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:25:53,353 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2024-06-27 17:25:53,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, 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=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2024-06-27 17:25:53,354 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-06-27 17:25:53,354 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2024-06-27 17:25:53,354 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:25:53,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:53,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:53,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:25:53,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:53,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 28401655, now seen corresponding path program 1 times [2024-06-27 17:25:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:53,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144237046] [2024-06-27 17:25:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:53,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:25:53,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144237046] [2024-06-27 17:25:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144237046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:53,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:53,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:25:53,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459873109] [2024-06-27 17:25:53,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:53,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:25:53,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:53,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:25:53,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:25:53,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-06-27 17:25:53,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:25:53,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:53,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-06-27 17:25:53,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:54,293 INFO L124 PetriNetUnfolderBase]: 3308/5331 cut-off events. [2024-06-27 17:25:54,294 INFO L125 PetriNetUnfolderBase]: For 1267/1267 co-relation queries the response was YES. [2024-06-27 17:25:54,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11671 conditions, 5331 events. 3308/5331 cut-off events. For 1267/1267 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 34711 event pairs, 245 based on Foata normal form. 157/5484 useless extension candidates. Maximal degree in co-relation 11656. Up to 2642 conditions per place. [2024-06-27 17:25:54,318 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 47 selfloop transitions, 8 changer transitions 57/121 dead transitions. [2024-06-27 17:25:54,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 121 transitions, 524 flow [2024-06-27 17:25:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:25:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:25:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-06-27 17:25:54,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-06-27 17:25:54,320 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 10 states and 235 transitions. [2024-06-27 17:25:54,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 121 transitions, 524 flow [2024-06-27 17:25:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 121 transitions, 488 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 17:25:54,356 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 146 flow [2024-06-27 17:25:54,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2024-06-27 17:25:54,356 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2024-06-27 17:25:54,357 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 146 flow [2024-06-27 17:25:54,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:25:54,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:54,357 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:25:54,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:25:54,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:54,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash 170605068, now seen corresponding path program 1 times [2024-06-27 17:25:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048655118] [2024-06-27 17:25:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:54,461 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:25:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048655118] [2024-06-27 17:25:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048655118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:54,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:25:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960518872] [2024-06-27 17:25:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:54,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:25:54,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:25:54,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:25:54,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:25:54,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:54,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:54,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:25:54,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:54,957 INFO L124 PetriNetUnfolderBase]: 3375/5759 cut-off events. [2024-06-27 17:25:54,957 INFO L125 PetriNetUnfolderBase]: For 3789/3951 co-relation queries the response was YES. [2024-06-27 17:25:54,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13867 conditions, 5759 events. 3375/5759 cut-off events. For 3789/3951 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 38074 event pairs, 643 based on Foata normal form. 291/5874 useless extension candidates. Maximal degree in co-relation 13848. Up to 2733 conditions per place. [2024-06-27 17:25:54,984 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 45 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2024-06-27 17:25:54,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 322 flow [2024-06-27 17:25:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:25:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:25:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-06-27 17:25:54,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68125 [2024-06-27 17:25:54,985 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 146 flow. Second operand 4 states and 109 transitions. [2024-06-27 17:25:54,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 322 flow [2024-06-27 17:25:55,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 314 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 17:25:55,004 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 176 flow [2024-06-27 17:25:55,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-06-27 17:25:55,006 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-06-27 17:25:55,006 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 176 flow [2024-06-27 17:25:55,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:55,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:55,006 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:25:55,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:25:55,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:55,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 608733373, now seen corresponding path program 1 times [2024-06-27 17:25:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:55,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336306730] [2024-06-27 17:25:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:55,133 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:25:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336306730] [2024-06-27 17:25:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336306730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:25:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387114418] [2024-06-27 17:25:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:55,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:25:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:25:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:25:55,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-06-27 17:25:55,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:25:55,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:55,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-06-27 17:25:55,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:55,792 INFO L124 PetriNetUnfolderBase]: 3823/6705 cut-off events. [2024-06-27 17:25:55,793 INFO L125 PetriNetUnfolderBase]: For 4113/4356 co-relation queries the response was YES. [2024-06-27 17:25:55,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17180 conditions, 6705 events. 3823/6705 cut-off events. For 4113/4356 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 49886 event pairs, 1726 based on Foata normal form. 183/6437 useless extension candidates. Maximal degree in co-relation 17161. Up to 2662 conditions per place. [2024-06-27 17:25:55,824 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 48 selfloop transitions, 9 changer transitions 18/92 dead transitions. [2024-06-27 17:25:55,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 480 flow [2024-06-27 17:25:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:25:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:25:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-27 17:25:55,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-27 17:25:55,825 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 176 flow. Second operand 7 states and 172 transitions. [2024-06-27 17:25:55,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 480 flow [2024-06-27 17:25:55,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:25:55,829 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 240 flow [2024-06-27 17:25:55,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2024-06-27 17:25:55,829 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2024-06-27 17:25:55,829 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 240 flow [2024-06-27 17:25:55,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:25:55,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:55,830 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:25:55,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:25:55,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:55,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash -198199390, now seen corresponding path program 1 times [2024-06-27 17:25:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680076169] [2024-06-27 17:25:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:55,945 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:25:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680076169] [2024-06-27 17:25:55,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680076169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:25:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747361225] [2024-06-27 17:25:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:25:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:25:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:25:55,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-27 17:25:55,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:55,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:55,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-27 17:25:55,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:57,093 INFO L124 PetriNetUnfolderBase]: 7458/12549 cut-off events. [2024-06-27 17:25:57,094 INFO L125 PetriNetUnfolderBase]: For 14564/15253 co-relation queries the response was YES. [2024-06-27 17:25:57,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35231 conditions, 12549 events. 7458/12549 cut-off events. For 14564/15253 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 97009 event pairs, 1003 based on Foata normal form. 197/12220 useless extension candidates. Maximal degree in co-relation 35207. Up to 4605 conditions per place. [2024-06-27 17:25:57,141 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 71 selfloop transitions, 19 changer transitions 32/134 dead transitions. [2024-06-27 17:25:57,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 134 transitions, 834 flow [2024-06-27 17:25:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:25:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:25:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-06-27 17:25:57,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-27 17:25:57,143 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 240 flow. Second operand 9 states and 204 transitions. [2024-06-27 17:25:57,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 134 transitions, 834 flow [2024-06-27 17:25:57,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 134 transitions, 813 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 17:25:57,203 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 439 flow [2024-06-27 17:25:57,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=439, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2024-06-27 17:25:57,203 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2024-06-27 17:25:57,204 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 439 flow [2024-06-27 17:25:57,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:57,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:57,204 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:25:57,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:25:57,204 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:57,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1994837238, now seen corresponding path program 2 times [2024-06-27 17:25:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353330237] [2024-06-27 17:25:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:57,288 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:25:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353330237] [2024-06-27 17:25:57,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353330237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:57,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:57,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:25:57,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922004263] [2024-06-27 17:25:57,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:57,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:25:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:57,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:25:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:25:57,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:25:57,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 439 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:25:57,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:57,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:25:57,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:58,135 INFO L124 PetriNetUnfolderBase]: 5107/8502 cut-off events. [2024-06-27 17:25:58,135 INFO L125 PetriNetUnfolderBase]: For 13393/13792 co-relation queries the response was YES. [2024-06-27 17:25:58,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24509 conditions, 8502 events. 5107/8502 cut-off events. For 13393/13792 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 58748 event pairs, 655 based on Foata normal form. 590/8860 useless extension candidates. Maximal degree in co-relation 24476. Up to 2573 conditions per place. [2024-06-27 17:25:58,176 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 60 selfloop transitions, 8 changer transitions 9/104 dead transitions. [2024-06-27 17:25:58,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 770 flow [2024-06-27 17:25:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:25:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:25:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-06-27 17:25:58,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.695 [2024-06-27 17:25:58,178 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 439 flow. Second operand 5 states and 139 transitions. [2024-06-27 17:25:58,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 770 flow [2024-06-27 17:25:58,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 730 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 17:25:58,217 INFO L231 Difference]: Finished difference. Result has 82 places, 59 transitions, 403 flow [2024-06-27 17:25:58,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=82, PETRI_TRANSITIONS=59} [2024-06-27 17:25:58,218 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places. [2024-06-27 17:25:58,218 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 59 transitions, 403 flow [2024-06-27 17:25:58,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:25:58,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:58,218 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] [2024-06-27 17:25:58,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:25:58,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:58,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1640250143, now seen corresponding path program 1 times [2024-06-27 17:25:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440350646] [2024-06-27 17:25:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:58,361 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:25:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440350646] [2024-06-27 17:25:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440350646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:25:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668683584] [2024-06-27 17:25:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:58,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:25:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:25:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:25:58,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:25:58,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 59 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:58,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:58,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:25:58,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:58,931 INFO L124 PetriNetUnfolderBase]: 3987/6542 cut-off events. [2024-06-27 17:25:58,931 INFO L125 PetriNetUnfolderBase]: For 13062/13397 co-relation queries the response was YES. [2024-06-27 17:25:58,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20643 conditions, 6542 events. 3987/6542 cut-off events. For 13062/13397 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 43662 event pairs, 585 based on Foata normal form. 328/6638 useless extension candidates. Maximal degree in co-relation 20608. Up to 2356 conditions per place. [2024-06-27 17:25:58,962 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 52 selfloop transitions, 11 changer transitions 7/91 dead transitions. [2024-06-27 17:25:58,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 654 flow [2024-06-27 17:25:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:25:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:25:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 17:25:58,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-06-27 17:25:58,964 INFO L175 Difference]: Start difference. First operand has 82 places, 59 transitions, 403 flow. Second operand 6 states and 151 transitions. [2024-06-27 17:25:58,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 654 flow [2024-06-27 17:25:58,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 595 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-27 17:25:58,975 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 344 flow [2024-06-27 17:25:58,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2024-06-27 17:25:58,976 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2024-06-27 17:25:58,976 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 344 flow [2024-06-27 17:25:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:58,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:58,977 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, 1] [2024-06-27 17:25:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:25:58,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:58,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1406651335, now seen corresponding path program 1 times [2024-06-27 17:25:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:58,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736774773] [2024-06-27 17:25:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:59,617 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:25:59,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:59,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736774773] [2024-06-27 17:25:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736774773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:59,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:25:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263360872] [2024-06-27 17:25:59,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:59,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:25:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:25:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:25:59,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:25:59,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 344 flow. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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:25:59,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:59,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:25:59,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:00,117 INFO L124 PetriNetUnfolderBase]: 1664/3424 cut-off events. [2024-06-27 17:26:00,117 INFO L125 PetriNetUnfolderBase]: For 6232/6671 co-relation queries the response was YES. [2024-06-27 17:26:00,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10015 conditions, 3424 events. 1664/3424 cut-off events. For 6232/6671 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 27163 event pairs, 506 based on Foata normal form. 58/3115 useless extension candidates. Maximal degree in co-relation 9985. Up to 954 conditions per place. [2024-06-27 17:26:00,137 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 8 changer transitions 23/102 dead transitions. [2024-06-27 17:26:00,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 657 flow [2024-06-27 17:26:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 17:26:00,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.60625 [2024-06-27 17:26:00,139 INFO L175 Difference]: Start difference. First operand has 74 places, 54 transitions, 344 flow. Second operand 8 states and 194 transitions. [2024-06-27 17:26:00,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 657 flow [2024-06-27 17:26:00,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 592 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-27 17:26:00,173 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 345 flow [2024-06-27 17:26:00,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2024-06-27 17:26:00,174 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2024-06-27 17:26:00,174 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 345 flow [2024-06-27 17:26:00,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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:26:00,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:00,175 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, 1] [2024-06-27 17:26:00,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:26:00,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:00,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1118995631, now seen corresponding path program 2 times [2024-06-27 17:26:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383683004] [2024-06-27 17:26:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:00,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:26:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:00,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:26:00,275 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:26:00,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-06-27 17:26:00,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 17:26:00,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-06-27 17:26:00,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-27 17:26:00,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-27 17:26:00,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 17:26:00,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:26:00,280 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:00,286 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:26:00,286 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:26:00,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:26:00 BasicIcfg [2024-06-27 17:26:00,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:26:00,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:26:00,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:26:00,370 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:26:00,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:25:51" (3/4) ... [2024-06-27 17:26:00,371 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:26:00,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:26:00,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:26:00,452 INFO L158 Benchmark]: Toolchain (without parser) took 9735.42ms. Allocated memory was 176.2MB in the beginning and 878.7MB in the end (delta: 702.5MB). Free memory was 118.5MB in the beginning and 287.3MB in the end (delta: -168.8MB). Peak memory consumption was 534.4MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,452 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:26:00,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.39ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 94.0MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.69ms. Allocated memory is still 176.2MB. Free memory was 94.0MB in the beginning and 91.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,453 INFO L158 Benchmark]: Boogie Preprocessor took 58.99ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 88.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,453 INFO L158 Benchmark]: RCFGBuilder took 627.22ms. Allocated memory was 176.2MB in the beginning and 266.3MB in the end (delta: 90.2MB). Free memory was 88.4MB in the beginning and 230.4MB in the end (delta: -142.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,453 INFO L158 Benchmark]: TraceAbstraction took 8442.34ms. Allocated memory was 266.3MB in the beginning and 878.7MB in the end (delta: 612.4MB). Free memory was 229.3MB in the beginning and 299.9MB in the end (delta: -70.5MB). Peak memory consumption was 543.9MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,454 INFO L158 Benchmark]: Witness Printer took 81.69ms. Allocated memory is still 878.7MB. Free memory was 299.9MB in the beginning and 287.3MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-06-27 17:26:00,455 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.14ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.39ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 94.0MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.69ms. Allocated memory is still 176.2MB. Free memory was 94.0MB in the beginning and 91.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.99ms. Allocated memory is still 176.2MB. Free memory was 91.2MB in the beginning and 88.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 627.22ms. Allocated memory was 176.2MB in the beginning and 266.3MB in the end (delta: 90.2MB). Free memory was 88.4MB in the beginning and 230.4MB in the end (delta: -142.0MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8442.34ms. Allocated memory was 266.3MB in the beginning and 878.7MB in the end (delta: 612.4MB). Free memory was 229.3MB in the beginning and 299.9MB in the end (delta: -70.5MB). Peak memory consumption was 543.9MB. Max. memory is 16.1GB. * Witness Printer took 81.69ms. Allocated memory is still 878.7MB. Free memory was 299.9MB in the beginning and 287.3MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497=-1, t498=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497=-1, t498=0, t499=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497=-1, t498=0, t499=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497=-1, t498=0, t499=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497=-1, t498=0, t499=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: 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, 66 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: 8.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1260 IncrementalHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 44 mSDtfsCounter, 1260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=6, InterpolantAutomatonStates: 60, 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, 1.6s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:26:00,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE