./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix037_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 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:14:45,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:14:45,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:14:45,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:14:45,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:14:45,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:14:45,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:14:45,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:14:45,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:14:45,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:14:45,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:14:45,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:14:45,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:14:45,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:14:45,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:14:45,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:14:45,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:14:45,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:14:45,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:14:45,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:14:45,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:14:45,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:14:45,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:14:45,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:14:45,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:14:45,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:14:45,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:14:45,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:14:45,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:14:45,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:14:45,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:14:45,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:14:45,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:14:45,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:14:45,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:14:45,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:14:45,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:14:45,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:14:45,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:14:45,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:14:45,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:14:45,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:14:45,188 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 -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f [2024-11-10 10:14:45,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:14:45,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:14:45,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:14:45,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:14:45,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:14:45,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 10:14:46,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:14:47,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:14:47,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 10:14:47,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe1ebaa3/2f8f87fbb28544b380ffeb703b1e2357/FLAG66bbe50e7 [2024-11-10 10:14:47,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe1ebaa3/2f8f87fbb28544b380ffeb703b1e2357 [2024-11-10 10:14:47,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:14:47,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:14:47,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:14:47,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:14:47,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:14:47,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:14:47" (1/1) ... [2024-11-10 10:14:47,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a70db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:47, skipping insertion in model container [2024-11-10 10:14:47,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:14:47" (1/1) ... [2024-11-10 10:14:47,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:14:47,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-10 10:14:48,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:14:48,130 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:14:48,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-10 10:14:48,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:14:48,276 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:14:48,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48 WrapperNode [2024-11-10 10:14:48,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:14:48,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:14:48,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:14:48,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:14:48,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,347 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-10 10:14:48,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:14:48,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:14:48,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:14:48,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:14:48,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,394 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 10:14:48,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:14:48,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:14:48,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:14:48,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:14:48,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (1/1) ... [2024-11-10 10:14:48,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:14:48,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:14:48,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:14:48,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:14:48,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:14:48,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:14:48,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 10:14:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 10:14:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 10:14:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 10:14:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 10:14:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 10:14:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-10 10:14:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-10 10:14:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:14:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:14:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:14:48,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:14:48,527 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:14:48,659 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:14:48,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:14:49,073 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:14:49,073 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:14:49,324 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:14:49,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:14:49,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:14:49 BoogieIcfgContainer [2024-11-10 10:14:49,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:14:49,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:14:49,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:14:49,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:14:49,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:14:47" (1/3) ... [2024-11-10 10:14:49,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39200c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:14:49, skipping insertion in model container [2024-11-10 10:14:49,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:14:48" (2/3) ... [2024-11-10 10:14:49,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39200c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:14:49, skipping insertion in model container [2024-11-10 10:14:49,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:14:49" (3/3) ... [2024-11-10 10:14:49,340 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-11-10 10:14:49,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:14:49,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:14:49,359 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:14:49,425 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:14:49,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-11-10 10:14:49,507 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-10 10:14:49,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:14:49,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-11-10 10:14:49,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-11-10 10:14:49,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-11-10 10:14:49,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:14:49,543 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53bc6a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:14:49,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 10:14:49,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:14:49,548 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-10 10:14:49,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:14:49,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:14:49,549 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 10:14:49,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:14:49,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:14:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash 13425894, now seen corresponding path program 1 times [2024-11-10 10:14:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:14:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531603685] [2024-11-10 10:14:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:14:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:14:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:14:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:14:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:14:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531603685] [2024-11-10 10:14:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531603685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:14:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:14:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 10:14:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89147026] [2024-11-10 10:14:50,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:14:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:14:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:14:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:14:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:14:50,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:14:50,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:14:50,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:14:50,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:14:50,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:14:57,683 INFO L124 PetriNetUnfolderBase]: 51971/68448 cut-off events. [2024-11-10 10:14:57,683 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2024-11-10 10:14:57,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137012 conditions, 68448 events. 51971/68448 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 412173 event pairs, 6431 based on Foata normal form. 1728/70126 useless extension candidates. Maximal degree in co-relation 137000. Up to 58931 conditions per place. [2024-11-10 10:14:58,362 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 65 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2024-11-10 10:14:58,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 309 flow [2024-11-10 10:14:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:14:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:14:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-10 10:14:58,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-10 10:14:58,379 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 102 transitions. [2024-11-10 10:14:58,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 309 flow [2024-11-10 10:14:58,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 302 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:14:58,394 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-11-10 10:14:58,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-10 10:14:58,400 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-11-10 10:14:58,401 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-11-10 10:14:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:14:58,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:14:58,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:14:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:14:58,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:14:58,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:14:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1081085708, now seen corresponding path program 1 times [2024-11-10 10:14:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:14:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552549051] [2024-11-10 10:14:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:14:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:14:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:14:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:14:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:14:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552549051] [2024-11-10 10:14:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552549051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:14:58,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:14:58,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:14:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830204939] [2024-11-10 10:14:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:14:58,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:14:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:14:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:14:58,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:14:58,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:14:58,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:14:58,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:14:58,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:14:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:03,543 INFO L124 PetriNetUnfolderBase]: 41411/57905 cut-off events. [2024-11-10 10:15:03,544 INFO L125 PetriNetUnfolderBase]: For 2102/2102 co-relation queries the response was YES. [2024-11-10 10:15:03,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115705 conditions, 57905 events. 41411/57905 cut-off events. For 2102/2102 co-relation queries the response was YES. Maximal size of possible extension queue 1798. Compared 377243 event pairs, 5075 based on Foata normal form. 1728/59587 useless extension candidates. Maximal degree in co-relation 115695. Up to 33841 conditions per place. [2024-11-10 10:15:04,060 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 78 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2024-11-10 10:15:04,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 374 flow [2024-11-10 10:15:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:15:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:15:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-10 10:15:04,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.635 [2024-11-10 10:15:04,063 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 127 transitions. [2024-11-10 10:15:04,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 374 flow [2024-11-10 10:15:04,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:15:04,070 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-11-10 10:15:04,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-11-10 10:15:04,071 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-11-10 10:15:04,071 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-11-10 10:15:04,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:04,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:04,072 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:04,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:15:04,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:04,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1159152869, now seen corresponding path program 1 times [2024-11-10 10:15:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:04,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182175530] [2024-11-10 10:15:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:04,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182175530] [2024-11-10 10:15:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182175530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:15:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812623759] [2024-11-10 10:15:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:15:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:04,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:15:04,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:15:04,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:15:04,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:04,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:04,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:15:04,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:08,089 INFO L124 PetriNetUnfolderBase]: 25795/36273 cut-off events. [2024-11-10 10:15:08,090 INFO L125 PetriNetUnfolderBase]: For 7038/7038 co-relation queries the response was YES. [2024-11-10 10:15:08,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81153 conditions, 36273 events. 25795/36273 cut-off events. For 7038/7038 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 220656 event pairs, 2975 based on Foata normal form. 1344/37571 useless extension candidates. Maximal degree in co-relation 81141. Up to 14833 conditions per place. [2024-11-10 10:15:08,312 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 101 selfloop transitions, 10 changer transitions 1/118 dead transitions. [2024-11-10 10:15:08,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 531 flow [2024-11-10 10:15:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:15:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:15:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-11-10 10:15:08,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.656 [2024-11-10 10:15:08,317 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 164 transitions. [2024-11-10 10:15:08,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 531 flow [2024-11-10 10:15:08,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 520 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 10:15:08,341 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-11-10 10:15:08,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-11-10 10:15:08,343 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-11-10 10:15:08,343 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-11-10 10:15:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:08,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:08,344 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:08,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:15:08,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 362578131, now seen corresponding path program 1 times [2024-11-10 10:15:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980488971] [2024-11-10 10:15:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980488971] [2024-11-10 10:15:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980488971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:08,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:15:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934205388] [2024-11-10 10:15:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:15:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:08,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:15:08,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:15:08,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:15:08,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:08,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:08,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:15:08,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:10,573 INFO L124 PetriNetUnfolderBase]: 15171/21105 cut-off events. [2024-11-10 10:15:10,573 INFO L125 PetriNetUnfolderBase]: For 12934/12934 co-relation queries the response was YES. [2024-11-10 10:15:10,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51701 conditions, 21105 events. 15171/21105 cut-off events. For 12934/12934 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 114874 event pairs, 2591 based on Foata normal form. 640/21699 useless extension candidates. Maximal degree in co-relation 51687. Up to 6144 conditions per place. [2024-11-10 10:15:10,695 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 122 selfloop transitions, 14 changer transitions 1/143 dead transitions. [2024-11-10 10:15:10,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 694 flow [2024-11-10 10:15:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:15:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:15:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-11-10 10:15:10,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6633333333333333 [2024-11-10 10:15:10,698 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 199 transitions. [2024-11-10 10:15:10,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 694 flow [2024-11-10 10:15:10,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 664 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 10:15:10,846 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-11-10 10:15:10,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-10 10:15:10,847 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-11-10 10:15:10,848 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-11-10 10:15:10,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:10,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:10,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:10,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:15:10,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:10,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1339666423, now seen corresponding path program 1 times [2024-11-10 10:15:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006392405] [2024-11-10 10:15:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006392405] [2024-11-10 10:15:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006392405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:11,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:15:11,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701160440] [2024-11-10 10:15:11,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:15:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:11,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:15:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:15:11,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:15:11,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:11,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:11,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:15:11,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:12,615 INFO L124 PetriNetUnfolderBase]: 11715/16017 cut-off events. [2024-11-10 10:15:12,616 INFO L125 PetriNetUnfolderBase]: For 12446/12446 co-relation queries the response was YES. [2024-11-10 10:15:12,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40630 conditions, 16017 events. 11715/16017 cut-off events. For 12446/12446 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 83331 event pairs, 2399 based on Foata normal form. 160/16131 useless extension candidates. Maximal degree in co-relation 40615. Up to 6144 conditions per place. [2024-11-10 10:15:12,781 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 105 selfloop transitions, 18 changer transitions 1/130 dead transitions. [2024-11-10 10:15:12,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 652 flow [2024-11-10 10:15:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:15:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:15:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-11-10 10:15:12,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.56 [2024-11-10 10:15:12,783 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 196 transitions. [2024-11-10 10:15:12,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 652 flow [2024-11-10 10:15:13,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 606 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-10 10:15:13,025 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-11-10 10:15:13,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-10 10:15:13,026 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-11-10 10:15:13,026 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-11-10 10:15:13,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:13,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:13,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:13,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:15:13,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:13,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash -498891896, now seen corresponding path program 1 times [2024-11-10 10:15:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:13,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420839861] [2024-11-10 10:15:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420839861] [2024-11-10 10:15:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420839861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:15:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423690393] [2024-11-10 10:15:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:13,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:15:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:15:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:15:13,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:15:13,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:13,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:13,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:15:13,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:16,337 INFO L124 PetriNetUnfolderBase]: 24517/33567 cut-off events. [2024-11-10 10:15:16,337 INFO L125 PetriNetUnfolderBase]: For 26694/26694 co-relation queries the response was YES. [2024-11-10 10:15:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86169 conditions, 33567 events. 24517/33567 cut-off events. For 26694/26694 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 191860 event pairs, 1251 based on Foata normal form. 32/33562 useless extension candidates. Maximal degree in co-relation 86153. Up to 13234 conditions per place. [2024-11-10 10:15:16,566 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 118 selfloop transitions, 12 changer transitions 70/206 dead transitions. [2024-11-10 10:15:16,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 206 transitions, 1320 flow [2024-11-10 10:15:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:15:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:15:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-11-10 10:15:16,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.508 [2024-11-10 10:15:16,569 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 10 states and 254 transitions. [2024-11-10 10:15:16,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 206 transitions, 1320 flow [2024-11-10 10:15:17,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 206 transitions, 966 flow, removed 51 selfloop flow, removed 10 redundant places. [2024-11-10 10:15:17,056 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 247 flow [2024-11-10 10:15:17,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-11-10 10:15:17,057 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2024-11-10 10:15:17,057 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 247 flow [2024-11-10 10:15:17,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:17,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:17,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:17,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:15:17,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:17,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1507810434, now seen corresponding path program 2 times [2024-11-10 10:15:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879545200] [2024-11-10 10:15:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879545200] [2024-11-10 10:15:17,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879545200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:17,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:15:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725093629] [2024-11-10 10:15:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:17,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:15:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:15:17,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:15:17,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:15:17,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:17,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:17,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:15:17,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:20,132 INFO L124 PetriNetUnfolderBase]: 25821/36081 cut-off events. [2024-11-10 10:15:20,132 INFO L125 PetriNetUnfolderBase]: For 17367/17377 co-relation queries the response was YES. [2024-11-10 10:15:20,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91948 conditions, 36081 events. 25821/36081 cut-off events. For 17367/17377 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 214406 event pairs, 4657 based on Foata normal form. 16/36042 useless extension candidates. Maximal degree in co-relation 91929. Up to 18456 conditions per place. [2024-11-10 10:15:20,348 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 73 selfloop transitions, 1 changer transitions 59/139 dead transitions. [2024-11-10 10:15:20,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 139 transitions, 782 flow [2024-11-10 10:15:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:15:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:15:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-10 10:15:20,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2024-11-10 10:15:20,350 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 247 flow. Second operand 6 states and 146 transitions. [2024-11-10 10:15:20,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 139 transitions, 782 flow [2024-11-10 10:15:20,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 139 transitions, 766 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-10 10:15:20,372 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 234 flow [2024-11-10 10:15:20,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2024-11-10 10:15:20,373 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2024-11-10 10:15:20,373 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 234 flow [2024-11-10 10:15:20,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:20,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:20,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:15:20,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2067909132, now seen corresponding path program 3 times [2024-11-10 10:15:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194470884] [2024-11-10 10:15:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194470884] [2024-11-10 10:15:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194470884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:15:22,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583548873] [2024-11-10 10:15:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:22,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:15:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:15:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:15:22,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-10 10:15:22,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:22,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:22,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-10 10:15:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:25,731 INFO L124 PetriNetUnfolderBase]: 27517/39423 cut-off events. [2024-11-10 10:15:25,731 INFO L125 PetriNetUnfolderBase]: For 19741/19741 co-relation queries the response was YES. [2024-11-10 10:15:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99606 conditions, 39423 events. 27517/39423 cut-off events. For 19741/19741 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 254705 event pairs, 5597 based on Foata normal form. 16/39435 useless extension candidates. Maximal degree in co-relation 99587. Up to 9557 conditions per place. [2024-11-10 10:15:25,926 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 156 selfloop transitions, 20 changer transitions 92/274 dead transitions. [2024-11-10 10:15:25,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 274 transitions, 1529 flow [2024-11-10 10:15:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:15:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:15:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 315 transitions. [2024-11-10 10:15:25,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-11-10 10:15:25,928 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 234 flow. Second operand 11 states and 315 transitions. [2024-11-10 10:15:25,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 274 transitions, 1529 flow [2024-11-10 10:15:25,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 274 transitions, 1511 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 10:15:25,988 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 369 flow [2024-11-10 10:15:25,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=369, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2024-11-10 10:15:25,989 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2024-11-10 10:15:25,989 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 369 flow [2024-11-10 10:15:25,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:15:25,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:25,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:25,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:15:25,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:25,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -314359954, now seen corresponding path program 4 times [2024-11-10 10:15:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311145018] [2024-11-10 10:15:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:15:26,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:15:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:15:26,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:15:26,210 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:15:26,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-10 10:15:26,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-10 10:15:26,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-10 10:15:26,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 10:15:26,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 10:15:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 10:15:26,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-10 10:15:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:15:26,214 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-10 10:15:26,322 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:15:26,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:15:26,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:15:26 BasicIcfg [2024-11-10 10:15:26,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:15:26,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:15:26,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:15:26,334 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:15:26,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:14:49" (3/4) ... [2024-11-10 10:15:26,335 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:15:26,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:15:26,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:15:26,460 INFO L158 Benchmark]: Toolchain (without parser) took 38881.28ms. Allocated memory was 151.0MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 78.4MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 802.2MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,460 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:15:26,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 697.23ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 78.3MB in the beginning and 152.1MB in the end (delta: -73.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.39ms. Allocated memory is still 188.7MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,461 INFO L158 Benchmark]: Boogie Preprocessor took 67.24ms. Allocated memory is still 188.7MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,461 INFO L158 Benchmark]: IcfgBuilder took 908.56ms. Allocated memory is still 188.7MB. Free memory was 145.8MB in the beginning and 82.9MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,462 INFO L158 Benchmark]: TraceAbstraction took 37002.35ms. Allocated memory was 188.7MB in the beginning and 10.5GB in the end (delta: 10.3GB). Free memory was 81.8MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 744.2MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,462 INFO L158 Benchmark]: Witness Printer took 126.17ms. Allocated memory is still 10.5GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 10:15:26,463 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.24ms. Allocated memory is still 151.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 697.23ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 78.3MB in the beginning and 152.1MB in the end (delta: -73.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.39ms. Allocated memory is still 188.7MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.24ms. Allocated memory is still 188.7MB. Free memory was 150.0MB in the beginning and 145.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 908.56ms. Allocated memory is still 188.7MB. Free memory was 145.8MB in the beginning and 82.9MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37002.35ms. Allocated memory was 188.7MB in the beginning and 10.5GB in the end (delta: 10.3GB). Free memory was 81.8MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 744.2MB. Max. memory is 16.1GB. * Witness Printer took 126.17ms. Allocated memory is still 10.5GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-2, t970=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-2, t970=-1, t971=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-2, t970=-1, t971=0, t972=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969=-2, t970=-1, t971=0, t972=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969=-2, t970=-1, t971=0, t972=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969=-2, t970=-1, t971=0, t972=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, 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: 878]: 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: 872]: 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: 874]: 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 993 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 987 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 4 mSDtfsCounter, 1986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=8, InterpolantAutomatonStates: 52, 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.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 10:15:26,501 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