./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:06:08,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:06:08,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:06:08,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:06:08,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:06:08,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:06:08,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:06:08,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:06:08,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:06:08,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:06:08,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:06:08,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:06:08,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:06:08,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:06:08,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:06:08,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:06:08,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:06:08,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:06:08,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:06:08,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:06:08,568 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:06:08,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:06:08,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:06:08,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:06:08,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:06:08,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:06:08,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:06:08,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:06:08,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:06:08,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:06:08,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:06:08,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:06:08,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:06:08,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:06:08,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:06:08,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:06:08,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:06:08,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:06:08,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:06:08,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:06:08,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:06:08,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:06:08,587 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:08,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:06:08,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:06:08,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:06:08,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:06:08,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:06:08,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:06:08,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:06:08,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:06:08,625 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:06:08,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:06:08,626 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:06:08,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:06:08,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:06:08,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:06:08,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:06:08,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:06:08,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:06:08,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:06:08,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:06:08,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:06:08,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:06:08,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:06:08,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:06:08,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:06:08,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:06:08,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:06:08,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:06:08,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:06:08,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:06:08,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:06:08,630 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:06:08,630 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:06:08,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:06:08,631 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 -> d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 [2022-07-12 10:06:08,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:06:08,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:06:08,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:06:08,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:06:08,861 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:06:08,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:06:08,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985293a6f/1dfda062f66f45fbaccdeba73d7e9eac/FLAGf9258759c [2022-07-12 10:06:09,379 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:06:09,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:06:09,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985293a6f/1dfda062f66f45fbaccdeba73d7e9eac/FLAGf9258759c [2022-07-12 10:06:09,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985293a6f/1dfda062f66f45fbaccdeba73d7e9eac [2022-07-12 10:06:09,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:06:09,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:06:09,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:06:09,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:06:09,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:06:09,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:06:09" (1/1) ... [2022-07-12 10:06:09,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bb8fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:09, skipping insertion in model container [2022-07-12 10:06:09,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:06:09" (1/1) ... [2022-07-12 10:06:09,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:06:09,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:06:10,112 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-07-12 10:06:10,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:06:10,302 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:06:10,317 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/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-07-12 10:06:10,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:06:10,393 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:06:10,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:10 WrapperNode [2022-07-12 10:06:10,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:06:10,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:06:10,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:06:10,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:06:10,401 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:10" (1/1) ... [2022-07-12 10:06:10,435 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:10" (1/1) ... [2022-07-12 10:06:10,465 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-07-12 10:06:10,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:06:10,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:06:10,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:06:10,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:06:10,475 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:10" (1/1) ... [2022-07-12 10:06:10,475 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:10" (1/1) ... [2022-07-12 10:06:10,491 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:10" (1/1) ... [2022-07-12 10:06:10,495 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:10" (1/1) ... [2022-07-12 10:06:10,502 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:10" (1/1) ... [2022-07-12 10:06:10,518 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:10" (1/1) ... [2022-07-12 10:06:10,520 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:10" (1/1) ... [2022-07-12 10:06:10,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:06:10,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:06:10,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:06:10,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:06:10,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:10" (1/1) ... [2022-07-12 10:06:10,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:06:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:06:10,568 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:10,589 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:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:06:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:06:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:06:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:06:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:06:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:06:10,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:06:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:06:10,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:06:10,611 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:06:10,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:06:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:06:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:06:10,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:06:10,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:06:10,614 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:10,750 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:06:10,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:06:11,183 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:06:11,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:06:11,493 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:06:11,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:06:11 BoogieIcfgContainer [2022-07-12 10:06:11,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:06:11,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:06:11,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:06:11,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:06:11,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:06:09" (1/3) ... [2022-07-12 10:06:11,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a70a08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:06:11, skipping insertion in model container [2022-07-12 10:06:11,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:06:10" (2/3) ... [2022-07-12 10:06:11,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a70a08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:06:11, skipping insertion in model container [2022-07-12 10:06:11,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:06:11" (3/3) ... [2022-07-12 10:06:11,501 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-07-12 10:06:11,505 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:06:11,513 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:06:11,513 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:06:11,513 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:06:11,573 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:06:11,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-07-12 10:06:11,671 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2022-07-12 10:06:11,672 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:06:11,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-12 10:06:11,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-07-12 10:06:11,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-07-12 10:06:11,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:06:11,700 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@67f4b578, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62f1bcc9 [2022-07-12 10:06:11,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:06:11,711 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2022-07-12 10:06:11,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:06:11,711 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:11,712 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] [2022-07-12 10:06:11,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1707045004, now seen corresponding path program 1 times [2022-07-12 10:06:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:11,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362303422] [2022-07-12 10:06:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:12,040 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:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362303422] [2022-07-12 10:06:12,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362303422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:12,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:06:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265033727] [2022-07-12 10:06:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:12,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:06:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:06:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:06:12,083 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2022-07-12 10:06:12,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:12,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:12,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2022-07-12 10:06:12,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:12,241 INFO L129 PetriNetUnfolder]: 58/277 cut-off events. [2022-07-12 10:06:12,242 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-12 10:06:12,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 277 events. 58/277 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1117 event pairs, 10 based on Foata normal form. 20/279 useless extension candidates. Maximal degree in co-relation 354. Up to 79 conditions per place. [2022-07-12 10:06:12,248 INFO L132 encePairwiseOnDemand]: 111/116 looper letters, 14 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-07-12 10:06:12,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 115 transitions, 277 flow [2022-07-12 10:06:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:06:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:06:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-07-12 10:06:12,269 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9396551724137931 [2022-07-12 10:06:12,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-07-12 10:06:12,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-07-12 10:06:12,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:12,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-07-12 10:06:12,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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:12,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:12,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:12,289 INFO L186 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 327 transitions. [2022-07-12 10:06:12,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 115 transitions, 277 flow [2022-07-12 10:06:12,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:06:12,297 INFO L242 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2022-07-12 10:06:12,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2022-07-12 10:06:12,304 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2022-07-12 10:06:12,304 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2022-07-12 10:06:12,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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:12,304 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:12,305 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] [2022-07-12 10:06:12,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:06:12,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash -499311708, now seen corresponding path program 1 times [2022-07-12 10:06:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:12,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726722804] [2022-07-12 10:06:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:12,605 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:12,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:12,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726722804] [2022-07-12 10:06:12,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726722804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:12,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:12,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:06:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766934531] [2022-07-12 10:06:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:12,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:06:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:06:12,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:06:12,614 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-07-12 10:06:12,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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:12,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:12,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-07-12 10:06:12,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:14,086 INFO L129 PetriNetUnfolder]: 3466/8463 cut-off events. [2022-07-12 10:06:14,087 INFO L130 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-07-12 10:06:14,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14035 conditions, 8463 events. 3466/8463 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 79046 event pairs, 687 based on Foata normal form. 0/8202 useless extension candidates. Maximal degree in co-relation 13980. Up to 1785 conditions per place. [2022-07-12 10:06:14,131 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 31 selfloop transitions, 9 changer transitions 82/195 dead transitions. [2022-07-12 10:06:14,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 195 transitions, 638 flow [2022-07-12 10:06:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:06:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:06:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2022-07-12 10:06:14,136 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8582375478927203 [2022-07-12 10:06:14,136 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2022-07-12 10:06:14,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2022-07-12 10:06:14,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:14,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2022-07-12 10:06:14,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 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:14,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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:14,143 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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:14,143 INFO L186 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 896 transitions. [2022-07-12 10:06:14,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 195 transitions, 638 flow [2022-07-12 10:06:14,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 195 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:06:14,148 INFO L242 Difference]: Finished difference. Result has 132 places, 103 transitions, 310 flow [2022-07-12 10:06:14,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=310, PETRI_PLACES=132, PETRI_TRANSITIONS=103} [2022-07-12 10:06:14,150 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 11 predicate places. [2022-07-12 10:06:14,150 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 103 transitions, 310 flow [2022-07-12 10:06:14,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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:14,150 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:14,151 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:14,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:06:14,151 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:14,152 INFO L85 PathProgramCache]: Analyzing trace with hash 763635269, now seen corresponding path program 1 times [2022-07-12 10:06:14,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:14,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498323834] [2022-07-12 10:06:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:14,289 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:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:14,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498323834] [2022-07-12 10:06:14,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498323834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:14,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:14,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657662723] [2022-07-12 10:06:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:14,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:14,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:14,297 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-07-12 10:06:14,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 103 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 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:14,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:14,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-07-12 10:06:14,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:15,298 INFO L129 PetriNetUnfolder]: 2329/4585 cut-off events. [2022-07-12 10:06:15,299 INFO L130 PetriNetUnfolder]: For 6993/6993 co-relation queries the response was YES. [2022-07-12 10:06:15,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13241 conditions, 4585 events. 2329/4585 cut-off events. For 6993/6993 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 33710 event pairs, 317 based on Foata normal form. 126/4599 useless extension candidates. Maximal degree in co-relation 13174. Up to 1031 conditions per place. [2022-07-12 10:06:15,329 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 42 selfloop transitions, 7 changer transitions 97/219 dead transitions. [2022-07-12 10:06:15,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 219 transitions, 1232 flow [2022-07-12 10:06:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:06:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:06:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1260 transitions. [2022-07-12 10:06:15,333 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8355437665782494 [2022-07-12 10:06:15,333 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1260 transitions. [2022-07-12 10:06:15,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1260 transitions. [2022-07-12 10:06:15,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:15,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1260 transitions. [2022-07-12 10:06:15,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.92307692307692) internal successors, (1260), 13 states have internal predecessors, (1260), 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:15,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:15,343 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:15,343 INFO L186 Difference]: Start difference. First operand has 132 places, 103 transitions, 310 flow. Second operand 13 states and 1260 transitions. [2022-07-12 10:06:15,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 219 transitions, 1232 flow [2022-07-12 10:06:15,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 219 transitions, 1146 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-07-12 10:06:15,363 INFO L242 Difference]: Finished difference. Result has 136 places, 106 transitions, 374 flow [2022-07-12 10:06:15,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=374, PETRI_PLACES=136, PETRI_TRANSITIONS=106} [2022-07-12 10:06:15,366 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2022-07-12 10:06:15,366 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 106 transitions, 374 flow [2022-07-12 10:06:15,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 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:15,366 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:15,367 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:15,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:06:15,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 141854691, now seen corresponding path program 1 times [2022-07-12 10:06:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961181525] [2022-07-12 10:06:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:15,546 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:15,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:15,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961181525] [2022-07-12 10:06:15,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961181525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:15,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:15,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:15,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450186669] [2022-07-12 10:06:15,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:15,553 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-07-12 10:06:15,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 106 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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:15,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:15,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-07-12 10:06:15,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:16,390 INFO L129 PetriNetUnfolder]: 1728/3414 cut-off events. [2022-07-12 10:06:16,390 INFO L130 PetriNetUnfolder]: For 10450/10450 co-relation queries the response was YES. [2022-07-12 10:06:16,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11357 conditions, 3414 events. 1728/3414 cut-off events. For 10450/10450 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23786 event pairs, 289 based on Foata normal form. 74/3379 useless extension candidates. Maximal degree in co-relation 11280. Up to 980 conditions per place. [2022-07-12 10:06:16,421 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 39 selfloop transitions, 17 changer transitions 73/202 dead transitions. [2022-07-12 10:06:16,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 202 transitions, 1222 flow [2022-07-12 10:06:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:06:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:06:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1257 transitions. [2022-07-12 10:06:16,425 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.833554376657825 [2022-07-12 10:06:16,425 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1257 transitions. [2022-07-12 10:06:16,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1257 transitions. [2022-07-12 10:06:16,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:16,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1257 transitions. [2022-07-12 10:06:16,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.6923076923077) internal successors, (1257), 13 states have internal predecessors, (1257), 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:16,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:16,432 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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:16,433 INFO L186 Difference]: Start difference. First operand has 136 places, 106 transitions, 374 flow. Second operand 13 states and 1257 transitions. [2022-07-12 10:06:16,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 202 transitions, 1222 flow [2022-07-12 10:06:16,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 202 transitions, 1142 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-07-12 10:06:16,461 INFO L242 Difference]: Finished difference. Result has 146 places, 112 transitions, 491 flow [2022-07-12 10:06:16,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=491, PETRI_PLACES=146, PETRI_TRANSITIONS=112} [2022-07-12 10:06:16,462 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 25 predicate places. [2022-07-12 10:06:16,462 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 112 transitions, 491 flow [2022-07-12 10:06:16,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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:16,462 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:16,463 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:16,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:06:16,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 402927704, now seen corresponding path program 1 times [2022-07-12 10:06:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:16,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748133650] [2022-07-12 10:06:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:16,550 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:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:16,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748133650] [2022-07-12 10:06:16,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748133650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:16,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:16,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:06:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026566247] [2022-07-12 10:06:16,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:16,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:06:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:16,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:06:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:06:16,553 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-07-12 10:06:16,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 112 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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:16,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:16,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-07-12 10:06:16,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:17,555 INFO L129 PetriNetUnfolder]: 2758/5760 cut-off events. [2022-07-12 10:06:17,556 INFO L130 PetriNetUnfolder]: For 7255/8317 co-relation queries the response was YES. [2022-07-12 10:06:17,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13898 conditions, 5760 events. 2758/5760 cut-off events. For 7255/8317 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47440 event pairs, 168 based on Foata normal form. 35/5515 useless extension candidates. Maximal degree in co-relation 13812. Up to 1472 conditions per place. [2022-07-12 10:06:17,614 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 78 selfloop transitions, 17 changer transitions 0/186 dead transitions. [2022-07-12 10:06:17,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 186 transitions, 952 flow [2022-07-12 10:06:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:06:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:06:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1009 transitions. [2022-07-12 10:06:17,618 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8698275862068966 [2022-07-12 10:06:17,618 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1009 transitions. [2022-07-12 10:06:17,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1009 transitions. [2022-07-12 10:06:17,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:17,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1009 transitions. [2022-07-12 10:06:17,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.9) internal successors, (1009), 10 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:17,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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,624 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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,624 INFO L186 Difference]: Start difference. First operand has 146 places, 112 transitions, 491 flow. Second operand 10 states and 1009 transitions. [2022-07-12 10:06:17,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 186 transitions, 952 flow [2022-07-12 10:06:17,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 186 transitions, 890 flow, removed 31 selfloop flow, removed 15 redundant places. [2022-07-12 10:06:17,637 INFO L242 Difference]: Finished difference. Result has 137 places, 127 transitions, 549 flow [2022-07-12 10:06:17,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2022-07-12 10:06:17,638 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 16 predicate places. [2022-07-12 10:06:17,638 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 549 flow [2022-07-12 10:06:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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,638 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:17,639 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] [2022-07-12 10:06:17,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:06:17,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1824256948, now seen corresponding path program 1 times [2022-07-12 10:06:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296663745] [2022-07-12 10:06:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:17,767 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,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:17,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296663745] [2022-07-12 10:06:17,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296663745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:17,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:17,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:17,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28751317] [2022-07-12 10:06:17,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:17,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:17,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:17,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:17,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:17,770 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2022-07-12 10:06:17,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:17,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2022-07-12 10:06:17,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:18,644 INFO L129 PetriNetUnfolder]: 1393/4406 cut-off events. [2022-07-12 10:06:18,644 INFO L130 PetriNetUnfolder]: For 7004/7341 co-relation queries the response was YES. [2022-07-12 10:06:18,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12311 conditions, 4406 events. 1393/4406 cut-off events. For 7004/7341 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 43915 event pairs, 247 based on Foata normal form. 114/4283 useless extension candidates. Maximal degree in co-relation 12228. Up to 623 conditions per place. [2022-07-12 10:06:18,685 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 68 selfloop transitions, 32 changer transitions 24/212 dead transitions. [2022-07-12 10:06:18,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 212 transitions, 1270 flow [2022-07-12 10:06:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:06:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:06:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1243 transitions. [2022-07-12 10:06:18,690 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8242705570291777 [2022-07-12 10:06:18,690 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1243 transitions. [2022-07-12 10:06:18,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1243 transitions. [2022-07-12 10:06:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:18,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1243 transitions. [2022-07-12 10:06:18,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.61538461538461) internal successors, (1243), 13 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:06:18,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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,697 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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,697 INFO L186 Difference]: Start difference. First operand has 137 places, 127 transitions, 549 flow. Second operand 13 states and 1243 transitions. [2022-07-12 10:06:18,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 212 transitions, 1270 flow [2022-07-12 10:06:18,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 212 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:06:18,723 INFO L242 Difference]: Finished difference. Result has 160 places, 145 transitions, 878 flow [2022-07-12 10:06:18,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=878, PETRI_PLACES=160, PETRI_TRANSITIONS=145} [2022-07-12 10:06:18,723 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 39 predicate places. [2022-07-12 10:06:18,724 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 145 transitions, 878 flow [2022-07-12 10:06:18,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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,724 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:18,724 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] [2022-07-12 10:06:18,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:06:18,725 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1579808176, now seen corresponding path program 1 times [2022-07-12 10:06:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:18,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474929122] [2022-07-12 10:06:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:18,836 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,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:18,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474929122] [2022-07-12 10:06:18,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474929122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:18,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:18,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381911367] [2022-07-12 10:06:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:18,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:18,848 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2022-07-12 10:06:18,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 145 transitions, 878 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:18,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2022-07-12 10:06:18,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:19,964 INFO L129 PetriNetUnfolder]: 2155/7344 cut-off events. [2022-07-12 10:06:19,964 INFO L130 PetriNetUnfolder]: For 18310/18924 co-relation queries the response was YES. [2022-07-12 10:06:19,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21281 conditions, 7344 events. 2155/7344 cut-off events. For 18310/18924 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 84520 event pairs, 633 based on Foata normal form. 174/7076 useless extension candidates. Maximal degree in co-relation 21183. Up to 1114 conditions per place. [2022-07-12 10:06:20,017 INFO L132 encePairwiseOnDemand]: 109/116 looper letters, 60 selfloop transitions, 16 changer transitions 31/211 dead transitions. [2022-07-12 10:06:20,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 211 transitions, 1514 flow [2022-07-12 10:06:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:06:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:06:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 986 transitions. [2022-07-12 10:06:20,021 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.85 [2022-07-12 10:06:20,021 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 986 transitions. [2022-07-12 10:06:20,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 986 transitions. [2022-07-12 10:06:20,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:20,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 986 transitions. [2022-07-12 10:06:20,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.6) internal successors, (986), 10 states have internal predecessors, (986), 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,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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,027 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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,027 INFO L186 Difference]: Start difference. First operand has 160 places, 145 transitions, 878 flow. Second operand 10 states and 986 transitions. [2022-07-12 10:06:20,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 211 transitions, 1514 flow [2022-07-12 10:06:20,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 211 transitions, 1468 flow, removed 23 selfloop flow, removed 0 redundant places. [2022-07-12 10:06:20,100 INFO L242 Difference]: Finished difference. Result has 177 places, 151 transitions, 991 flow [2022-07-12 10:06:20,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=991, PETRI_PLACES=177, PETRI_TRANSITIONS=151} [2022-07-12 10:06:20,101 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 56 predicate places. [2022-07-12 10:06:20,101 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 151 transitions, 991 flow [2022-07-12 10:06:20,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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,102 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:20,102 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] [2022-07-12 10:06:20,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:06:20,102 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1752420248, now seen corresponding path program 2 times [2022-07-12 10:06:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:20,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296397485] [2022-07-12 10:06:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:20,217 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,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296397485] [2022-07-12 10:06:20,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296397485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:20,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:20,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:06:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589814598] [2022-07-12 10:06:20,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:20,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:06:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:06:20,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:06:20,223 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-07-12 10:06:20,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 151 transitions, 991 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 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,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:20,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-07-12 10:06:20,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:22,572 INFO L129 PetriNetUnfolder]: 7507/15500 cut-off events. [2022-07-12 10:06:22,573 INFO L130 PetriNetUnfolder]: For 36278/38832 co-relation queries the response was YES. [2022-07-12 10:06:22,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48581 conditions, 15500 events. 7507/15500 cut-off events. For 36278/38832 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 153229 event pairs, 441 based on Foata normal form. 377/15544 useless extension candidates. Maximal degree in co-relation 48475. Up to 2816 conditions per place. [2022-07-12 10:06:22,666 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 67 selfloop transitions, 28 changer transitions 69/259 dead transitions. [2022-07-12 10:06:22,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 259 transitions, 2037 flow [2022-07-12 10:06:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:06:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:06:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1315 transitions. [2022-07-12 10:06:22,670 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8720159151193634 [2022-07-12 10:06:22,671 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1315 transitions. [2022-07-12 10:06:22,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1315 transitions. [2022-07-12 10:06:22,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:22,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1315 transitions. [2022-07-12 10:06:22,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.15384615384616) internal successors, (1315), 13 states have internal predecessors, (1315), 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,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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,677 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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,677 INFO L186 Difference]: Start difference. First operand has 177 places, 151 transitions, 991 flow. Second operand 13 states and 1315 transitions. [2022-07-12 10:06:22,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 259 transitions, 2037 flow [2022-07-12 10:06:22,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 259 transitions, 1979 flow, removed 29 selfloop flow, removed 0 redundant places. [2022-07-12 10:06:22,848 INFO L242 Difference]: Finished difference. Result has 195 places, 146 transitions, 931 flow [2022-07-12 10:06:22,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=931, PETRI_PLACES=195, PETRI_TRANSITIONS=146} [2022-07-12 10:06:22,851 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 74 predicate places. [2022-07-12 10:06:22,851 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 146 transitions, 931 flow [2022-07-12 10:06:22,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 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,852 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:22,852 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:22,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:06:22,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1076632256, now seen corresponding path program 1 times [2022-07-12 10:06:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:22,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813656223] [2022-07-12 10:06:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:23,093 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,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:23,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813656223] [2022-07-12 10:06:23,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813656223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:23,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:23,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:06:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079700373] [2022-07-12 10:06:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:23,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:06:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:23,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:06:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:06:23,097 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2022-07-12 10:06:23,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 146 transitions, 931 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:23,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2022-07-12 10:06:23,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:25,152 INFO L129 PetriNetUnfolder]: 5702/12550 cut-off events. [2022-07-12 10:06:25,152 INFO L130 PetriNetUnfolder]: For 40248/42353 co-relation queries the response was YES. [2022-07-12 10:06:25,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44328 conditions, 12550 events. 5702/12550 cut-off events. For 40248/42353 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 129783 event pairs, 385 based on Foata normal form. 190/12421 useless extension candidates. Maximal degree in co-relation 44272. Up to 1924 conditions per place. [2022-07-12 10:06:25,226 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 28 selfloop transitions, 14 changer transitions 89/223 dead transitions. [2022-07-12 10:06:25,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 223 transitions, 1677 flow [2022-07-12 10:06:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:06:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:06:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1576 transitions. [2022-07-12 10:06:25,231 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8491379310344828 [2022-07-12 10:06:25,231 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1576 transitions. [2022-07-12 10:06:25,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1576 transitions. [2022-07-12 10:06:25,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:25,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1576 transitions. [2022-07-12 10:06:25,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.5) internal successors, (1576), 16 states have internal predecessors, (1576), 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,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 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,239 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 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,239 INFO L186 Difference]: Start difference. First operand has 195 places, 146 transitions, 931 flow. Second operand 16 states and 1576 transitions. [2022-07-12 10:06:25,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 223 transitions, 1677 flow [2022-07-12 10:06:25,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 223 transitions, 1498 flow, removed 80 selfloop flow, removed 24 redundant places. [2022-07-12 10:06:25,862 INFO L242 Difference]: Finished difference. Result has 177 places, 122 transitions, 661 flow [2022-07-12 10:06:25,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=661, PETRI_PLACES=177, PETRI_TRANSITIONS=122} [2022-07-12 10:06:25,863 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 56 predicate places. [2022-07-12 10:06:25,864 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 122 transitions, 661 flow [2022-07-12 10:06:25,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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,864 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:25,864 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:25,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:06:25,865 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1507932727, now seen corresponding path program 1 times [2022-07-12 10:06:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:25,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377756281] [2022-07-12 10:06:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:26,204 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,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:26,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377756281] [2022-07-12 10:06:26,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377756281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:26,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:26,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:06:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852055530] [2022-07-12 10:06:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:26,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:06:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:06:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:06:26,209 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2022-07-12 10:06:26,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 122 transitions, 661 flow. Second operand has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 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,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:26,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2022-07-12 10:06:26,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:26,588 INFO L129 PetriNetUnfolder]: 380/2705 cut-off events. [2022-07-12 10:06:26,588 INFO L130 PetriNetUnfolder]: For 7167/7467 co-relation queries the response was YES. [2022-07-12 10:06:26,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7949 conditions, 2705 events. 380/2705 cut-off events. For 7167/7467 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 32945 event pairs, 16 based on Foata normal form. 6/2533 useless extension candidates. Maximal degree in co-relation 7841. Up to 550 conditions per place. [2022-07-12 10:06:26,604 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 26 selfloop transitions, 5 changer transitions 23/143 dead transitions. [2022-07-12 10:06:26,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 143 transitions, 819 flow [2022-07-12 10:06:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:06:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:06:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2022-07-12 10:06:26,606 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8051724137931034 [2022-07-12 10:06:26,607 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2022-07-12 10:06:26,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2022-07-12 10:06:26,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:26,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2022-07-12 10:06:26,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 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,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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,611 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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,612 INFO L186 Difference]: Start difference. First operand has 177 places, 122 transitions, 661 flow. Second operand 10 states and 934 transitions. [2022-07-12 10:06:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 143 transitions, 819 flow [2022-07-12 10:06:26,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 143 transitions, 693 flow, removed 39 selfloop flow, removed 23 redundant places. [2022-07-12 10:06:26,676 INFO L242 Difference]: Finished difference. Result has 156 places, 113 transitions, 443 flow [2022-07-12 10:06:26,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=443, PETRI_PLACES=156, PETRI_TRANSITIONS=113} [2022-07-12 10:06:26,677 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 35 predicate places. [2022-07-12 10:06:26,677 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 113 transitions, 443 flow [2022-07-12 10:06:26,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 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,678 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:26,678 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:26,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:06:26,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -784448599, now seen corresponding path program 2 times [2022-07-12 10:06:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:26,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9309477] [2022-07-12 10:06:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:06:26,892 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,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:06:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9309477] [2022-07-12 10:06:26,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9309477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:06:26,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:06:26,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:06:26,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164683084] [2022-07-12 10:06:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:06:26,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:06:26,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:06:26,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:06:26,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:06:26,896 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 116 [2022-07-12 10:06:26,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 113 transitions, 443 flow. Second operand has 11 states, 11 states have (on average 81.9090909090909) internal successors, (901), 11 states have internal predecessors, (901), 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,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:06:26,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 116 [2022-07-12 10:06:26,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:06:27,208 INFO L129 PetriNetUnfolder]: 112/671 cut-off events. [2022-07-12 10:06:27,209 INFO L130 PetriNetUnfolder]: For 614/626 co-relation queries the response was YES. [2022-07-12 10:06:27,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 671 events. 112/671 cut-off events. For 614/626 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4701 event pairs, 4 based on Foata normal form. 1/630 useless extension candidates. Maximal degree in co-relation 1622. Up to 70 conditions per place. [2022-07-12 10:06:27,212 INFO L132 encePairwiseOnDemand]: 99/116 looper letters, 27 selfloop transitions, 12 changer transitions 30/144 dead transitions. [2022-07-12 10:06:27,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 144 transitions, 781 flow [2022-07-12 10:06:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:06:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:06:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1093 transitions. [2022-07-12 10:06:27,214 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7248010610079576 [2022-07-12 10:06:27,214 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1093 transitions. [2022-07-12 10:06:27,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1093 transitions. [2022-07-12 10:06:27,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:06:27,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1093 transitions. [2022-07-12 10:06:27,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 84.07692307692308) internal successors, (1093), 13 states have internal predecessors, (1093), 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,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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,220 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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,220 INFO L186 Difference]: Start difference. First operand has 156 places, 113 transitions, 443 flow. Second operand 13 states and 1093 transitions. [2022-07-12 10:06:27,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 144 transitions, 781 flow [2022-07-12 10:06:27,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 144 transitions, 625 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-07-12 10:06:27,225 INFO L242 Difference]: Finished difference. Result has 148 places, 109 transitions, 372 flow [2022-07-12 10:06:27,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=372, PETRI_PLACES=148, PETRI_TRANSITIONS=109} [2022-07-12 10:06:27,226 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places. [2022-07-12 10:06:27,227 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 109 transitions, 372 flow [2022-07-12 10:06:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.9090909090909) internal successors, (901), 11 states have internal predecessors, (901), 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,227 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:06:27,227 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:27,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:06:27,228 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:06:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:06:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash -433701851, now seen corresponding path program 3 times [2022-07-12 10:06:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:06:27,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878221844] [2022-07-12 10:06:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:06:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:06:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:06:27,269 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:06:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:06:27,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:06:27,344 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:06:27,345 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:06:27,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:06:27,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:06:27,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:06:27,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:06:27,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:06:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:06:27,349 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:06:27,354 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:06:27,355 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:06:27,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:06:27 BasicIcfg [2022-07-12 10:06:27,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:06:27,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:06:27,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:06:27,470 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:06:27,470 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:11" (3/4) ... [2022-07-12 10:06:27,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:06:27,565 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:06:27,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:06:27,566 INFO L158 Benchmark]: Toolchain (without parser) took 17672.84ms. Allocated memory was 100.7MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 67.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 979.2MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,566 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory was 55.8MB in the beginning and 55.8MB in the end (delta: 41.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:06:27,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.42ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 62.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.86ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 59.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,567 INFO L158 Benchmark]: Boogie Preprocessor took 54.65ms. Allocated memory is still 100.7MB. Free memory was 59.4MB in the beginning and 57.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,567 INFO L158 Benchmark]: RCFGBuilder took 971.39ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 57.1MB in the beginning and 78.0MB in the end (delta: -20.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,568 INFO L158 Benchmark]: TraceAbstraction took 15972.82ms. Allocated memory was 132.1MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 76.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 921.7MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,568 INFO L158 Benchmark]: Witness Printer took 95.84ms. Allocated memory is still 3.1GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 10:06:27,570 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.22ms. Allocated memory is still 100.7MB. Free memory was 55.8MB in the beginning and 55.8MB in the end (delta: 41.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.42ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 62.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.86ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 59.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.65ms. Allocated memory is still 100.7MB. Free memory was 59.4MB in the beginning and 57.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 971.39ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 57.1MB in the beginning and 78.0MB in the end (delta: -20.9MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15972.82ms. Allocated memory was 132.1MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 76.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 921.7MB. Max. memory is 16.1GB. * Witness Printer took 95.84ms. Allocated memory is still 3.1GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 34.6MB). Peak memory consumption was 35.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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L722] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L723] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L724] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L725] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L726] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L727] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L728] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L729] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L730] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L731] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L732] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L733] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L734] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L735] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L736] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L737] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t745; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t745, ((void *)0), P0, ((void *)0))=-2, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t746; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t746, ((void *)0), P1, ((void *)0))=-1, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t747; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t747, ((void *)0), P2, ((void *)0))=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 807 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1370 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1643 IncrementalHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 184 mSDtfsCounter, 1643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=991occurred in iteration=7, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 4231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:27,611 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