./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/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/safe030_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.graphml --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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:10:18,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:10:18,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:10:18,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:10:18,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:10:18,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:10:18,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:10:18,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:10:18,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:10:18,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:10:18,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:10:18,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:10:18,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:10:18,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:10:18,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:10:18,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:10:18,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:10:18,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:10:18,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:10:18,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:10:18,339 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:10:18,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:10:18,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:10:18,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:10:18,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:10:18,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:10:18,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:10:18,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:10:18,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:10:18,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:10:18,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:10:18,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:10:18,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:10:18,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:10:18,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:10:18,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:10:18,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:10:18,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:10:18,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:10:18,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:10:18,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:10:18,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:10:18,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:10:18,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:10:18,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:10:18,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:10:18,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:10:18,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:10:18,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:10:18,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:10:18,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:10:18,388 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:10:18,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:10:18,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:10:18,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:10:18,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:10:18,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:10:18,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:10:18,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:10:18,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:10:18,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:10:18,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:10:18,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:10:18,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:10:18,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:10:18,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:10:18,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:10:18,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:10:18,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:10:18,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:10:18,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:10:18,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:10:18,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:10:18,394 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:10:18,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:10:18,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:10:18,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-07-12 10:10:18,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:10:18,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:10:18,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:10:18,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:10:18,620 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:10:18,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:10:18,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf4e34c8/814fb0f23f104cbf82a739bdcb4cce0d/FLAG1e3aa5aed [2022-07-12 10:10:19,159 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:10:19,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:10:19,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf4e34c8/814fb0f23f104cbf82a739bdcb4cce0d/FLAG1e3aa5aed [2022-07-12 10:10:19,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf4e34c8/814fb0f23f104cbf82a739bdcb4cce0d [2022-07-12 10:10:19,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:10:19,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:10:19,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:10:19,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:10:19,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:10:19,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:19,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dfca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19, skipping insertion in model container [2022-07-12 10:10:19,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:19,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:10:19,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:10:19,693 WARN L230 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-12 10:10:19,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:10:19,881 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:10:19,891 WARN L230 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-12 10:10:19,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:10:19,955 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:10:19,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19 WrapperNode [2022-07-12 10:10:19,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:10:19,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:10:19,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:10:19,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:10:19,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:19,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,012 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-07-12 10:10:20,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:10:20,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:10:20,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:10:20,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:10:20,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:10:20,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:10:20,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:10:20,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:10:20,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (1/1) ... [2022-07-12 10:10:20,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:10:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:10:20,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:10:20,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:10:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:10:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:10:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:10:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:10:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:10:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:10:20,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:10:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:10:20,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:10:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:10:20,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:10:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:10:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:10:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:10:20,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:10:20,142 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:10:20,281 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:10:20,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:10:20,704 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:10:20,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:10:20,967 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:10:20,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:10:20 BoogieIcfgContainer [2022-07-12 10:10:20,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:10:20,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:10:20,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:10:20,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:10:20,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:10:19" (1/3) ... [2022-07-12 10:10:20,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189239f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:10:20, skipping insertion in model container [2022-07-12 10:10:20,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:10:19" (2/3) ... [2022-07-12 10:10:20,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189239f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:10:20, skipping insertion in model container [2022-07-12 10:10:20,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:10:20" (3/3) ... [2022-07-12 10:10:20,977 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:10:20,981 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:10:20,989 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:10:20,989 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:10:20,989 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:10:21,064 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:10:21,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-07-12 10:10:21,142 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-12 10:10:21,143 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:10:21,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-12 10:10:21,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-07-12 10:10:21,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-07-12 10:10:21,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:10:21,184 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35ec2393, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3de94f03 [2022-07-12 10:10:21,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:10:21,194 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-07-12 10:10:21,194 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:10:21,194 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:21,199 INFO L200 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, 1, 1, 1, 1, 1] [2022-07-12 10:10:21,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1982469961, now seen corresponding path program 1 times [2022-07-12 10:10:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352805984] [2022-07-12 10:10:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352805984] [2022-07-12 10:10:21,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352805984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:21,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:21,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:10:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531975549] [2022-07-12 10:10:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:21,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:10:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:21,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:10:21,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:10:21,562 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-07-12 10:10:21,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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) [2022-07-12 10:10:21,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:21,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-07-12 10:10:21,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:21,788 INFO L129 PetriNetUnfolder]: 58/486 cut-off events. [2022-07-12 10:10:21,789 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-12 10:10:21,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 486 events. 58/486 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2507 event pairs, 44 based on Foata normal form. 15/471 useless extension candidates. Maximal degree in co-relation 565. Up to 79 conditions per place. [2022-07-12 10:10:21,798 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-07-12 10:10:21,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-07-12 10:10:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:10:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:10:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-07-12 10:10:21,817 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-07-12 10:10:21,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-07-12 10:10:21,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-07-12 10:10:21,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:21,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-07-12 10:10:21,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2022-07-12 10:10:21,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2022-07-12 10:10:21,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2022-07-12 10:10:21,840 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-07-12 10:10:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-07-12 10:10:21,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:10:21,852 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-07-12 10:10:21,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-07-12 10:10:21,857 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-07-12 10:10:21,858 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-07-12 10:10:21,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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) [2022-07-12 10:10:21,858 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:21,859 INFO L200 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, 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] [2022-07-12 10:10:21,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:10:21,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2004174537, now seen corresponding path program 1 times [2022-07-12 10:10:21,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:21,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90086827] [2022-07-12 10:10:21,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:21,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:22,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90086827] [2022-07-12 10:10:22,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90086827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:22,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:22,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:10:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53850177] [2022-07-12 10:10:22,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:22,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:10:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:10:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:10:22,192 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-12 10:10:22,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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) [2022-07-12 10:10:22,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:22,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-12 10:10:22,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:22,766 INFO L129 PetriNetUnfolder]: 369/1236 cut-off events. [2022-07-12 10:10:22,767 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-07-12 10:10:22,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1236 events. 369/1236 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8538 event pairs, 100 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 1887. Up to 352 conditions per place. [2022-07-12 10:10:22,776 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 10 changer transitions 59/165 dead transitions. [2022-07-12 10:10:22,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 520 flow [2022-07-12 10:10:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:10:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:10:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1417 transitions. [2022-07-12 10:10:22,782 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8359882005899705 [2022-07-12 10:10:22,782 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1417 transitions. [2022-07-12 10:10:22,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1417 transitions. [2022-07-12 10:10:22,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:22,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1417 transitions. [2022-07-12 10:10:22,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.46666666666667) internal successors, (1417), 15 states have internal predecessors, (1417), 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) [2022-07-12 10:10:22,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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) [2022-07-12 10:10:22,792 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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) [2022-07-12 10:10:22,793 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 15 states and 1417 transitions. [2022-07-12 10:10:22,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 520 flow [2022-07-12 10:10:22,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 165 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:10:22,798 INFO L242 Difference]: Finished difference. Result has 138 places, 100 transitions, 278 flow [2022-07-12 10:10:22,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=278, PETRI_PLACES=138, PETRI_TRANSITIONS=100} [2022-07-12 10:10:22,800 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2022-07-12 10:10:22,800 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 100 transitions, 278 flow [2022-07-12 10:10:22,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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) [2022-07-12 10:10:22,801 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:22,802 INFO L200 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, 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] [2022-07-12 10:10:22,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:10:22,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -641825364, now seen corresponding path program 1 times [2022-07-12 10:10:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:22,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711720376] [2022-07-12 10:10:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:23,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711720376] [2022-07-12 10:10:23,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711720376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:23,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:23,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:10:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500036753] [2022-07-12 10:10:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:23,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:10:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:10:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:10:23,009 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-12 10:10:23,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 100 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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) [2022-07-12 10:10:23,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:23,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-12 10:10:23,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:23,383 INFO L129 PetriNetUnfolder]: 513/1195 cut-off events. [2022-07-12 10:10:23,383 INFO L130 PetriNetUnfolder]: For 1808/1816 co-relation queries the response was YES. [2022-07-12 10:10:23,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1195 events. 513/1195 cut-off events. For 1808/1816 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7204 event pairs, 161 based on Foata normal form. 24/1166 useless extension candidates. Maximal degree in co-relation 3137. Up to 528 conditions per place. [2022-07-12 10:10:23,392 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 26 selfloop transitions, 3 changer transitions 37/145 dead transitions. [2022-07-12 10:10:23,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 622 flow [2022-07-12 10:10:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:10:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:10:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-07-12 10:10:23,396 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2022-07-12 10:10:23,396 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2022-07-12 10:10:23,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2022-07-12 10:10:23,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:23,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2022-07-12 10:10:23,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 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) [2022-07-12 10:10:23,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:23,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:23,401 INFO L186 Difference]: Start difference. First operand has 138 places, 100 transitions, 278 flow. Second operand 9 states and 882 transitions. [2022-07-12 10:10:23,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 622 flow [2022-07-12 10:10:23,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 145 transitions, 604 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-12 10:10:23,410 INFO L242 Difference]: Finished difference. Result has 127 places, 102 transitions, 311 flow [2022-07-12 10:10:23,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2022-07-12 10:10:23,411 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2022-07-12 10:10:23,411 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 311 flow [2022-07-12 10:10:23,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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) [2022-07-12 10:10:23,412 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:23,412 INFO L200 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, 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] [2022-07-12 10:10:23,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:10:23,413 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:23,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash -469615416, now seen corresponding path program 1 times [2022-07-12 10:10:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:23,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582559632] [2022-07-12 10:10:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582559632] [2022-07-12 10:10:23,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582559632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:23,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:23,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:10:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730906661] [2022-07-12 10:10:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:23,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:10:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:23,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:10:23,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:10:23,555 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-12 10:10:23,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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) [2022-07-12 10:10:23,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:23,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-12 10:10:23,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:23,922 INFO L129 PetriNetUnfolder]: 537/1257 cut-off events. [2022-07-12 10:10:23,922 INFO L130 PetriNetUnfolder]: For 2844/2856 co-relation queries the response was YES. [2022-07-12 10:10:23,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 1257 events. 537/1257 cut-off events. For 2844/2856 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7546 event pairs, 209 based on Foata normal form. 13/1189 useless extension candidates. Maximal degree in co-relation 3661. Up to 691 conditions per place. [2022-07-12 10:10:23,936 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 24 selfloop transitions, 3 changer transitions 25/133 dead transitions. [2022-07-12 10:10:23,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 530 flow [2022-07-12 10:10:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:10:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:10:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2022-07-12 10:10:23,939 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8544739429695182 [2022-07-12 10:10:23,939 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2022-07-12 10:10:23,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2022-07-12 10:10:23,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:23,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2022-07-12 10:10:23,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 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) [2022-07-12 10:10:23,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:23,947 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:23,947 INFO L186 Difference]: Start difference. First operand has 127 places, 102 transitions, 311 flow. Second operand 9 states and 869 transitions. [2022-07-12 10:10:23,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 530 flow [2022-07-12 10:10:23,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 513 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-07-12 10:10:23,958 INFO L242 Difference]: Finished difference. Result has 132 places, 104 transitions, 345 flow [2022-07-12 10:10:23,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=132, PETRI_TRANSITIONS=104} [2022-07-12 10:10:23,959 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-07-12 10:10:23,960 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 104 transitions, 345 flow [2022-07-12 10:10:23,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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) [2022-07-12 10:10:23,961 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:23,961 INFO L200 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, 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] [2022-07-12 10:10:23,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:10:23,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 990989051, now seen corresponding path program 1 times [2022-07-12 10:10:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607111061] [2022-07-12 10:10:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:24,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607111061] [2022-07-12 10:10:24,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607111061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:24,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:24,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:10:24,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656270865] [2022-07-12 10:10:24,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:24,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:10:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:10:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:10:24,129 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-12 10:10:24,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 104 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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) [2022-07-12 10:10:24,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:24,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-12 10:10:24,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:24,669 INFO L129 PetriNetUnfolder]: 829/1930 cut-off events. [2022-07-12 10:10:24,669 INFO L130 PetriNetUnfolder]: For 6940/6969 co-relation queries the response was YES. [2022-07-12 10:10:24,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 1930 events. 829/1930 cut-off events. For 6940/6969 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13632 event pairs, 150 based on Foata normal form. 38/1878 useless extension candidates. Maximal degree in co-relation 6539. Up to 526 conditions per place. [2022-07-12 10:10:24,690 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 34 selfloop transitions, 3 changer transitions 34/152 dead transitions. [2022-07-12 10:10:24,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 152 transitions, 826 flow [2022-07-12 10:10:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:10:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:10:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2022-07-12 10:10:24,693 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8682399213372665 [2022-07-12 10:10:24,693 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2022-07-12 10:10:24,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2022-07-12 10:10:24,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:24,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2022-07-12 10:10:24,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 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) [2022-07-12 10:10:24,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:24,698 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:24,699 INFO L186 Difference]: Start difference. First operand has 132 places, 104 transitions, 345 flow. Second operand 9 states and 883 transitions. [2022-07-12 10:10:24,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 152 transitions, 826 flow [2022-07-12 10:10:24,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 152 transitions, 795 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-07-12 10:10:24,714 INFO L242 Difference]: Finished difference. Result has 137 places, 104 transitions, 357 flow [2022-07-12 10:10:24,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=137, PETRI_TRANSITIONS=104} [2022-07-12 10:10:24,715 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2022-07-12 10:10:24,715 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 104 transitions, 357 flow [2022-07-12 10:10:24,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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) [2022-07-12 10:10:24,715 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:24,716 INFO L200 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, 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, 1] [2022-07-12 10:10:24,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:10:24,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -937336573, now seen corresponding path program 1 times [2022-07-12 10:10:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:24,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475159462] [2022-07-12 10:10:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:24,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475159462] [2022-07-12 10:10:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475159462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:24,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:24,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:10:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175089634] [2022-07-12 10:10:24,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:10:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:10:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:10:24,921 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-12 10:10:24,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 104 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 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) [2022-07-12 10:10:24,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:24,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-12 10:10:24,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:25,497 INFO L129 PetriNetUnfolder]: 718/1665 cut-off events. [2022-07-12 10:10:25,497 INFO L130 PetriNetUnfolder]: For 8380/8469 co-relation queries the response was YES. [2022-07-12 10:10:25,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 1665 events. 718/1665 cut-off events. For 8380/8469 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11019 event pairs, 282 based on Foata normal form. 41/1599 useless extension candidates. Maximal degree in co-relation 6160. Up to 629 conditions per place. [2022-07-12 10:10:25,513 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 33 selfloop transitions, 11 changer transitions 25/148 dead transitions. [2022-07-12 10:10:25,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 148 transitions, 801 flow [2022-07-12 10:10:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:10:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-12 10:10:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1133 transitions. [2022-07-12 10:10:25,517 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8355457227138643 [2022-07-12 10:10:25,517 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1133 transitions. [2022-07-12 10:10:25,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1133 transitions. [2022-07-12 10:10:25,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:25,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1133 transitions. [2022-07-12 10:10:25,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.41666666666667) internal successors, (1133), 12 states have internal predecessors, (1133), 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) [2022-07-12 10:10:25,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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) [2022-07-12 10:10:25,523 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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) [2022-07-12 10:10:25,523 INFO L186 Difference]: Start difference. First operand has 137 places, 104 transitions, 357 flow. Second operand 12 states and 1133 transitions. [2022-07-12 10:10:25,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 148 transitions, 801 flow [2022-07-12 10:10:25,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 148 transitions, 740 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-07-12 10:10:25,535 INFO L242 Difference]: Finished difference. Result has 143 places, 109 transitions, 416 flow [2022-07-12 10:10:25,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=143, PETRI_TRANSITIONS=109} [2022-07-12 10:10:25,536 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-07-12 10:10:25,537 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 109 transitions, 416 flow [2022-07-12 10:10:25,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 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) [2022-07-12 10:10:25,537 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:25,537 INFO L200 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, 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, 1] [2022-07-12 10:10:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:10:25,538 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1634399701, now seen corresponding path program 2 times [2022-07-12 10:10:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:25,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554051549] [2022-07-12 10:10:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:25,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554051549] [2022-07-12 10:10:25,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554051549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:25,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:25,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:10:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656704490] [2022-07-12 10:10:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:25,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:10:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:10:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:10:25,744 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-12 10:10:25,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 109 transitions, 416 flow. Second operand has 11 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 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) [2022-07-12 10:10:25,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:25,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-12 10:10:25,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:26,437 INFO L129 PetriNetUnfolder]: 672/1579 cut-off events. [2022-07-12 10:10:26,437 INFO L130 PetriNetUnfolder]: For 8488/9227 co-relation queries the response was YES. [2022-07-12 10:10:26,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6533 conditions, 1579 events. 672/1579 cut-off events. For 8488/9227 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10422 event pairs, 233 based on Foata normal form. 65/1555 useless extension candidates. Maximal degree in co-relation 6446. Up to 623 conditions per place. [2022-07-12 10:10:26,457 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 39 selfloop transitions, 15 changer transitions 38/170 dead transitions. [2022-07-12 10:10:26,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 170 transitions, 1124 flow [2022-07-12 10:10:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:10:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:10:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1583 transitions. [2022-07-12 10:10:26,462 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8240499739718896 [2022-07-12 10:10:26,463 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1583 transitions. [2022-07-12 10:10:26,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1583 transitions. [2022-07-12 10:10:26,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:26,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1583 transitions. [2022-07-12 10:10:26,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 93.11764705882354) internal successors, (1583), 17 states have internal predecessors, (1583), 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) [2022-07-12 10:10:26,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 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) [2022-07-12 10:10:26,471 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 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) [2022-07-12 10:10:26,471 INFO L186 Difference]: Start difference. First operand has 143 places, 109 transitions, 416 flow. Second operand 17 states and 1583 transitions. [2022-07-12 10:10:26,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 170 transitions, 1124 flow [2022-07-12 10:10:26,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1032 flow, removed 38 selfloop flow, removed 9 redundant places. [2022-07-12 10:10:26,485 INFO L242 Difference]: Finished difference. Result has 155 places, 113 transitions, 507 flow [2022-07-12 10:10:26,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=507, PETRI_PLACES=155, PETRI_TRANSITIONS=113} [2022-07-12 10:10:26,486 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2022-07-12 10:10:26,487 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 113 transitions, 507 flow [2022-07-12 10:10:26,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 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) [2022-07-12 10:10:26,487 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:26,488 INFO L200 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, 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, 1, 1] [2022-07-12 10:10:26,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:10:26,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1475487077, now seen corresponding path program 1 times [2022-07-12 10:10:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252210438] [2022-07-12 10:10:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:26,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252210438] [2022-07-12 10:10:26,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252210438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:26,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:26,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:10:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140066942] [2022-07-12 10:10:26,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:26,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:10:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:10:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:10:26,580 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-12 10:10:26,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 113 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2022-07-12 10:10:26,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:26,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-12 10:10:26,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:27,193 INFO L129 PetriNetUnfolder]: 948/2326 cut-off events. [2022-07-12 10:10:27,194 INFO L130 PetriNetUnfolder]: For 20252/21253 co-relation queries the response was YES. [2022-07-12 10:10:27,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11587 conditions, 2326 events. 948/2326 cut-off events. For 20252/21253 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17806 event pairs, 271 based on Foata normal form. 65/2255 useless extension candidates. Maximal degree in co-relation 11497. Up to 709 conditions per place. [2022-07-12 10:10:27,219 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 39 selfloop transitions, 3 changer transitions 29/153 dead transitions. [2022-07-12 10:10:27,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 1089 flow [2022-07-12 10:10:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:10:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:10:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2022-07-12 10:10:27,222 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623402163225172 [2022-07-12 10:10:27,222 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2022-07-12 10:10:27,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2022-07-12 10:10:27,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:27,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2022-07-12 10:10:27,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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) [2022-07-12 10:10:27,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:27,227 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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) [2022-07-12 10:10:27,227 INFO L186 Difference]: Start difference. First operand has 155 places, 113 transitions, 507 flow. Second operand 9 states and 877 transitions. [2022-07-12 10:10:27,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 1089 flow [2022-07-12 10:10:27,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 153 transitions, 1023 flow, removed 27 selfloop flow, removed 10 redundant places. [2022-07-12 10:10:27,253 INFO L242 Difference]: Finished difference. Result has 151 places, 113 transitions, 498 flow [2022-07-12 10:10:27,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=151, PETRI_TRANSITIONS=113} [2022-07-12 10:10:27,254 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-07-12 10:10:27,254 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 113 transitions, 498 flow [2022-07-12 10:10:27,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2022-07-12 10:10:27,255 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:27,255 INFO L200 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, 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, 1, 1] [2022-07-12 10:10:27,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:10:27,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1136446740, now seen corresponding path program 1 times [2022-07-12 10:10:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396617208] [2022-07-12 10:10:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:27,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396617208] [2022-07-12 10:10:27,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396617208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:27,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:27,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:10:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406324094] [2022-07-12 10:10:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:27,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:10:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:10:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:10:27,496 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-07-12 10:10:27,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 113 transitions, 498 flow. Second operand has 13 states, 13 states have (on average 88.3076923076923) internal successors, (1148), 13 states have internal predecessors, (1148), 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) [2022-07-12 10:10:27,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:27,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-07-12 10:10:27,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:28,182 INFO L129 PetriNetUnfolder]: 602/1580 cut-off events. [2022-07-12 10:10:28,182 INFO L130 PetriNetUnfolder]: For 12665/13204 co-relation queries the response was YES. [2022-07-12 10:10:28,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 1580 events. 602/1580 cut-off events. For 12665/13204 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10870 event pairs, 344 based on Foata normal form. 28/1475 useless extension candidates. Maximal degree in co-relation 7479. Up to 810 conditions per place. [2022-07-12 10:10:28,205 INFO L132 encePairwiseOnDemand]: 100/113 looper letters, 30 selfloop transitions, 14 changer transitions 41/162 dead transitions. [2022-07-12 10:10:28,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 162 transitions, 1156 flow [2022-07-12 10:10:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:10:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-12 10:10:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1637 transitions. [2022-07-12 10:10:28,210 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8048180924287119 [2022-07-12 10:10:28,210 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1637 transitions. [2022-07-12 10:10:28,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1637 transitions. [2022-07-12 10:10:28,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:28,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1637 transitions. [2022-07-12 10:10:28,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.94444444444444) internal successors, (1637), 18 states have internal predecessors, (1637), 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) [2022-07-12 10:10:28,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 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) [2022-07-12 10:10:28,219 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 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) [2022-07-12 10:10:28,219 INFO L186 Difference]: Start difference. First operand has 151 places, 113 transitions, 498 flow. Second operand 18 states and 1637 transitions. [2022-07-12 10:10:28,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 162 transitions, 1156 flow [2022-07-12 10:10:28,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 1085 flow, removed 34 selfloop flow, removed 7 redundant places. [2022-07-12 10:10:28,241 INFO L242 Difference]: Finished difference. Result has 166 places, 115 transitions, 562 flow [2022-07-12 10:10:28,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=562, PETRI_PLACES=166, PETRI_TRANSITIONS=115} [2022-07-12 10:10:28,242 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2022-07-12 10:10:28,242 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 115 transitions, 562 flow [2022-07-12 10:10:28,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.3076923076923) internal successors, (1148), 13 states have internal predecessors, (1148), 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) [2022-07-12 10:10:28,243 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:28,244 INFO L200 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, 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, 1, 1, 1] [2022-07-12 10:10:28,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:10:28,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1341308941, now seen corresponding path program 1 times [2022-07-12 10:10:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:28,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383031500] [2022-07-12 10:10:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:28,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:28,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383031500] [2022-07-12 10:10:28,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383031500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:28,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:28,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:10:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097446083] [2022-07-12 10:10:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:28,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:10:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:10:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:10:28,413 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-12 10:10:28,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 115 transitions, 562 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 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) [2022-07-12 10:10:28,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:28,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-12 10:10:28,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:29,048 INFO L129 PetriNetUnfolder]: 764/1997 cut-off events. [2022-07-12 10:10:29,048 INFO L130 PetriNetUnfolder]: For 25595/26910 co-relation queries the response was YES. [2022-07-12 10:10:29,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11349 conditions, 1997 events. 764/1997 cut-off events. For 25595/26910 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15483 event pairs, 190 based on Foata normal form. 98/1950 useless extension candidates. Maximal degree in co-relation 11247. Up to 610 conditions per place. [2022-07-12 10:10:29,067 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 32 selfloop transitions, 16 changer transitions 27/154 dead transitions. [2022-07-12 10:10:29,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 154 transitions, 1222 flow [2022-07-12 10:10:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:10:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:10:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1309 transitions. [2022-07-12 10:10:29,070 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.827433628318584 [2022-07-12 10:10:29,070 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1309 transitions. [2022-07-12 10:10:29,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1309 transitions. [2022-07-12 10:10:29,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:29,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1309 transitions. [2022-07-12 10:10:29,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.5) internal successors, (1309), 14 states have internal predecessors, (1309), 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) [2022-07-12 10:10:29,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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) [2022-07-12 10:10:29,077 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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) [2022-07-12 10:10:29,077 INFO L186 Difference]: Start difference. First operand has 166 places, 115 transitions, 562 flow. Second operand 14 states and 1309 transitions. [2022-07-12 10:10:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 154 transitions, 1222 flow [2022-07-12 10:10:29,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 1116 flow, removed 42 selfloop flow, removed 16 redundant places. [2022-07-12 10:10:29,112 INFO L242 Difference]: Finished difference. Result has 161 places, 118 transitions, 621 flow [2022-07-12 10:10:29,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=621, PETRI_PLACES=161, PETRI_TRANSITIONS=118} [2022-07-12 10:10:29,113 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2022-07-12 10:10:29,113 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 118 transitions, 621 flow [2022-07-12 10:10:29,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 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) [2022-07-12 10:10:29,113 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:29,114 INFO L200 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, 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, 1, 1, 1, 1] [2022-07-12 10:10:29,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:10:29,114 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1583325092, now seen corresponding path program 1 times [2022-07-12 10:10:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:29,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620157589] [2022-07-12 10:10:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:29,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:29,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620157589] [2022-07-12 10:10:29,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620157589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:29,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:29,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:10:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322680046] [2022-07-12 10:10:29,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:29,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:10:29,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:29,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:10:29,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:10:29,195 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-12 10:10:29,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 118 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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) [2022-07-12 10:10:29,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:29,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-12 10:10:29,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:30,382 INFO L129 PetriNetUnfolder]: 3998/7295 cut-off events. [2022-07-12 10:10:30,383 INFO L130 PetriNetUnfolder]: For 121578/123034 co-relation queries the response was YES. [2022-07-12 10:10:30,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38967 conditions, 7295 events. 3998/7295 cut-off events. For 121578/123034 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 56222 event pairs, 240 based on Foata normal form. 427/7316 useless extension candidates. Maximal degree in co-relation 38873. Up to 2323 conditions per place. [2022-07-12 10:10:30,437 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 55 selfloop transitions, 6 changer transitions 93/236 dead transitions. [2022-07-12 10:10:30,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 236 transitions, 2240 flow [2022-07-12 10:10:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:10:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:10:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions. [2022-07-12 10:10:30,441 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8601769911504424 [2022-07-12 10:10:30,441 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 972 transitions. [2022-07-12 10:10:30,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions. [2022-07-12 10:10:30,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:30,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions. [2022-07-12 10:10:30,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 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) [2022-07-12 10:10:30,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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) [2022-07-12 10:10:30,445 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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) [2022-07-12 10:10:30,445 INFO L186 Difference]: Start difference. First operand has 161 places, 118 transitions, 621 flow. Second operand 10 states and 972 transitions. [2022-07-12 10:10:30,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 236 transitions, 2240 flow [2022-07-12 10:10:30,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 236 transitions, 1977 flow, removed 95 selfloop flow, removed 12 redundant places. [2022-07-12 10:10:30,540 INFO L242 Difference]: Finished difference. Result has 158 places, 118 transitions, 598 flow [2022-07-12 10:10:30,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=598, PETRI_PLACES=158, PETRI_TRANSITIONS=118} [2022-07-12 10:10:30,541 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-07-12 10:10:30,541 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 118 transitions, 598 flow [2022-07-12 10:10:30,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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) [2022-07-12 10:10:30,542 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:30,542 INFO L200 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, 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, 1, 1, 1, 1, 1] [2022-07-12 10:10:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:10:30,542 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash 633851726, now seen corresponding path program 1 times [2022-07-12 10:10:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734416900] [2022-07-12 10:10:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734416900] [2022-07-12 10:10:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734416900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:30,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:30,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:10:30,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829950840] [2022-07-12 10:10:30,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:10:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:10:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:10:30,630 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-12 10:10:30,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 118 transitions, 598 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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) [2022-07-12 10:10:30,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:30,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-12 10:10:30,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:31,237 INFO L129 PetriNetUnfolder]: 1288/2841 cut-off events. [2022-07-12 10:10:31,237 INFO L130 PetriNetUnfolder]: For 35311/35725 co-relation queries the response was YES. [2022-07-12 10:10:31,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14793 conditions, 2841 events. 1288/2841 cut-off events. For 35311/35725 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 21301 event pairs, 31 based on Foata normal form. 251/3022 useless extension candidates. Maximal degree in co-relation 14701. Up to 790 conditions per place. [2022-07-12 10:10:31,257 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 52 selfloop transitions, 9 changer transitions 58/201 dead transitions. [2022-07-12 10:10:31,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 1802 flow [2022-07-12 10:10:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:10:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:10:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 970 transitions. [2022-07-12 10:10:31,260 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2022-07-12 10:10:31,260 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 970 transitions. [2022-07-12 10:10:31,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 970 transitions. [2022-07-12 10:10:31,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:31,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 970 transitions. [2022-07-12 10:10:31,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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) [2022-07-12 10:10:31,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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) [2022-07-12 10:10:31,265 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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) [2022-07-12 10:10:31,265 INFO L186 Difference]: Start difference. First operand has 158 places, 118 transitions, 598 flow. Second operand 10 states and 970 transitions. [2022-07-12 10:10:31,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 1802 flow [2022-07-12 10:10:31,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 201 transitions, 1689 flow, removed 26 selfloop flow, removed 9 redundant places. [2022-07-12 10:10:31,304 INFO L242 Difference]: Finished difference. Result has 158 places, 119 transitions, 621 flow [2022-07-12 10:10:31,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=621, PETRI_PLACES=158, PETRI_TRANSITIONS=119} [2022-07-12 10:10:31,305 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-07-12 10:10:31,305 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 621 flow [2022-07-12 10:10:31,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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) [2022-07-12 10:10:31,306 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:31,306 INFO L200 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:10:31,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:10:31,306 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 367883124, now seen corresponding path program 1 times [2022-07-12 10:10:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452995257] [2022-07-12 10:10:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452995257] [2022-07-12 10:10:31,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452995257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:31,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:31,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:10:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607991818] [2022-07-12 10:10:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:31,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:10:31,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:10:31,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:10:31,414 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-12 10:10:31,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 621 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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) [2022-07-12 10:10:31,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:31,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-12 10:10:31,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:31,795 INFO L129 PetriNetUnfolder]: 389/1151 cut-off events. [2022-07-12 10:10:31,795 INFO L130 PetriNetUnfolder]: For 10743/10946 co-relation queries the response was YES. [2022-07-12 10:10:31,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5735 conditions, 1151 events. 389/1151 cut-off events. For 10743/10946 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7844 event pairs, 17 based on Foata normal form. 58/1187 useless extension candidates. Maximal degree in co-relation 5642. Up to 271 conditions per place. [2022-07-12 10:10:31,803 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 33 selfloop transitions, 12 changer transitions 39/164 dead transitions. [2022-07-12 10:10:31,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 1314 flow [2022-07-12 10:10:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:10:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:10:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1038 transitions. [2022-07-12 10:10:31,806 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.835076427996782 [2022-07-12 10:10:31,806 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1038 transitions. [2022-07-12 10:10:31,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1038 transitions. [2022-07-12 10:10:31,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:31,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1038 transitions. [2022-07-12 10:10:31,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 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) [2022-07-12 10:10:31,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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) [2022-07-12 10:10:31,825 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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) [2022-07-12 10:10:31,825 INFO L186 Difference]: Start difference. First operand has 158 places, 119 transitions, 621 flow. Second operand 11 states and 1038 transitions. [2022-07-12 10:10:31,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 1314 flow [2022-07-12 10:10:31,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 164 transitions, 1031 flow, removed 128 selfloop flow, removed 19 redundant places. [2022-07-12 10:10:31,849 INFO L242 Difference]: Finished difference. Result has 151 places, 111 transitions, 467 flow [2022-07-12 10:10:31,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=467, PETRI_PLACES=151, PETRI_TRANSITIONS=111} [2022-07-12 10:10:31,851 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-07-12 10:10:31,852 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 111 transitions, 467 flow [2022-07-12 10:10:31,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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) [2022-07-12 10:10:31,852 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:31,852 INFO L200 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:10:31,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:10:31,853 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash 682024245, now seen corresponding path program 1 times [2022-07-12 10:10:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822827476] [2022-07-12 10:10:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:10:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:10:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:10:32,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822827476] [2022-07-12 10:10:32,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822827476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:10:32,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:10:32,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:10:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304247860] [2022-07-12 10:10:32,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:10:32,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:10:32,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:10:32,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:10:32,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:10:32,162 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2022-07-12 10:10:32,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 111 transitions, 467 flow. Second operand has 14 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 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) [2022-07-12 10:10:32,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:10:32,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2022-07-12 10:10:32,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:10:32,585 INFO L129 PetriNetUnfolder]: 125/786 cut-off events. [2022-07-12 10:10:32,585 INFO L130 PetriNetUnfolder]: For 2584/2716 co-relation queries the response was YES. [2022-07-12 10:10:32,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 786 events. 125/786 cut-off events. For 2584/2716 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6014 event pairs, 0 based on Foata normal form. 14/780 useless extension candidates. Maximal degree in co-relation 2414. Up to 157 conditions per place. [2022-07-12 10:10:32,591 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 12 changer transitions 15/126 dead transitions. [2022-07-12 10:10:32,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 126 transitions, 647 flow [2022-07-12 10:10:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:10:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:10:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1317 transitions. [2022-07-12 10:10:32,594 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7769911504424779 [2022-07-12 10:10:32,594 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1317 transitions. [2022-07-12 10:10:32,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1317 transitions. [2022-07-12 10:10:32,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:10:32,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1317 transitions. [2022-07-12 10:10:32,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.8) internal successors, (1317), 15 states have internal predecessors, (1317), 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) [2022-07-12 10:10:32,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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) [2022-07-12 10:10:32,600 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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) [2022-07-12 10:10:32,601 INFO L186 Difference]: Start difference. First operand has 151 places, 111 transitions, 467 flow. Second operand 15 states and 1317 transitions. [2022-07-12 10:10:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 126 transitions, 647 flow [2022-07-12 10:10:32,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 126 transitions, 491 flow, removed 56 selfloop flow, removed 25 redundant places. [2022-07-12 10:10:32,612 INFO L242 Difference]: Finished difference. Result has 142 places, 108 transitions, 378 flow [2022-07-12 10:10:32,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=378, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2022-07-12 10:10:32,613 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2022-07-12 10:10:32,613 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 108 transitions, 378 flow [2022-07-12 10:10:32,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 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) [2022-07-12 10:10:32,614 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:10:32,614 INFO L200 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:10:32,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:10:32,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:10:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:10:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 37696987, now seen corresponding path program 2 times [2022-07-12 10:10:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:10:32,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053310615] [2022-07-12 10:10:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:10:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:10:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:10:32,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:10:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:10:32,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:10:32,741 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:10:32,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:10:32,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:10:32,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:10:32,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:10:32,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:10:32,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:10:32,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:10:32,745 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:10:32,751 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:10:32,751 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:10:32,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:10:32 BasicIcfg [2022-07-12 10:10:32,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:10:32,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:10:32,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:10:32,858 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:10:32,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:10:20" (3/4) ... [2022-07-12 10:10:32,860 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:10:32,974 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:10:32,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:10:32,975 INFO L158 Benchmark]: Toolchain (without parser) took 13477.45ms. Allocated memory was 102.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 65.4MB in the beginning and 463.8MB in the end (delta: -398.3MB). Peak memory consumption was 685.1MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,976 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:10:32,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.06ms. Allocated memory is still 102.8MB. Free memory was 65.2MB in the beginning and 64.9MB in the end (delta: 280.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.61ms. Allocated memory is still 102.8MB. Free memory was 64.9MB in the beginning and 61.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,977 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 102.8MB. Free memory was 61.9MB in the beginning and 59.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,977 INFO L158 Benchmark]: RCFGBuilder took 915.49ms. Allocated memory is still 102.8MB. Free memory was 59.7MB in the beginning and 43.0MB in the end (delta: 16.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,977 INFO L158 Benchmark]: TraceAbstraction took 11886.34ms. Allocated memory was 102.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 42.5MB in the beginning and 487.9MB in the end (delta: -445.4MB). Peak memory consumption was 638.3MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,978 INFO L158 Benchmark]: Witness Printer took 116.70ms. Allocated memory is still 1.2GB. Free memory was 487.9MB in the beginning and 463.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 10:10:32,980 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.06ms. Allocated memory is still 102.8MB. Free memory was 65.2MB in the beginning and 64.9MB in the end (delta: 280.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.61ms. Allocated memory is still 102.8MB. Free memory was 64.9MB in the beginning and 61.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 102.8MB. Free memory was 61.9MB in the beginning and 59.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 915.49ms. Allocated memory is still 102.8MB. Free memory was 59.7MB in the beginning and 43.0MB in the end (delta: 16.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11886.34ms. Allocated memory was 102.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 42.5MB in the beginning and 487.9MB in the end (delta: -445.4MB). Peak memory consumption was 638.3MB. Max. memory is 16.1GB. * Witness Printer took 116.70ms. Allocated memory is still 1.2GB. Free memory was 487.9MB in the beginning and 463.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1064 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 128 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=10, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1049 ConstructedInterpolants, 0 QuantifiedInterpolants, 6103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 10:10:33,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE