./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.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/mix029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:06:14,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:06:14,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:06:14,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:06:14,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:06:14,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:06:14,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:06:14,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:06:14,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:06:14,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:06:14,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:06:14,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:06:14,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:06:14,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:06:14,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:06:14,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:06:14,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:06:14,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:06:14,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:06:14,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:06:14,617 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:06:14,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:06:14,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:06:14,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:06:14,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:06:14,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:06:14,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:06:14,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:06:14,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:06:14,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:06:14,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:06:14,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:06:14,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:06:14,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:06:14,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:06:14,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:06:14,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:06:14,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:06:14,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:06:14,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:06:14,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:06:14,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:06:14,629 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:06:14,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:06:14,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:06:14,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:06:14,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:06:14,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:06:14,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:06:14,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:06:14,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:06:14,646 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:06:14,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:06:14,646 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:06:14,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:06:14,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:06:14,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:06:14,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:06:14,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:06:14,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:06:14,647 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:06:14,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:06:14,647 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:06:14,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:06:14,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:06:14,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:06:14,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:06:14,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:06:14,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:06:14,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:06:14,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:06:14,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:06:14,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:06:14,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:06:14,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:06:14,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:06:14,650 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2022-07-12 10:06:14,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:06:14,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:06:14,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:06:14,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:06:14,837 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:06:14,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-07-12 10:06:14,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6934700bd/f6fc260ab8224e02a00cb62de4fe657a/FLAGc62313d8e [2022-07-12 10:06:15,372 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:06:15,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-07-12 10:06:15,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6934700bd/f6fc260ab8224e02a00cb62de4fe657a/FLAGc62313d8e [2022-07-12 10:06:15,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6934700bd/f6fc260ab8224e02a00cb62de4fe657a [2022-07-12 10:06:15,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:06:15,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:06:15,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:06:15,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:06:15,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:06:15,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:06:15" (1/1) ... [2022-07-12 10:06:15,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ad314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:15, skipping insertion in model container [2022-07-12 10:06:15,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:06:15" (1/1) ... [2022-07-12 10:06:15,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:06:15,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:06:16,057 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-07-12 10:06:16,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:06:16,258 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:06:16,273 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-07-12 10:06:16,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:06:16,355 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:06:16,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16 WrapperNode [2022-07-12 10:06:16,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:06:16,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:06:16,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:06:16,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:06:16,363 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:06:16" (1/1) ... [2022-07-12 10:06:16,393 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:06:16" (1/1) ... [2022-07-12 10:06:16,428 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-07-12 10:06:16,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:06:16,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:06:16,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:06:16,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:06:16,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:06:16,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:06:16,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:06:16,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:06:16,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (1/1) ... [2022-07-12 10:06:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:06:16,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:06:16,521 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:06:16,539 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:06:16,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:06:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:06:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:06:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:06:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:06:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:06:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:06:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:06:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:06:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:06:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:06:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-12 10:06:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-12 10:06:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:06:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:06:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:06:16,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:06:16,557 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:06:16,662 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:06:16,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:06:17,106 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:06:17,371 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:06:17,371 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:06:17,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:06:17 BoogieIcfgContainer [2022-07-12 10:06:17,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:06:17,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:06:17,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:06:17,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:06:17,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:06:15" (1/3) ... [2022-07-12 10:06:17,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8cf343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:06:17, skipping insertion in model container [2022-07-12 10:06:17,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:16" (2/3) ... [2022-07-12 10:06:17,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8cf343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:06:17, skipping insertion in model container [2022-07-12 10:06:17,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:06:17" (3/3) ... [2022-07-12 10:06:17,381 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-07-12 10:06:17,385 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:06:17,392 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:06:17,392 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:06:17,392 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:06:17,442 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:06:17,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-07-12 10:06:17,530 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2022-07-12 10:06:17,531 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:06:17,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-07-12 10:06:17,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-07-12 10:06:17,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-07-12 10:06:17,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:06:17,561 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@2a3eaca7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f98a026 [2022-07-12 10:06:17,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 10:06:17,581 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2022-07-12 10:06:17,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:06:17,582 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:17,582 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] [2022-07-12 10:06:17,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1884608713, now seen corresponding path program 1 times [2022-07-12 10:06:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:17,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023753649] [2022-07-12 10:06:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:17,828 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:06:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:17,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023753649] [2022-07-12 10:06:17,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023753649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:17,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:17,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:06:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652137662] [2022-07-12 10:06:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:06:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:17,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:06:17,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:06:17,870 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2022-07-12 10:06:17,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:06:17,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:17,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2022-07-12 10:06:17,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:17,989 INFO L129 PetriNetUnfolder]: 57/350 cut-off events. [2022-07-12 10:06:17,989 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-12 10:06:17,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 350 events. 57/350 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1377 event pairs, 11 based on Foata normal form. 14/345 useless extension candidates. Maximal degree in co-relation 422. Up to 75 conditions per place. [2022-07-12 10:06:17,993 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 14 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2022-07-12 10:06:17,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 313 flow [2022-07-12 10:06:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:06:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:06:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-07-12 10:06:18,005 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-07-12 10:06:18,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-07-12 10:06:18,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-07-12 10:06:18,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:18,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-07-12 10:06:18,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:06:18,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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:06:18,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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:06:18,020 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-07-12 10:06:18,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 313 flow [2022-07-12 10:06:18,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:06:18,025 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-07-12 10:06:18,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-07-12 10:06:18,030 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-07-12 10:06:18,030 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-07-12 10:06:18,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:06:18,031 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:18,031 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] [2022-07-12 10:06:18,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:06:18,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -966961645, now seen corresponding path program 1 times [2022-07-12 10:06:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111087342] [2022-07-12 10:06:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:18,221 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:06:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:18,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111087342] [2022-07-12 10:06:18,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111087342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:18,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:18,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:06:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370498407] [2022-07-12 10:06:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:18,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:06:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:06:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:06:18,229 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:06:18,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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:06:18,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:18,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:06:18,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:18,713 INFO L129 PetriNetUnfolder]: 724/2189 cut-off events. [2022-07-12 10:06:18,713 INFO L130 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-07-12 10:06:18,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 2189 events. 724/2189 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17062 event pairs, 222 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 3384. Up to 652 conditions per place. [2022-07-12 10:06:18,728 INFO L132 encePairwiseOnDemand]: 129/136 looper letters, 22 selfloop transitions, 3 changer transitions 56/176 dead transitions. [2022-07-12 10:06:18,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 176 transitions, 516 flow [2022-07-12 10:06:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:06:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:06:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-07-12 10:06:18,733 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2022-07-12 10:06:18,733 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-07-12 10:06:18,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-07-12 10:06:18,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:18,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-07-12 10:06:18,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 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:06:18,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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:06:18,739 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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:06:18,739 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1078 transitions. [2022-07-12 10:06:18,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 176 transitions, 516 flow [2022-07-12 10:06:18,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 176 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:06:18,744 INFO L242 Difference]: Finished difference. Result has 152 places, 116 transitions, 279 flow [2022-07-12 10:06:18,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2022-07-12 10:06:18,745 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-07-12 10:06:18,745 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 279 flow [2022-07-12 10:06:18,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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:06:18,745 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:18,745 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:06:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:06:18,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1632312498, now seen corresponding path program 1 times [2022-07-12 10:06:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:18,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511598507] [2022-07-12 10:06:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:18,925 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:06:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:18,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511598507] [2022-07-12 10:06:18,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511598507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:18,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:18,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:06:18,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496474412] [2022-07-12 10:06:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:18,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:06:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:06:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:06:18,928 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-07-12 10:06:18,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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:06:18,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:18,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-07-12 10:06:18,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:19,191 INFO L129 PetriNetUnfolder]: 390/907 cut-off events. [2022-07-12 10:06:19,191 INFO L130 PetriNetUnfolder]: For 564/566 co-relation queries the response was YES. [2022-07-12 10:06:19,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 907 events. 390/907 cut-off events. For 564/566 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5290 event pairs, 69 based on Foata normal form. 28/905 useless extension candidates. Maximal degree in co-relation 1918. Up to 281 conditions per place. [2022-07-12 10:06:19,197 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 19 selfloop transitions, 2 changer transitions 31/151 dead transitions. [2022-07-12 10:06:19,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 471 flow [2022-07-12 10:06:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:06:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:06:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2022-07-12 10:06:19,200 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-07-12 10:06:19,200 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2022-07-12 10:06:19,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2022-07-12 10:06:19,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:19,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2022-07-12 10:06:19,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 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:06:19,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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:06:19,205 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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:06:19,205 INFO L186 Difference]: Start difference. First operand has 152 places, 116 transitions, 279 flow. Second operand 9 states and 1080 transitions. [2022-07-12 10:06:19,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 471 flow [2022-07-12 10:06:19,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 151 transitions, 452 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-07-12 10:06:19,214 INFO L242 Difference]: Finished difference. Result has 143 places, 116 transitions, 288 flow [2022-07-12 10:06:19,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=143, PETRI_TRANSITIONS=116} [2022-07-12 10:06:19,216 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-07-12 10:06:19,216 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 288 flow [2022-07-12 10:06:19,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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:06:19,217 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:19,217 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, 1] [2022-07-12 10:06:19,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:06:19,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:19,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1998640024, now seen corresponding path program 1 times [2022-07-12 10:06:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:19,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257561226] [2022-07-12 10:06:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:19,460 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:06:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:19,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257561226] [2022-07-12 10:06:19,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257561226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:19,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:19,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:06:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852086355] [2022-07-12 10:06:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:19,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:06:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:19,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:06:19,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:06:19,467 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:06:19,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 116 transitions, 288 flow. Second operand has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 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:06:19,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:19,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:06:19,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:19,825 INFO L129 PetriNetUnfolder]: 447/1072 cut-off events. [2022-07-12 10:06:19,826 INFO L130 PetriNetUnfolder]: For 1010/1014 co-relation queries the response was YES. [2022-07-12 10:06:19,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1072 events. 447/1072 cut-off events. For 1010/1014 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6287 event pairs, 138 based on Foata normal form. 26/1061 useless extension candidates. Maximal degree in co-relation 2367. Up to 413 conditions per place. [2022-07-12 10:06:19,835 INFO L132 encePairwiseOnDemand]: 122/136 looper letters, 21 selfloop transitions, 12 changer transitions 43/171 dead transitions. [2022-07-12 10:06:19,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 171 transitions, 600 flow [2022-07-12 10:06:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:06:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:06:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1839 transitions. [2022-07-12 10:06:19,839 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8451286764705882 [2022-07-12 10:06:19,839 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1839 transitions. [2022-07-12 10:06:19,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1839 transitions. [2022-07-12 10:06:19,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:19,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1839 transitions. [2022-07-12 10:06:19,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.9375) internal successors, (1839), 16 states have internal predecessors, (1839), 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:06:19,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 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:06:19,850 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 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:06:19,851 INFO L186 Difference]: Start difference. First operand has 143 places, 116 transitions, 288 flow. Second operand 16 states and 1839 transitions. [2022-07-12 10:06:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 171 transitions, 600 flow [2022-07-12 10:06:19,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 171 transitions, 556 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-07-12 10:06:19,859 INFO L242 Difference]: Finished difference. Result has 155 places, 123 transitions, 371 flow [2022-07-12 10:06:19,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=371, PETRI_PLACES=155, PETRI_TRANSITIONS=123} [2022-07-12 10:06:19,861 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 12 predicate places. [2022-07-12 10:06:19,861 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 123 transitions, 371 flow [2022-07-12 10:06:19,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 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:06:19,862 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:19,862 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, 1, 1, 1] [2022-07-12 10:06:19,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:06:19,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1653515102, now seen corresponding path program 1 times [2022-07-12 10:06:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:19,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109991063] [2022-07-12 10:06:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:20,082 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:06:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109991063] [2022-07-12 10:06:20,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109991063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:20,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:20,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:06:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311388223] [2022-07-12 10:06:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:20,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:06:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:06:20,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:06:20,085 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-07-12 10:06:20,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 123 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 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:06:20,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:20,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-07-12 10:06:20,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:20,365 INFO L129 PetriNetUnfolder]: 363/902 cut-off events. [2022-07-12 10:06:20,365 INFO L130 PetriNetUnfolder]: For 2734/2948 co-relation queries the response was YES. [2022-07-12 10:06:20,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 902 events. 363/902 cut-off events. For 2734/2948 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5055 event pairs, 150 based on Foata normal form. 29/902 useless extension candidates. Maximal degree in co-relation 3023. Up to 378 conditions per place. [2022-07-12 10:06:20,375 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 27 selfloop transitions, 13 changer transitions 29/165 dead transitions. [2022-07-12 10:06:20,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 165 transitions, 798 flow [2022-07-12 10:06:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:06:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-12 10:06:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1393 transitions. [2022-07-12 10:06:20,379 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8535539215686274 [2022-07-12 10:06:20,379 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1393 transitions. [2022-07-12 10:06:20,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1393 transitions. [2022-07-12 10:06:20,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:20,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1393 transitions. [2022-07-12 10:06:20,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.08333333333333) internal successors, (1393), 12 states have internal predecessors, (1393), 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:06:20,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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:06:20,384 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 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:06:20,385 INFO L186 Difference]: Start difference. First operand has 155 places, 123 transitions, 371 flow. Second operand 12 states and 1393 transitions. [2022-07-12 10:06:20,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 165 transitions, 798 flow [2022-07-12 10:06:20,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 165 transitions, 778 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-12 10:06:20,391 INFO L242 Difference]: Finished difference. Result has 159 places, 131 transitions, 495 flow [2022-07-12 10:06:20,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=495, PETRI_PLACES=159, PETRI_TRANSITIONS=131} [2022-07-12 10:06:20,394 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 16 predicate places. [2022-07-12 10:06:20,394 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 131 transitions, 495 flow [2022-07-12 10:06:20,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 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:06:20,394 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:20,394 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, 1, 1, 1, 1] [2022-07-12 10:06:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:06:20,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1395639650, now seen corresponding path program 1 times [2022-07-12 10:06:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931838962] [2022-07-12 10:06:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:20,513 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:06:20,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:20,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931838962] [2022-07-12 10:06:20,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931838962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:20,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:20,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:06:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362131029] [2022-07-12 10:06:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:20,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:06:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:20,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:06:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:06:20,516 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:06:20,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 131 transitions, 495 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:06:20,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:20,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:06:20,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:20,802 INFO L129 PetriNetUnfolder]: 347/883 cut-off events. [2022-07-12 10:06:20,802 INFO L130 PetriNetUnfolder]: For 4917/5043 co-relation queries the response was YES. [2022-07-12 10:06:20,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 883 events. 347/883 cut-off events. For 4917/5043 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4684 event pairs, 96 based on Foata normal form. 21/872 useless extension candidates. Maximal degree in co-relation 3534. Up to 320 conditions per place. [2022-07-12 10:06:20,813 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 38 selfloop transitions, 11 changer transitions 25/171 dead transitions. [2022-07-12 10:06:20,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 171 transitions, 983 flow [2022-07-12 10:06:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:06:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:06:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1294 transitions. [2022-07-12 10:06:20,817 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8649732620320856 [2022-07-12 10:06:20,817 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1294 transitions. [2022-07-12 10:06:20,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1294 transitions. [2022-07-12 10:06:20,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:20,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1294 transitions. [2022-07-12 10:06:20,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.63636363636364) internal successors, (1294), 11 states have internal predecessors, (1294), 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:06:20,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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:06:20,822 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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:06:20,823 INFO L186 Difference]: Start difference. First operand has 159 places, 131 transitions, 495 flow. Second operand 11 states and 1294 transitions. [2022-07-12 10:06:20,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 171 transitions, 983 flow [2022-07-12 10:06:20,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 171 transitions, 941 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-07-12 10:06:20,830 INFO L242 Difference]: Finished difference. Result has 165 places, 135 transitions, 543 flow [2022-07-12 10:06:20,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=543, PETRI_PLACES=165, PETRI_TRANSITIONS=135} [2022-07-12 10:06:20,833 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 22 predicate places. [2022-07-12 10:06:20,833 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 135 transitions, 543 flow [2022-07-12 10:06:20,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:06:20,833 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:20,833 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, 1, 1, 1, 1] [2022-07-12 10:06:20,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:06:20,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash 751904358, now seen corresponding path program 2 times [2022-07-12 10:06:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:20,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686788247] [2022-07-12 10:06:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:20,993 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:06:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686788247] [2022-07-12 10:06:20,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686788247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:20,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:20,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:06:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55972804] [2022-07-12 10:06:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:20,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:06:20,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:20,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:06:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:06:20,999 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:06:21,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 135 transitions, 543 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 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:06:21,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:21,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:06:21,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:21,343 INFO L129 PetriNetUnfolder]: 342/910 cut-off events. [2022-07-12 10:06:21,343 INFO L130 PetriNetUnfolder]: For 6191/6317 co-relation queries the response was YES. [2022-07-12 10:06:21,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 910 events. 342/910 cut-off events. For 6191/6317 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4900 event pairs, 86 based on Foata normal form. 29/903 useless extension candidates. Maximal degree in co-relation 3923. Up to 316 conditions per place. [2022-07-12 10:06:21,355 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 39 selfloop transitions, 13 changer transitions 37/186 dead transitions. [2022-07-12 10:06:21,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 186 transitions, 1237 flow [2022-07-12 10:06:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:06:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:06:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1643 transitions. [2022-07-12 10:06:21,359 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8629201680672269 [2022-07-12 10:06:21,359 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1643 transitions. [2022-07-12 10:06:21,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1643 transitions. [2022-07-12 10:06:21,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:21,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1643 transitions. [2022-07-12 10:06:21,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.35714285714286) internal successors, (1643), 14 states have internal predecessors, (1643), 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:06:21,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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:06:21,366 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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:06:21,366 INFO L186 Difference]: Start difference. First operand has 165 places, 135 transitions, 543 flow. Second operand 14 states and 1643 transitions. [2022-07-12 10:06:21,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 186 transitions, 1237 flow [2022-07-12 10:06:21,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 186 transitions, 1155 flow, removed 34 selfloop flow, removed 8 redundant places. [2022-07-12 10:06:21,403 INFO L242 Difference]: Finished difference. Result has 174 places, 138 transitions, 603 flow [2022-07-12 10:06:21,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=603, PETRI_PLACES=174, PETRI_TRANSITIONS=138} [2022-07-12 10:06:21,404 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 31 predicate places. [2022-07-12 10:06:21,404 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 138 transitions, 603 flow [2022-07-12 10:06:21,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 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:06:21,405 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:21,405 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, 1, 1, 1, 1, 1] [2022-07-12 10:06:21,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:06:21,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash -101700170, now seen corresponding path program 1 times [2022-07-12 10:06:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:21,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037418447] [2022-07-12 10:06:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:21,609 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:06:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037418447] [2022-07-12 10:06:21,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037418447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:21,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:21,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:06:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71392188] [2022-07-12 10:06:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:21,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:06:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:06:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:06:21,612 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-07-12 10:06:21,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 138 transitions, 603 flow. Second operand has 13 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 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:06:21,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:21,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-07-12 10:06:21,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:21,974 INFO L129 PetriNetUnfolder]: 272/755 cut-off events. [2022-07-12 10:06:21,975 INFO L130 PetriNetUnfolder]: For 7819/8012 co-relation queries the response was YES. [2022-07-12 10:06:21,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3903 conditions, 755 events. 272/755 cut-off events. For 7819/8012 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3901 event pairs, 78 based on Foata normal form. 23/747 useless extension candidates. Maximal degree in co-relation 3802. Up to 299 conditions per place. [2022-07-12 10:06:21,985 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 39 selfloop transitions, 12 changer transitions 25/170 dead transitions. [2022-07-12 10:06:21,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 170 transitions, 1194 flow [2022-07-12 10:06:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:06:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:06:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1585 transitions. [2022-07-12 10:06:21,988 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8324579831932774 [2022-07-12 10:06:21,988 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1585 transitions. [2022-07-12 10:06:21,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1585 transitions. [2022-07-12 10:06:21,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:21,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1585 transitions. [2022-07-12 10:06:21,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.21428571428571) internal successors, (1585), 14 states have internal predecessors, (1585), 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:06:21,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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:06:21,994 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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:06:21,995 INFO L186 Difference]: Start difference. First operand has 174 places, 138 transitions, 603 flow. Second operand 14 states and 1585 transitions. [2022-07-12 10:06:21,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 170 transitions, 1194 flow [2022-07-12 10:06:22,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 170 transitions, 1129 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-07-12 10:06:22,007 INFO L242 Difference]: Finished difference. Result has 177 places, 138 transitions, 606 flow [2022-07-12 10:06:22,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=606, PETRI_PLACES=177, PETRI_TRANSITIONS=138} [2022-07-12 10:06:22,009 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 34 predicate places. [2022-07-12 10:06:22,009 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 138 transitions, 606 flow [2022-07-12 10:06:22,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 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:06:22,010 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:22,010 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, 1, 1, 1, 1, 1] [2022-07-12 10:06:22,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:06:22,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash -840106667, now seen corresponding path program 1 times [2022-07-12 10:06:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:22,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074965168] [2022-07-12 10:06:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:22,079 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:06:22,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:22,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074965168] [2022-07-12 10:06:22,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074965168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:22,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:22,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:06:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869018337] [2022-07-12 10:06:22,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:22,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:06:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:06:22,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:06:22,082 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:06:22,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 138 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:06:22,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:22,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:06:22,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:23,014 INFO L129 PetriNetUnfolder]: 3421/6140 cut-off events. [2022-07-12 10:06:23,014 INFO L130 PetriNetUnfolder]: For 53049/53676 co-relation queries the response was YES. [2022-07-12 10:06:23,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25513 conditions, 6140 events. 3421/6140 cut-off events. For 53049/53676 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 46295 event pairs, 106 based on Foata normal form. 298/6235 useless extension candidates. Maximal degree in co-relation 25412. Up to 2160 conditions per place. [2022-07-12 10:06:23,080 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 86 selfloop transitions, 8 changer transitions 76/269 dead transitions. [2022-07-12 10:06:23,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 269 transitions, 2054 flow [2022-07-12 10:06:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:06:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:06:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1192 transitions. [2022-07-12 10:06:23,084 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8764705882352941 [2022-07-12 10:06:23,084 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1192 transitions. [2022-07-12 10:06:23,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1192 transitions. [2022-07-12 10:06:23,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:23,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1192 transitions. [2022-07-12 10:06:23,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.2) internal successors, (1192), 10 states have internal predecessors, (1192), 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:06:23,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 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:06:23,089 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 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:06:23,089 INFO L186 Difference]: Start difference. First operand has 177 places, 138 transitions, 606 flow. Second operand 10 states and 1192 transitions. [2022-07-12 10:06:23,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 269 transitions, 2054 flow [2022-07-12 10:06:23,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 269 transitions, 1927 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-07-12 10:06:23,119 INFO L242 Difference]: Finished difference. Result has 171 places, 143 transitions, 637 flow [2022-07-12 10:06:23,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=637, PETRI_PLACES=171, PETRI_TRANSITIONS=143} [2022-07-12 10:06:23,120 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 28 predicate places. [2022-07-12 10:06:23,120 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 143 transitions, 637 flow [2022-07-12 10:06:23,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:06:23,120 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:23,121 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, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:06:23,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2032036940, now seen corresponding path program 1 times [2022-07-12 10:06:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:23,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805437121] [2022-07-12 10:06:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:23,197 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:06:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805437121] [2022-07-12 10:06:23,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805437121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:23,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:23,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906310061] [2022-07-12 10:06:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:23,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:23,200 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:06:23,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 143 transitions, 637 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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:06:23,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:23,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:06:23,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:23,956 INFO L129 PetriNetUnfolder]: 2034/4290 cut-off events. [2022-07-12 10:06:23,956 INFO L130 PetriNetUnfolder]: For 34217/34614 co-relation queries the response was YES. [2022-07-12 10:06:23,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19546 conditions, 4290 events. 2034/4290 cut-off events. For 34217/34614 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 34887 event pairs, 37 based on Foata normal form. 280/4508 useless extension candidates. Maximal degree in co-relation 19451. Up to 1268 conditions per place. [2022-07-12 10:06:23,996 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 138 selfloop transitions, 24 changer transitions 0/260 dead transitions. [2022-07-12 10:06:23,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 260 transitions, 2075 flow [2022-07-12 10:06:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:06:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:06:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1313 transitions. [2022-07-12 10:06:23,999 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8776737967914439 [2022-07-12 10:06:24,000 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1313 transitions. [2022-07-12 10:06:24,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1313 transitions. [2022-07-12 10:06:24,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:24,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1313 transitions. [2022-07-12 10:06:24,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.36363636363636) internal successors, (1313), 11 states have internal predecessors, (1313), 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:06:24,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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:06:24,005 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 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:06:24,005 INFO L186 Difference]: Start difference. First operand has 171 places, 143 transitions, 637 flow. Second operand 11 states and 1313 transitions. [2022-07-12 10:06:24,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 260 transitions, 2075 flow [2022-07-12 10:06:24,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 260 transitions, 2051 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-07-12 10:06:24,030 INFO L242 Difference]: Finished difference. Result has 179 places, 157 transitions, 839 flow [2022-07-12 10:06:24,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=839, PETRI_PLACES=179, PETRI_TRANSITIONS=157} [2022-07-12 10:06:24,030 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 36 predicate places. [2022-07-12 10:06:24,031 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 157 transitions, 839 flow [2022-07-12 10:06:24,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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:06:24,031 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:24,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:24,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:06:24,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -774597904, now seen corresponding path program 1 times [2022-07-12 10:06:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:24,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975409156] [2022-07-12 10:06:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:24,130 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:06:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:24,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975409156] [2022-07-12 10:06:24,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975409156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:24,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:24,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:06:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140111377] [2022-07-12 10:06:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:24,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:06:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:06:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:06:24,133 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:06:24,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 157 transitions, 839 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 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:06:24,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:24,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:06:24,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:24,962 INFO L129 PetriNetUnfolder]: 1787/3937 cut-off events. [2022-07-12 10:06:24,962 INFO L130 PetriNetUnfolder]: For 36715/37103 co-relation queries the response was YES. [2022-07-12 10:06:24,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20007 conditions, 3937 events. 1787/3937 cut-off events. For 36715/37103 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33162 event pairs, 34 based on Foata normal form. 241/4119 useless extension candidates. Maximal degree in co-relation 19907. Up to 1212 conditions per place. [2022-07-12 10:06:25,003 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 122 selfloop transitions, 42 changer transitions 21/283 dead transitions. [2022-07-12 10:06:25,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 283 transitions, 2629 flow [2022-07-12 10:06:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:06:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:06:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1673 transitions. [2022-07-12 10:06:25,007 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8786764705882353 [2022-07-12 10:06:25,007 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1673 transitions. [2022-07-12 10:06:25,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1673 transitions. [2022-07-12 10:06:25,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:25,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1673 transitions. [2022-07-12 10:06:25,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 119.5) internal successors, (1673), 14 states have internal predecessors, (1673), 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:06:25,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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:06:25,015 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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:06:25,015 INFO L186 Difference]: Start difference. First operand has 179 places, 157 transitions, 839 flow. Second operand 14 states and 1673 transitions. [2022-07-12 10:06:25,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 283 transitions, 2629 flow [2022-07-12 10:06:25,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 283 transitions, 2397 flow, removed 67 selfloop flow, removed 6 redundant places. [2022-07-12 10:06:25,087 INFO L242 Difference]: Finished difference. Result has 190 places, 176 transitions, 1104 flow [2022-07-12 10:06:25,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1104, PETRI_PLACES=190, PETRI_TRANSITIONS=176} [2022-07-12 10:06:25,088 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 47 predicate places. [2022-07-12 10:06:25,088 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 176 transitions, 1104 flow [2022-07-12 10:06:25,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 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:06:25,089 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:25,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:25,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:06:25,090 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash -388250500, now seen corresponding path program 1 times [2022-07-12 10:06:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:25,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305374523] [2022-07-12 10:06:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:25,183 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:06:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305374523] [2022-07-12 10:06:25,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305374523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:25,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:25,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:06:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872564344] [2022-07-12 10:06:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:25,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:06:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:06:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:06:25,186 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:06:25,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 176 transitions, 1104 flow. Second operand has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 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:06:25,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:25,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:06:25,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:26,008 INFO L129 PetriNetUnfolder]: 1732/3778 cut-off events. [2022-07-12 10:06:26,008 INFO L130 PetriNetUnfolder]: For 34032/34416 co-relation queries the response was YES. [2022-07-12 10:06:26,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18514 conditions, 3778 events. 1732/3778 cut-off events. For 34032/34416 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 31462 event pairs, 83 based on Foata normal form. 101/3813 useless extension candidates. Maximal degree in co-relation 18412. Up to 669 conditions per place. [2022-07-12 10:06:26,041 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 100 selfloop transitions, 45 changer transitions 42/285 dead transitions. [2022-07-12 10:06:26,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 285 transitions, 2512 flow [2022-07-12 10:06:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:06:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:06:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1992 transitions. [2022-07-12 10:06:26,044 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8615916955017301 [2022-07-12 10:06:26,044 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1992 transitions. [2022-07-12 10:06:26,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1992 transitions. [2022-07-12 10:06:26,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:26,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1992 transitions. [2022-07-12 10:06:26,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 117.17647058823529) internal successors, (1992), 17 states have internal predecessors, (1992), 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:06:26,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 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:06:26,050 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 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:06:26,050 INFO L186 Difference]: Start difference. First operand has 190 places, 176 transitions, 1104 flow. Second operand 17 states and 1992 transitions. [2022-07-12 10:06:26,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 285 transitions, 2512 flow [2022-07-12 10:06:26,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 285 transitions, 2036 flow, removed 204 selfloop flow, removed 15 redundant places. [2022-07-12 10:06:26,191 INFO L242 Difference]: Finished difference. Result has 198 places, 173 transitions, 862 flow [2022-07-12 10:06:26,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=862, PETRI_PLACES=198, PETRI_TRANSITIONS=173} [2022-07-12 10:06:26,192 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 55 predicate places. [2022-07-12 10:06:26,192 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 173 transitions, 862 flow [2022-07-12 10:06:26,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 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:06:26,192 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:26,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:06:26,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1177233281, now seen corresponding path program 1 times [2022-07-12 10:06:26,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:26,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008430590] [2022-07-12 10:06:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:26,283 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:06:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:26,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008430590] [2022-07-12 10:06:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008430590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:26,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:26,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388122031] [2022-07-12 10:06:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:26,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:26,285 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:06:26,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 173 transitions, 862 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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:06:26,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:26,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:06:26,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:26,756 INFO L129 PetriNetUnfolder]: 941/3713 cut-off events. [2022-07-12 10:06:26,756 INFO L130 PetriNetUnfolder]: For 8367/8919 co-relation queries the response was YES. [2022-07-12 10:06:26,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10926 conditions, 3713 events. 941/3713 cut-off events. For 8367/8919 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 41599 event pairs, 26 based on Foata normal form. 25/3502 useless extension candidates. Maximal degree in co-relation 10851. Up to 415 conditions per place. [2022-07-12 10:06:26,791 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 40 selfloop transitions, 1 changer transitions 22/208 dead transitions. [2022-07-12 10:06:26,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 208 transitions, 1238 flow [2022-07-12 10:06:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:06:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:06:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-07-12 10:06:26,793 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623949579831933 [2022-07-12 10:06:26,793 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-07-12 10:06:26,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-07-12 10:06:26,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:26,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-07-12 10:06:26,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 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:06:26,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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:06:26,795 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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:06:26,796 INFO L186 Difference]: Start difference. First operand has 198 places, 173 transitions, 862 flow. Second operand 7 states and 821 transitions. [2022-07-12 10:06:26,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 208 transitions, 1238 flow [2022-07-12 10:06:26,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 208 transitions, 1068 flow, removed 52 selfloop flow, removed 21 redundant places. [2022-07-12 10:06:26,854 INFO L242 Difference]: Finished difference. Result has 185 places, 173 transitions, 765 flow [2022-07-12 10:06:26,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=765, PETRI_PLACES=185, PETRI_TRANSITIONS=173} [2022-07-12 10:06:26,855 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 42 predicate places. [2022-07-12 10:06:26,855 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 173 transitions, 765 flow [2022-07-12 10:06:26,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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:06:26,856 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:26,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:26,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:06:26,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -886635791, now seen corresponding path program 2 times [2022-07-12 10:06:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:26,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295107068] [2022-07-12 10:06:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:26,954 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:06:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:26,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295107068] [2022-07-12 10:06:26,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295107068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:26,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:26,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122927724] [2022-07-12 10:06:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:26,957 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:06:26,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 173 transitions, 765 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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:06:26,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:26,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:06:26,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:27,452 INFO L129 PetriNetUnfolder]: 1127/4586 cut-off events. [2022-07-12 10:06:27,452 INFO L130 PetriNetUnfolder]: For 4850/5075 co-relation queries the response was YES. [2022-07-12 10:06:27,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11308 conditions, 4586 events. 1127/4586 cut-off events. For 4850/5075 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 52920 event pairs, 46 based on Foata normal form. 29/4306 useless extension candidates. Maximal degree in co-relation 11277. Up to 503 conditions per place. [2022-07-12 10:06:27,530 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 35 selfloop transitions, 1 changer transitions 23/204 dead transitions. [2022-07-12 10:06:27,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 204 transitions, 1060 flow [2022-07-12 10:06:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:06:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:06:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-07-12 10:06:27,532 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623949579831933 [2022-07-12 10:06:27,532 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-07-12 10:06:27,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-07-12 10:06:27,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:27,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-07-12 10:06:27,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 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:06:27,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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:06:27,535 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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:06:27,535 INFO L186 Difference]: Start difference. First operand has 185 places, 173 transitions, 765 flow. Second operand 7 states and 821 transitions. [2022-07-12 10:06:27,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 204 transitions, 1060 flow [2022-07-12 10:06:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 204 transitions, 1045 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-12 10:06:27,597 INFO L242 Difference]: Finished difference. Result has 187 places, 173 transitions, 769 flow [2022-07-12 10:06:27,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=769, PETRI_PLACES=187, PETRI_TRANSITIONS=173} [2022-07-12 10:06:27,599 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 44 predicate places. [2022-07-12 10:06:27,599 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 173 transitions, 769 flow [2022-07-12 10:06:27,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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:06:27,599 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:27,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:06:27,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 581719993, now seen corresponding path program 3 times [2022-07-12 10:06:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:27,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916368981] [2022-07-12 10:06:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:27,672 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:06:27,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916368981] [2022-07-12 10:06:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916368981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:27,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:27,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:06:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627487172] [2022-07-12 10:06:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:27,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:06:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:27,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:06:27,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:06:27,674 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:06:27,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 173 transitions, 769 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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:06:27,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:27,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:06:27,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:28,069 INFO L129 PetriNetUnfolder]: 1021/3924 cut-off events. [2022-07-12 10:06:28,069 INFO L130 PetriNetUnfolder]: For 4424/4644 co-relation queries the response was YES. [2022-07-12 10:06:28,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10138 conditions, 3924 events. 1021/3924 cut-off events. For 4424/4644 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 43758 event pairs, 34 based on Foata normal form. 16/3656 useless extension candidates. Maximal degree in co-relation 10106. Up to 410 conditions per place. [2022-07-12 10:06:28,100 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 21 selfloop transitions, 2 changer transitions 22/185 dead transitions. [2022-07-12 10:06:28,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 185 transitions, 909 flow [2022-07-12 10:06:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:06:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-12 10:06:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2022-07-12 10:06:28,102 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8615196078431373 [2022-07-12 10:06:28,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 703 transitions. [2022-07-12 10:06:28,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions. [2022-07-12 10:06:28,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:28,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions. [2022-07-12 10:06:28,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 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:06:28,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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:06:28,105 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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:06:28,105 INFO L186 Difference]: Start difference. First operand has 187 places, 173 transitions, 769 flow. Second operand 6 states and 703 transitions. [2022-07-12 10:06:28,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 185 transitions, 909 flow [2022-07-12 10:06:28,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 185 transitions, 894 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-12 10:06:28,164 INFO L242 Difference]: Finished difference. Result has 187 places, 161 transitions, 699 flow [2022-07-12 10:06:28,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=699, PETRI_PLACES=187, PETRI_TRANSITIONS=161} [2022-07-12 10:06:28,164 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 44 predicate places. [2022-07-12 10:06:28,165 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 161 transitions, 699 flow [2022-07-12 10:06:28,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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:06:28,165 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:28,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:06:28,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:06:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -386462865, now seen corresponding path program 4 times [2022-07-12 10:06:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825212829] [2022-07-12 10:06:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:06:28,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:06:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:06:28,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:06:28,289 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:06:28,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-12 10:06:28,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-12 10:06:28,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-12 10:06:28,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-12 10:06:28,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-12 10:06:28,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-12 10:06:28,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-12 10:06:28,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 10:06:28,292 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:28,297 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:06:28,297 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:06:28,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:06:28 BasicIcfg [2022-07-12 10:06:28,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:06:28,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:06:28,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:06:28,421 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:06:28,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:06:17" (3/4) ... [2022-07-12 10:06:28,423 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:06:28,508 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:06:28,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:06:28,509 INFO L158 Benchmark]: Toolchain (without parser) took 12631.71ms. Allocated memory was 94.4MB in the beginning and 864.0MB in the end (delta: 769.7MB). Free memory was 59.3MB in the beginning and 222.6MB in the end (delta: -163.3MB). Peak memory consumption was 605.2MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,511 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:06:28,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.35ms. Allocated memory is still 94.4MB. Free memory was 59.1MB in the beginning and 56.7MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.98ms. Allocated memory is still 94.4MB. Free memory was 56.7MB in the beginning and 53.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,512 INFO L158 Benchmark]: Boogie Preprocessor took 59.65ms. Allocated memory is still 94.4MB. Free memory was 53.6MB in the beginning and 51.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,512 INFO L158 Benchmark]: RCFGBuilder took 884.36ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 51.1MB in the beginning and 87.2MB in the end (delta: -36.1MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,512 INFO L158 Benchmark]: TraceAbstraction took 11045.13ms. Allocated memory was 125.8MB in the beginning and 864.0MB in the end (delta: 738.2MB). Free memory was 87.2MB in the beginning and 260.4MB in the end (delta: -173.2MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,512 INFO L158 Benchmark]: Witness Printer took 87.76ms. Allocated memory is still 864.0MB. Free memory was 260.4MB in the beginning and 222.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-12 10:06:28,514 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 94.4MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.35ms. Allocated memory is still 94.4MB. Free memory was 59.1MB in the beginning and 56.7MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.98ms. Allocated memory is still 94.4MB. Free memory was 56.7MB in the beginning and 53.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.65ms. Allocated memory is still 94.4MB. Free memory was 53.6MB in the beginning and 51.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 884.36ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 51.1MB in the beginning and 87.2MB in the end (delta: -36.1MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11045.13ms. Allocated memory was 125.8MB in the beginning and 864.0MB in the end (delta: 738.2MB). Free memory was 87.2MB in the beginning and 260.4MB in the end (delta: -173.2MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. * Witness Printer took 87.76ms. Allocated memory is still 864.0MB. Free memory was 260.4MB in the beginning and 222.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t773; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-3, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t776; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 853]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 825 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 562 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1242 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2006 IncrementalHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 113 mSDtfsCounter, 2006 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1104occurred in iteration=11, InterpolantAutomatonStates: 160, 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.4s InterpolantComputationTime, 1488 NumberOfCodeBlocks, 1488 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1368 ConstructedInterpolants, 0 QuantifiedInterpolants, 5982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:06:28,552 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