./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:07:32,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:07:32,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:07:32,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:07:32,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:07:32,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:07:32,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:07:32,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:07:32,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:07:32,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:07:32,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:07:32,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:07:32,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:07:32,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:07:32,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:07:32,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:07:32,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:07:32,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:07:32,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:07:32,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:07:32,175 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:07:32,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:07:32,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:07:32,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:07:32,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:07:32,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:07:32,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:07:32,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:07:32,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:07:32,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:07:32,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:07:32,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:07:32,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:07:32,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:07:32,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:07:32,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:07:32,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:07:32,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:07:32,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:07:32,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:07:32,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:07:32,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:07:32,192 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:07:32,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:07:32,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:07:32,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:07:32,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:07:32,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:07:32,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:07:32,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:07:32,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:07:32,213 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:07:32,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:07:32,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:07:32,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:07:32,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:07:32,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:07:32,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:07:32,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:07:32,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:07:32,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:07:32,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:07:32,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:07:32,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:07:32,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:07:32,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:07:32,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:07:32,217 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:07:32,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:07:32,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:07:32,218 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2022-07-12 10:07:32,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:07:32,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:07:32,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:07:32,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:07:32,416 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:07:32,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-07-12 10:07:32,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a2d77f7/1122e5feb0b04ffc86735a01366bafaf/FLAG91aafc9a7 [2022-07-12 10:07:32,831 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:07:32,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-07-12 10:07:32,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a2d77f7/1122e5feb0b04ffc86735a01366bafaf/FLAG91aafc9a7 [2022-07-12 10:07:33,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a2d77f7/1122e5feb0b04ffc86735a01366bafaf [2022-07-12 10:07:33,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:07:33,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:07:33,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:07:33,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:07:33,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:07:33,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3c5b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33, skipping insertion in model container [2022-07-12 10:07:33,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:07:33,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:07:33,414 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/mix046.opt.i[944,957] [2022-07-12 10:07:33,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:07:33,609 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:07:33,617 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/mix046.opt.i[944,957] [2022-07-12 10:07:33,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:07:33,693 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:07:33,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33 WrapperNode [2022-07-12 10:07:33,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:07:33,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:07:33,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:07:33,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:07:33,701 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:07:33" (1/1) ... [2022-07-12 10:07:33,730 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:07:33" (1/1) ... [2022-07-12 10:07:33,767 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-07-12 10:07:33,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:07:33,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:07:33,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:07:33,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:07:33,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:07:33,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:07:33,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:07:33,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:07:33,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (1/1) ... [2022-07-12 10:07:33,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:07:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:07:33,850 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:07:33,852 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:07:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:07:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:07:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:07:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:07:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:07:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:07:33,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:07:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:07:33,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:07:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:07:33,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:07:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-12 10:07:33,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-12 10:07:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:07:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:07:33,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:07:33,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:07:33,884 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:07:34,021 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:07:34,022 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:07:34,338 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:07:34,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:07:34,548 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:07:34,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:07:34 BoogieIcfgContainer [2022-07-12 10:07:34,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:07:34,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:07:34,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:07:34,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:07:34,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:07:33" (1/3) ... [2022-07-12 10:07:34,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe5ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:07:34, skipping insertion in model container [2022-07-12 10:07:34,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:07:33" (2/3) ... [2022-07-12 10:07:34,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe5ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:07:34, skipping insertion in model container [2022-07-12 10:07:34,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:07:34" (3/3) ... [2022-07-12 10:07:34,557 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-07-12 10:07:34,561 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:07:34,567 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:07:34,567 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:07:34,567 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:07:34,610 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:07:34,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-07-12 10:07:34,679 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2022-07-12 10:07:34,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:07:34,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-07-12 10:07:34,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-07-12 10:07:34,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-07-12 10:07:34,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:07:34,694 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@771c15e0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75929f14 [2022-07-12 10:07:34,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 10:07:34,705 INFO L129 PetriNetUnfolder]: 0/92 cut-off events. [2022-07-12 10:07:34,705 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:07:34,705 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:34,705 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] [2022-07-12 10:07:34,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:34,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1364924999, now seen corresponding path program 1 times [2022-07-12 10:07:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:34,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31012354] [2022-07-12 10:07:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:34,964 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:07:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:34,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31012354] [2022-07-12 10:07:34,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31012354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:34,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:34,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:07:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315422380] [2022-07-12 10:07:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:34,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:07:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:07:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:07:34,999 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-07-12 10:07:35,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:07:35,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:35,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-07-12 10:07:35,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:35,130 INFO L129 PetriNetUnfolder]: 17/277 cut-off events. [2022-07-12 10:07:35,130 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-12 10:07:35,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 17/277 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 831 event pairs, 7 based on Foata normal form. 9/275 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2022-07-12 10:07:35,135 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-07-12 10:07:35,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 132 transitions, 302 flow [2022-07-12 10:07:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:07:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:07:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-07-12 10:07:35,151 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2022-07-12 10:07:35,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-07-12 10:07:35,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-07-12 10:07:35,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:35,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-07-12 10:07:35,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:07:35,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:07:35,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:07:35,167 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2022-07-12 10:07:35,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 132 transitions, 302 flow [2022-07-12 10:07:35,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:07:35,175 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-07-12 10:07:35,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-07-12 10:07:35,179 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-07-12 10:07:35,180 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-07-12 10:07:35,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:07:35,180 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:35,181 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] [2022-07-12 10:07:35,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:07:35,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:35,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash -836884992, now seen corresponding path program 1 times [2022-07-12 10:07:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:35,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888646277] [2022-07-12 10:07:35,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:35,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:35,377 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:07:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:35,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888646277] [2022-07-12 10:07:35,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888646277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:35,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:35,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:07:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022666672] [2022-07-12 10:07:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:35,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:07:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:07:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:07:35,384 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-07-12 10:07:35,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:07:35,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:35,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-07-12 10:07:35,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:35,737 INFO L129 PetriNetUnfolder]: 357/1260 cut-off events. [2022-07-12 10:07:35,737 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-07-12 10:07:35,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1260 events. 357/1260 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8845 event pairs, 59 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 1883. Up to 333 conditions per place. [2022-07-12 10:07:35,744 INFO L132 encePairwiseOnDemand]: 130/137 looper letters, 21 selfloop transitions, 3 changer transitions 50/172 dead transitions. [2022-07-12 10:07:35,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 172 transitions, 496 flow [2022-07-12 10:07:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:07:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:07:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1098 transitions. [2022-07-12 10:07:35,746 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2022-07-12 10:07:35,746 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1098 transitions. [2022-07-12 10:07:35,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1098 transitions. [2022-07-12 10:07:35,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:35,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1098 transitions. [2022-07-12 10:07:35,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 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:07:35,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:07:35,752 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:07:35,752 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1098 transitions. [2022-07-12 10:07:35,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 172 transitions, 496 flow [2022-07-12 10:07:35,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 172 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:07:35,756 INFO L242 Difference]: Finished difference. Result has 153 places, 117 transitions, 281 flow [2022-07-12 10:07:35,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=153, PETRI_TRANSITIONS=117} [2022-07-12 10:07:35,757 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-07-12 10:07:35,757 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 117 transitions, 281 flow [2022-07-12 10:07:35,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:07:35,757 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:35,758 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:35,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:07:35,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash -283519073, now seen corresponding path program 1 times [2022-07-12 10:07:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:35,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013605849] [2022-07-12 10:07:35,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:35,934 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:07:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:35,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013605849] [2022-07-12 10:07:35,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013605849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:35,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:35,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:07:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262724196] [2022-07-12 10:07:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:35,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:07:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:07:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:07:35,938 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2022-07-12 10:07:35,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 117 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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:07:35,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:35,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2022-07-12 10:07:35,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:36,143 INFO L129 PetriNetUnfolder]: 192/589 cut-off events. [2022-07-12 10:07:36,143 INFO L130 PetriNetUnfolder]: For 485/489 co-relation queries the response was YES. [2022-07-12 10:07:36,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 589 events. 192/589 cut-off events. For 485/489 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3090 event pairs, 49 based on Foata normal form. 20/576 useless extension candidates. Maximal degree in co-relation 1196. Up to 116 conditions per place. [2022-07-12 10:07:36,155 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 16 selfloop transitions, 2 changer transitions 22/141 dead transitions. [2022-07-12 10:07:36,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 141 transitions, 427 flow [2022-07-12 10:07:36,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:07:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:07:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-07-12 10:07:36,159 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2022-07-12 10:07:36,159 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-07-12 10:07:36,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-07-12 10:07:36,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:36,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-07-12 10:07:36,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 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:07:36,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:07:36,164 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:07:36,164 INFO L186 Difference]: Start difference. First operand has 153 places, 117 transitions, 281 flow. Second operand 9 states and 1086 transitions. [2022-07-12 10:07:36,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 141 transitions, 427 flow [2022-07-12 10:07:36,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 141 transitions, 410 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-07-12 10:07:36,171 INFO L242 Difference]: Finished difference. Result has 144 places, 117 transitions, 292 flow [2022-07-12 10:07:36,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=144, PETRI_TRANSITIONS=117} [2022-07-12 10:07:36,173 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-07-12 10:07:36,173 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 292 flow [2022-07-12 10:07:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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:07:36,173 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:36,174 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:07:36,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1591499036, now seen corresponding path program 1 times [2022-07-12 10:07:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:36,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898126374] [2022-07-12 10:07:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:36,405 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:07:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:36,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898126374] [2022-07-12 10:07:36,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898126374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:36,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:36,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:07:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762652783] [2022-07-12 10:07:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:36,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:07:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:07:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:07:36,411 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-07-12 10:07:36,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 292 flow. Second operand has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 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:07:36,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:36,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-07-12 10:07:36,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:36,652 INFO L129 PetriNetUnfolder]: 171/529 cut-off events. [2022-07-12 10:07:36,653 INFO L130 PetriNetUnfolder]: For 616/619 co-relation queries the response was YES. [2022-07-12 10:07:36,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 529 events. 171/529 cut-off events. For 616/619 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2660 event pairs, 56 based on Foata normal form. 14/514 useless extension candidates. Maximal degree in co-relation 1153. Up to 169 conditions per place. [2022-07-12 10:07:36,658 INFO L132 encePairwiseOnDemand]: 128/137 looper letters, 18 selfloop transitions, 5 changer transitions 22/144 dead transitions. [2022-07-12 10:07:36,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 466 flow [2022-07-12 10:07:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:07:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:07:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1301 transitions. [2022-07-12 10:07:36,661 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8633045786330458 [2022-07-12 10:07:36,661 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1301 transitions. [2022-07-12 10:07:36,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1301 transitions. [2022-07-12 10:07:36,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:36,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1301 transitions. [2022-07-12 10:07:36,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.27272727272727) internal successors, (1301), 11 states have internal predecessors, (1301), 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:07:36,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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:07:36,667 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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:07:36,667 INFO L186 Difference]: Start difference. First operand has 144 places, 117 transitions, 292 flow. Second operand 11 states and 1301 transitions. [2022-07-12 10:07:36,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 466 flow [2022-07-12 10:07:36,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 144 transitions, 434 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-12 10:07:36,672 INFO L242 Difference]: Finished difference. Result has 147 places, 119 transitions, 323 flow [2022-07-12 10:07:36,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=323, PETRI_PLACES=147, PETRI_TRANSITIONS=119} [2022-07-12 10:07:36,672 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 3 predicate places. [2022-07-12 10:07:36,673 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 119 transitions, 323 flow [2022-07-12 10:07:36,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 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:07:36,673 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:36,674 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:36,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:07:36,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash 269638246, now seen corresponding path program 1 times [2022-07-12 10:07:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:36,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146084310] [2022-07-12 10:07:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:36,883 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:07:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:36,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146084310] [2022-07-12 10:07:36,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146084310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:36,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:36,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:07:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324801914] [2022-07-12 10:07:36,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:36,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:07:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:07:36,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:07:36,887 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-07-12 10:07:36,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 119 transitions, 323 flow. Second operand has 10 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 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:07:36,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:36,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-07-12 10:07:36,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:37,176 INFO L129 PetriNetUnfolder]: 160/517 cut-off events. [2022-07-12 10:07:37,176 INFO L130 PetriNetUnfolder]: For 997/1000 co-relation queries the response was YES. [2022-07-12 10:07:37,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 517 events. 160/517 cut-off events. For 997/1000 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2541 event pairs, 30 based on Foata normal form. 8/504 useless extension candidates. Maximal degree in co-relation 1377. Up to 150 conditions per place. [2022-07-12 10:07:37,181 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 22 selfloop transitions, 13 changer transitions 10/143 dead transitions. [2022-07-12 10:07:37,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 534 flow [2022-07-12 10:07:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:07:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:07:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1287 transitions. [2022-07-12 10:07:37,184 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2022-07-12 10:07:37,184 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1287 transitions. [2022-07-12 10:07:37,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1287 transitions. [2022-07-12 10:07:37,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:37,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1287 transitions. [2022-07-12 10:07:37,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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:07:37,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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:07:37,189 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 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:07:37,189 INFO L186 Difference]: Start difference. First operand has 147 places, 119 transitions, 323 flow. Second operand 11 states and 1287 transitions. [2022-07-12 10:07:37,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 534 flow [2022-07-12 10:07:37,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 510 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-07-12 10:07:37,195 INFO L242 Difference]: Finished difference. Result has 150 places, 126 transitions, 388 flow [2022-07-12 10:07:37,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=388, PETRI_PLACES=150, PETRI_TRANSITIONS=126} [2022-07-12 10:07:37,197 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 6 predicate places. [2022-07-12 10:07:37,197 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 126 transitions, 388 flow [2022-07-12 10:07:37,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 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:07:37,197 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:37,198 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:37,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:07:37,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1514740634, now seen corresponding path program 2 times [2022-07-12 10:07:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:37,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298904163] [2022-07-12 10:07:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:37,430 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:07:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:37,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298904163] [2022-07-12 10:07:37,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298904163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:37,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:37,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:07:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297241637] [2022-07-12 10:07:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:37,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:07:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:37,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:07:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:07:37,433 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-07-12 10:07:37,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 126 transitions, 388 flow. Second operand has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 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:07:37,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:37,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-07-12 10:07:37,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:37,758 INFO L129 PetriNetUnfolder]: 168/527 cut-off events. [2022-07-12 10:07:37,758 INFO L130 PetriNetUnfolder]: For 1564/1753 co-relation queries the response was YES. [2022-07-12 10:07:37,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 527 events. 168/527 cut-off events. For 1564/1753 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2532 event pairs, 26 based on Foata normal form. 17/521 useless extension candidates. Maximal degree in co-relation 1710. Up to 187 conditions per place. [2022-07-12 10:07:37,763 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 25 selfloop transitions, 14 changer transitions 19/154 dead transitions. [2022-07-12 10:07:37,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 154 transitions, 719 flow [2022-07-12 10:07:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:07:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:07:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1605 transitions. [2022-07-12 10:07:37,766 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8368091762252347 [2022-07-12 10:07:37,766 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1605 transitions. [2022-07-12 10:07:37,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1605 transitions. [2022-07-12 10:07:37,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:37,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1605 transitions. [2022-07-12 10:07:37,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.64285714285714) internal successors, (1605), 14 states have internal predecessors, (1605), 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:07:37,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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:07:37,772 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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:07:37,772 INFO L186 Difference]: Start difference. First operand has 150 places, 126 transitions, 388 flow. Second operand 14 states and 1605 transitions. [2022-07-12 10:07:37,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 154 transitions, 719 flow [2022-07-12 10:07:37,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 696 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-12 10:07:37,776 INFO L242 Difference]: Finished difference. Result has 161 places, 132 transitions, 481 flow [2022-07-12 10:07:37,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=481, PETRI_PLACES=161, PETRI_TRANSITIONS=132} [2022-07-12 10:07:37,777 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 17 predicate places. [2022-07-12 10:07:37,777 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 132 transitions, 481 flow [2022-07-12 10:07:37,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.58333333333333) internal successors, (1351), 12 states have internal predecessors, (1351), 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:07:37,778 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:37,778 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:37,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:07:37,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash 668788932, now seen corresponding path program 3 times [2022-07-12 10:07:37,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:37,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353250246] [2022-07-12 10:07:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:37,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:37,911 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:07:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:37,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353250246] [2022-07-12 10:07:37,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353250246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:37,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:37,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:07:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864350607] [2022-07-12 10:07:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:37,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:07:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:07:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:07:37,914 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-12 10:07:37,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 132 transitions, 481 flow. Second operand has 10 states, 10 states have (on average 113.8) internal successors, (1138), 10 states have internal predecessors, (1138), 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:07:37,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:37,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-12 10:07:37,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:38,198 INFO L129 PetriNetUnfolder]: 153/508 cut-off events. [2022-07-12 10:07:38,199 INFO L130 PetriNetUnfolder]: For 2629/2818 co-relation queries the response was YES. [2022-07-12 10:07:38,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1996 conditions, 508 events. 153/508 cut-off events. For 2629/2818 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2458 event pairs, 20 based on Foata normal form. 22/507 useless extension candidates. Maximal degree in co-relation 1911. Up to 141 conditions per place. [2022-07-12 10:07:38,204 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 32 selfloop transitions, 11 changer transitions 19/159 dead transitions. [2022-07-12 10:07:38,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 159 transitions, 900 flow [2022-07-12 10:07:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:07:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-12 10:07:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1395 transitions. [2022-07-12 10:07:38,206 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8485401459854015 [2022-07-12 10:07:38,206 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1395 transitions. [2022-07-12 10:07:38,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1395 transitions. [2022-07-12 10:07:38,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:38,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1395 transitions. [2022-07-12 10:07:38,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.25) internal successors, (1395), 12 states have internal predecessors, (1395), 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:07:38,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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:07:38,211 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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:07:38,211 INFO L186 Difference]: Start difference. First operand has 161 places, 132 transitions, 481 flow. Second operand 12 states and 1395 transitions. [2022-07-12 10:07:38,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 159 transitions, 900 flow [2022-07-12 10:07:38,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 159 transitions, 789 flow, removed 53 selfloop flow, removed 9 redundant places. [2022-07-12 10:07:38,217 INFO L242 Difference]: Finished difference. Result has 164 places, 134 transitions, 520 flow [2022-07-12 10:07:38,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=520, PETRI_PLACES=164, PETRI_TRANSITIONS=134} [2022-07-12 10:07:38,218 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 20 predicate places. [2022-07-12 10:07:38,218 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 134 transitions, 520 flow [2022-07-12 10:07:38,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.8) internal successors, (1138), 10 states have internal predecessors, (1138), 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:07:38,218 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:38,218 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:38,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:07:38,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1987356323, now seen corresponding path program 1 times [2022-07-12 10:07:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:38,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704585111] [2022-07-12 10:07:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:38,413 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:07:38,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:38,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704585111] [2022-07-12 10:07:38,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704585111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:38,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:07:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955412709] [2022-07-12 10:07:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:07:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:07:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:07:38,415 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-12 10:07:38,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 134 transitions, 520 flow. Second operand has 11 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 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:07:38,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:38,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-12 10:07:38,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:38,683 INFO L129 PetriNetUnfolder]: 124/476 cut-off events. [2022-07-12 10:07:38,683 INFO L130 PetriNetUnfolder]: For 2860/2981 co-relation queries the response was YES. [2022-07-12 10:07:38,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 476 events. 124/476 cut-off events. For 2860/2981 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2200 event pairs, 23 based on Foata normal form. 37/492 useless extension candidates. Maximal degree in co-relation 1825. Up to 167 conditions per place. [2022-07-12 10:07:38,689 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 31 selfloop transitions, 16 changer transitions 10/154 dead transitions. [2022-07-12 10:07:38,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 154 transitions, 833 flow [2022-07-12 10:07:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:07:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:07:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1613 transitions. [2022-07-12 10:07:38,692 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8409801876955162 [2022-07-12 10:07:38,692 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1613 transitions. [2022-07-12 10:07:38,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1613 transitions. [2022-07-12 10:07:38,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:38,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1613 transitions. [2022-07-12 10:07:38,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.21428571428571) internal successors, (1613), 14 states have internal predecessors, (1613), 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:07:38,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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:07:38,698 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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:07:38,698 INFO L186 Difference]: Start difference. First operand has 164 places, 134 transitions, 520 flow. Second operand 14 states and 1613 transitions. [2022-07-12 10:07:38,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 154 transitions, 833 flow [2022-07-12 10:07:38,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 154 transitions, 799 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-07-12 10:07:38,704 INFO L242 Difference]: Finished difference. Result has 173 places, 139 transitions, 614 flow [2022-07-12 10:07:38,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=614, PETRI_PLACES=173, PETRI_TRANSITIONS=139} [2022-07-12 10:07:38,705 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 29 predicate places. [2022-07-12 10:07:38,705 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 139 transitions, 614 flow [2022-07-12 10:07:38,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 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:07:38,705 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:38,705 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:07:38,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1808737673, now seen corresponding path program 2 times [2022-07-12 10:07:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:38,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525857652] [2022-07-12 10:07:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:38,914 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:07:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:38,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525857652] [2022-07-12 10:07:38,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525857652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:38,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:38,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:07:38,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913136495] [2022-07-12 10:07:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:38,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:07:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:07:38,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:07:38,916 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-07-12 10:07:38,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 139 transitions, 614 flow. Second operand has 14 states, 14 states have (on average 111.5) internal successors, (1561), 14 states have internal predecessors, (1561), 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:07:38,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:38,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-07-12 10:07:38,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:39,299 INFO L129 PetriNetUnfolder]: 126/488 cut-off events. [2022-07-12 10:07:39,299 INFO L130 PetriNetUnfolder]: For 4404/4591 co-relation queries the response was YES. [2022-07-12 10:07:39,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 488 events. 126/488 cut-off events. For 4404/4591 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2323 event pairs, 17 based on Foata normal form. 27/491 useless extension candidates. Maximal degree in co-relation 2094. Up to 159 conditions per place. [2022-07-12 10:07:39,306 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 34 selfloop transitions, 16 changer transitions 10/155 dead transitions. [2022-07-12 10:07:39,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 155 transitions, 956 flow [2022-07-12 10:07:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:07:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:07:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1693 transitions. [2022-07-12 10:07:39,309 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8238442822384429 [2022-07-12 10:07:39,309 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1693 transitions. [2022-07-12 10:07:39,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1693 transitions. [2022-07-12 10:07:39,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:39,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1693 transitions. [2022-07-12 10:07:39,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.86666666666666) internal successors, (1693), 15 states have internal predecessors, (1693), 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:07:39,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 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:07:39,315 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 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:07:39,315 INFO L186 Difference]: Start difference. First operand has 173 places, 139 transitions, 614 flow. Second operand 15 states and 1693 transitions. [2022-07-12 10:07:39,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 155 transitions, 956 flow [2022-07-12 10:07:39,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 155 transitions, 861 flow, removed 39 selfloop flow, removed 10 redundant places. [2022-07-12 10:07:39,324 INFO L242 Difference]: Finished difference. Result has 178 places, 141 transitions, 655 flow [2022-07-12 10:07:39,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=655, PETRI_PLACES=178, PETRI_TRANSITIONS=141} [2022-07-12 10:07:39,325 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2022-07-12 10:07:39,325 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 141 transitions, 655 flow [2022-07-12 10:07:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 111.5) internal successors, (1561), 14 states have internal predecessors, (1561), 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:07:39,325 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:39,325 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:39,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:07:39,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -874522595, now seen corresponding path program 3 times [2022-07-12 10:07:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:39,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601209742] [2022-07-12 10:07:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:39,558 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:07:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:39,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601209742] [2022-07-12 10:07:39,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601209742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:39,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:39,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:07:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561373512] [2022-07-12 10:07:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:39,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:07:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:07:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:07:39,560 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-07-12 10:07:39,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 141 transitions, 655 flow. Second operand has 12 states, 12 states have (on average 112.66666666666667) internal successors, (1352), 12 states have internal predecessors, (1352), 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:07:39,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:39,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-07-12 10:07:39,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:39,883 INFO L129 PetriNetUnfolder]: 115/494 cut-off events. [2022-07-12 10:07:39,883 INFO L130 PetriNetUnfolder]: For 3773/4156 co-relation queries the response was YES. [2022-07-12 10:07:39,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 494 events. 115/494 cut-off events. For 3773/4156 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2538 event pairs, 16 based on Foata normal form. 29/498 useless extension candidates. Maximal degree in co-relation 1998. Up to 111 conditions per place. [2022-07-12 10:07:39,889 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 39 selfloop transitions, 13 changer transitions 10/158 dead transitions. [2022-07-12 10:07:39,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 158 transitions, 1004 flow [2022-07-12 10:07:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:07:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:07:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1486 transitions. [2022-07-12 10:07:39,893 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8343627175743964 [2022-07-12 10:07:39,893 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1486 transitions. [2022-07-12 10:07:39,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1486 transitions. [2022-07-12 10:07:39,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:39,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1486 transitions. [2022-07-12 10:07:39,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.3076923076923) internal successors, (1486), 13 states have internal predecessors, (1486), 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:07:39,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:07:39,908 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:07:39,909 INFO L186 Difference]: Start difference. First operand has 178 places, 141 transitions, 655 flow. Second operand 13 states and 1486 transitions. [2022-07-12 10:07:39,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 158 transitions, 1004 flow [2022-07-12 10:07:39,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 158 transitions, 865 flow, removed 62 selfloop flow, removed 11 redundant places. [2022-07-12 10:07:39,918 INFO L242 Difference]: Finished difference. Result has 180 places, 141 transitions, 635 flow [2022-07-12 10:07:39,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=635, PETRI_PLACES=180, PETRI_TRANSITIONS=141} [2022-07-12 10:07:39,919 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 36 predicate places. [2022-07-12 10:07:39,919 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 141 transitions, 635 flow [2022-07-12 10:07:39,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.66666666666667) internal successors, (1352), 12 states have internal predecessors, (1352), 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:07:39,920 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:39,920 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:39,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:07:39,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1082988387, now seen corresponding path program 1 times [2022-07-12 10:07:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:39,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899380071] [2022-07-12 10:07:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:39,995 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:07:39,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:39,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899380071] [2022-07-12 10:07:39,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899380071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:39,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:39,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:07:39,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871304797] [2022-07-12 10:07:39,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:39,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:07:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:07:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:07:39,997 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-12 10:07:39,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 141 transitions, 635 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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:07:39,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:39,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-12 10:07:39,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:40,873 INFO L129 PetriNetUnfolder]: 3623/6689 cut-off events. [2022-07-12 10:07:40,873 INFO L130 PetriNetUnfolder]: For 31760/32880 co-relation queries the response was YES. [2022-07-12 10:07:40,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22541 conditions, 6689 events. 3623/6689 cut-off events. For 31760/32880 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 53496 event pairs, 119 based on Foata normal form. 486/6918 useless extension candidates. Maximal degree in co-relation 22449. Up to 2440 conditions per place. [2022-07-12 10:07:40,944 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 151 selfloop transitions, 18 changer transitions 5/272 dead transitions. [2022-07-12 10:07:40,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 272 transitions, 2182 flow [2022-07-12 10:07:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:07:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:07:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1204 transitions. [2022-07-12 10:07:40,946 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8788321167883212 [2022-07-12 10:07:40,946 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1204 transitions. [2022-07-12 10:07:40,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1204 transitions. [2022-07-12 10:07:40,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:40,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1204 transitions. [2022-07-12 10:07:40,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 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:07:40,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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:07:40,949 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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:07:40,949 INFO L186 Difference]: Start difference. First operand has 180 places, 141 transitions, 635 flow. Second operand 10 states and 1204 transitions. [2022-07-12 10:07:40,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 272 transitions, 2182 flow [2022-07-12 10:07:40,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 272 transitions, 1960 flow, removed 72 selfloop flow, removed 11 redundant places. [2022-07-12 10:07:41,027 INFO L242 Difference]: Finished difference. Result has 178 places, 157 transitions, 713 flow [2022-07-12 10:07:41,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=713, PETRI_PLACES=178, PETRI_TRANSITIONS=157} [2022-07-12 10:07:41,028 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2022-07-12 10:07:41,028 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 157 transitions, 713 flow [2022-07-12 10:07:41,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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:07:41,028 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:41,029 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:41,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:07:41,029 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 430264475, now seen corresponding path program 1 times [2022-07-12 10:07:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:41,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232467418] [2022-07-12 10:07:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:41,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:07:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232467418] [2022-07-12 10:07:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232467418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:41,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:41,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:07:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878782606] [2022-07-12 10:07:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:41,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:07:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:07:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:07:41,094 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-12 10:07:41,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 157 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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:07:41,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:41,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-12 10:07:41,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:42,112 INFO L129 PetriNetUnfolder]: 3503/6801 cut-off events. [2022-07-12 10:07:42,112 INFO L130 PetriNetUnfolder]: For 31339/32391 co-relation queries the response was YES. [2022-07-12 10:07:42,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28368 conditions, 6801 events. 3503/6801 cut-off events. For 31339/32391 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 57651 event pairs, 92 based on Foata normal form. 660/7341 useless extension candidates. Maximal degree in co-relation 28277. Up to 2192 conditions per place. [2022-07-12 10:07:42,169 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 176 selfloop transitions, 34 changer transitions 26/334 dead transitions. [2022-07-12 10:07:42,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 334 transitions, 2835 flow [2022-07-12 10:07:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:07:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:07:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1566 transitions. [2022-07-12 10:07:42,172 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8792813026389669 [2022-07-12 10:07:42,172 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1566 transitions. [2022-07-12 10:07:42,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1566 transitions. [2022-07-12 10:07:42,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:42,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1566 transitions. [2022-07-12 10:07:42,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.46153846153847) internal successors, (1566), 13 states have internal predecessors, (1566), 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:07:42,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:07:42,176 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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:07:42,176 INFO L186 Difference]: Start difference. First operand has 178 places, 157 transitions, 713 flow. Second operand 13 states and 1566 transitions. [2022-07-12 10:07:42,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 334 transitions, 2835 flow [2022-07-12 10:07:42,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 334 transitions, 2833 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:07:42,219 INFO L242 Difference]: Finished difference. Result has 195 places, 175 transitions, 975 flow [2022-07-12 10:07:42,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=975, PETRI_PLACES=195, PETRI_TRANSITIONS=175} [2022-07-12 10:07:42,219 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 51 predicate places. [2022-07-12 10:07:42,220 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 175 transitions, 975 flow [2022-07-12 10:07:42,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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:07:42,220 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:42,220 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:42,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:07:42,220 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash -39298, now seen corresponding path program 1 times [2022-07-12 10:07:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:42,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023752724] [2022-07-12 10:07:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:42,282 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:07:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:42,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023752724] [2022-07-12 10:07:42,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023752724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:42,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:42,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:07:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383518953] [2022-07-12 10:07:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:42,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:07:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:07:42,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:07:42,284 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-07-12 10:07:42,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 175 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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:07:42,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:42,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-07-12 10:07:42,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:42,876 INFO L129 PetriNetUnfolder]: 1093/4019 cut-off events. [2022-07-12 10:07:42,876 INFO L130 PetriNetUnfolder]: For 19157/24078 co-relation queries the response was YES. [2022-07-12 10:07:42,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15734 conditions, 4019 events. 1093/4019 cut-off events. For 19157/24078 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 43053 event pairs, 128 based on Foata normal form. 132/3825 useless extension candidates. Maximal degree in co-relation 15635. Up to 1175 conditions per place. [2022-07-12 10:07:42,908 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 66 selfloop transitions, 11 changer transitions 15/226 dead transitions. [2022-07-12 10:07:42,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 226 transitions, 1608 flow [2022-07-12 10:07:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:07:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:07:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2022-07-12 10:07:42,910 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8767234387672344 [2022-07-12 10:07:42,910 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2022-07-12 10:07:42,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2022-07-12 10:07:42,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:42,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2022-07-12 10:07:42,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 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:07:42,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:07:42,913 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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:07:42,913 INFO L186 Difference]: Start difference. First operand has 195 places, 175 transitions, 975 flow. Second operand 9 states and 1081 transitions. [2022-07-12 10:07:42,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 226 transitions, 1608 flow [2022-07-12 10:07:42,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 226 transitions, 1519 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-07-12 10:07:42,992 INFO L242 Difference]: Finished difference. Result has 206 places, 183 transitions, 1019 flow [2022-07-12 10:07:42,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=206, PETRI_TRANSITIONS=183} [2022-07-12 10:07:42,993 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 62 predicate places. [2022-07-12 10:07:42,993 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 183 transitions, 1019 flow [2022-07-12 10:07:42,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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:07:42,993 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:42,993 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:07:42,993 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:42,994 INFO L85 PathProgramCache]: Analyzing trace with hash -31596332, now seen corresponding path program 1 times [2022-07-12 10:07:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:42,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895471112] [2022-07-12 10:07:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:43,090 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:07:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895471112] [2022-07-12 10:07:43,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895471112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:43,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:43,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:07:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859122174] [2022-07-12 10:07:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:07:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:07:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:07:43,092 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-12 10:07:43,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 183 transitions, 1019 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 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:07:43,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:43,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-12 10:07:43,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:44,559 INFO L129 PetriNetUnfolder]: 4680/9401 cut-off events. [2022-07-12 10:07:44,559 INFO L130 PetriNetUnfolder]: For 62920/64334 co-relation queries the response was YES. [2022-07-12 10:07:44,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44277 conditions, 9401 events. 4680/9401 cut-off events. For 62920/64334 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 88058 event pairs, 74 based on Foata normal form. 988/10242 useless extension candidates. Maximal degree in co-relation 44172. Up to 2265 conditions per place. [2022-07-12 10:07:44,634 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 76 selfloop transitions, 15 changer transitions 174/363 dead transitions. [2022-07-12 10:07:44,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 363 transitions, 3394 flow [2022-07-12 10:07:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:07:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:07:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1927 transitions. [2022-07-12 10:07:44,637 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8791058394160584 [2022-07-12 10:07:44,637 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1927 transitions. [2022-07-12 10:07:44,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1927 transitions. [2022-07-12 10:07:44,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:44,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1927 transitions. [2022-07-12 10:07:44,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.4375) internal successors, (1927), 16 states have internal predecessors, (1927), 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:07:44,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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:07:44,642 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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:07:44,642 INFO L186 Difference]: Start difference. First operand has 206 places, 183 transitions, 1019 flow. Second operand 16 states and 1927 transitions. [2022-07-12 10:07:44,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 363 transitions, 3394 flow [2022-07-12 10:07:44,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 363 transitions, 3220 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-07-12 10:07:44,926 INFO L242 Difference]: Finished difference. Result has 223 places, 142 transitions, 760 flow [2022-07-12 10:07:44,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=760, PETRI_PLACES=223, PETRI_TRANSITIONS=142} [2022-07-12 10:07:44,927 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 79 predicate places. [2022-07-12 10:07:44,928 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 142 transitions, 760 flow [2022-07-12 10:07:44,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 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:07:44,928 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:44,928 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:44,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:07:44,928 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash 59253088, now seen corresponding path program 1 times [2022-07-12 10:07:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:44,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929408581] [2022-07-12 10:07:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:45,009 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:07:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:45,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929408581] [2022-07-12 10:07:45,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929408581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:45,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:45,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:07:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926985124] [2022-07-12 10:07:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:45,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:07:45,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:07:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:07:45,012 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-07-12 10:07:45,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 142 transitions, 760 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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:07:45,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:45,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-07-12 10:07:45,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:45,337 INFO L129 PetriNetUnfolder]: 446/1931 cut-off events. [2022-07-12 10:07:45,337 INFO L130 PetriNetUnfolder]: For 15121/15744 co-relation queries the response was YES. [2022-07-12 10:07:45,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7934 conditions, 1931 events. 446/1931 cut-off events. For 15121/15744 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16580 event pairs, 48 based on Foata normal form. 72/1905 useless extension candidates. Maximal degree in co-relation 7822. Up to 484 conditions per place. [2022-07-12 10:07:45,355 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 42 selfloop transitions, 1 changer transitions 30/185 dead transitions. [2022-07-12 10:07:45,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 185 transitions, 1310 flow [2022-07-12 10:07:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:07:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:07:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2022-07-12 10:07:45,360 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8759124087591241 [2022-07-12 10:07:45,360 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2022-07-12 10:07:45,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2022-07-12 10:07:45,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:45,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2022-07-12 10:07:45,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 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:07:45,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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:07:45,362 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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:07:45,363 INFO L186 Difference]: Start difference. First operand has 223 places, 142 transitions, 760 flow. Second operand 7 states and 840 transitions. [2022-07-12 10:07:45,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 185 transitions, 1310 flow [2022-07-12 10:07:45,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 185 transitions, 1072 flow, removed 79 selfloop flow, removed 29 redundant places. [2022-07-12 10:07:45,403 INFO L242 Difference]: Finished difference. Result has 179 places, 140 transitions, 577 flow [2022-07-12 10:07:45,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=179, PETRI_TRANSITIONS=140} [2022-07-12 10:07:45,404 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 35 predicate places. [2022-07-12 10:07:45,404 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 140 transitions, 577 flow [2022-07-12 10:07:45,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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:07:45,404 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:45,404 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:45,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:07:45,404 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1894116068, now seen corresponding path program 2 times [2022-07-12 10:07:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119971579] [2022-07-12 10:07:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:45,484 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:07:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:45,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119971579] [2022-07-12 10:07:45,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119971579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:45,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:45,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:07:45,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798781469] [2022-07-12 10:07:45,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:45,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:07:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:07:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:07:45,486 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-12 10:07:45,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 140 transitions, 577 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 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:07:45,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:45,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-12 10:07:45,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:45,863 INFO L129 PetriNetUnfolder]: 459/1494 cut-off events. [2022-07-12 10:07:45,863 INFO L130 PetriNetUnfolder]: For 3893/4187 co-relation queries the response was YES. [2022-07-12 10:07:45,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1494 events. 459/1494 cut-off events. For 3893/4187 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11279 event pairs, 5 based on Foata normal form. 128/1562 useless extension candidates. Maximal degree in co-relation 4613. Up to 261 conditions per place. [2022-07-12 10:07:45,873 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 50 selfloop transitions, 19 changer transitions 41/205 dead transitions. [2022-07-12 10:07:45,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 205 transitions, 1323 flow [2022-07-12 10:07:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:07:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-12 10:07:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1414 transitions. [2022-07-12 10:07:45,875 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8600973236009732 [2022-07-12 10:07:45,875 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1414 transitions. [2022-07-12 10:07:45,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1414 transitions. [2022-07-12 10:07:45,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:45,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1414 transitions. [2022-07-12 10:07:45,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.83333333333333) internal successors, (1414), 12 states have internal predecessors, (1414), 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:07:45,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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:07:45,879 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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:07:45,879 INFO L186 Difference]: Start difference. First operand has 179 places, 140 transitions, 577 flow. Second operand 12 states and 1414 transitions. [2022-07-12 10:07:45,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 205 transitions, 1323 flow [2022-07-12 10:07:45,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 205 transitions, 1158 flow, removed 57 selfloop flow, removed 19 redundant places. [2022-07-12 10:07:45,890 INFO L242 Difference]: Finished difference. Result has 173 places, 136 transitions, 532 flow [2022-07-12 10:07:45,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=532, PETRI_PLACES=173, PETRI_TRANSITIONS=136} [2022-07-12 10:07:45,890 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 29 predicate places. [2022-07-12 10:07:45,890 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 136 transitions, 532 flow [2022-07-12 10:07:45,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 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:07:45,890 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:45,891 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:45,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 10:07:45,891 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1450653654, now seen corresponding path program 1 times [2022-07-12 10:07:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:45,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252117440] [2022-07-12 10:07:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:07:45,968 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:07:45,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:07:45,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252117440] [2022-07-12 10:07:45,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252117440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:07:45,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:07:45,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:07:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065140627] [2022-07-12 10:07:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:07:45,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:07:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:07:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:07:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:07:45,971 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-07-12 10:07:45,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 136 transitions, 532 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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:07:45,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:07:45,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-07-12 10:07:45,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:07:46,111 INFO L129 PetriNetUnfolder]: 129/664 cut-off events. [2022-07-12 10:07:46,111 INFO L130 PetriNetUnfolder]: For 696/769 co-relation queries the response was YES. [2022-07-12 10:07:46,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 664 events. 129/664 cut-off events. For 696/769 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3897 event pairs, 7 based on Foata normal form. 4/636 useless extension candidates. Maximal degree in co-relation 1581. Up to 101 conditions per place. [2022-07-12 10:07:46,115 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 1 changer transitions 31/159 dead transitions. [2022-07-12 10:07:46,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 159 transitions, 763 flow [2022-07-12 10:07:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:07:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:07:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-07-12 10:07:46,116 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8665276329509907 [2022-07-12 10:07:46,117 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-07-12 10:07:46,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-07-12 10:07:46,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:07:46,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-07-12 10:07:46,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 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:07:46,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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:07:46,119 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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:07:46,119 INFO L186 Difference]: Start difference. First operand has 173 places, 136 transitions, 532 flow. Second operand 7 states and 831 transitions. [2022-07-12 10:07:46,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 159 transitions, 763 flow [2022-07-12 10:07:46,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 159 transitions, 615 flow, removed 31 selfloop flow, removed 24 redundant places. [2022-07-12 10:07:46,125 INFO L242 Difference]: Finished difference. Result has 156 places, 128 transitions, 347 flow [2022-07-12 10:07:46,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=156, PETRI_TRANSITIONS=128} [2022-07-12 10:07:46,126 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 12 predicate places. [2022-07-12 10:07:46,126 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 128 transitions, 347 flow [2022-07-12 10:07:46,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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:07:46,126 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:07:46,126 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:46,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 10:07:46,126 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 10:07:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:07:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1841512116, now seen corresponding path program 2 times [2022-07-12 10:07:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:07:46,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548028012] [2022-07-12 10:07:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:07:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:07:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:07:46,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:07:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:07:46,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:07:46,229 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:07:46,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-12 10:07:46,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-12 10:07:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-12 10:07:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-12 10:07:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-12 10:07:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-12 10:07:46,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-12 10:07:46,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 10:07:46,232 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:07:46,237 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:07:46,237 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:07:46,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:07:46 BasicIcfg [2022-07-12 10:07:46,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:07:46,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:07:46,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:07:46,363 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:07:46,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:07:34" (3/4) ... [2022-07-12 10:07:46,364 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:07:46,476 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:07:46,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:07:46,477 INFO L158 Benchmark]: Toolchain (without parser) took 13284.44ms. Allocated memory was 88.1MB in the beginning and 2.3GB in the end (delta: 2.3GB). Free memory was 52.9MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 590.8MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,477 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:07:46,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.59ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 52.6MB in the beginning and 79.2MB in the end (delta: -26.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.21ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,478 INFO L158 Benchmark]: Boogie Preprocessor took 45.91ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,478 INFO L158 Benchmark]: RCFGBuilder took 736.08ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 55.0MB in the end (delta: 19.1MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,479 INFO L158 Benchmark]: TraceAbstraction took 11810.33ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 54.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 528.3MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,479 INFO L158 Benchmark]: Witness Printer took 113.30ms. Allocated memory is still 2.3GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 10:07:46,481 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.10ms. Allocated memory is still 88.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.59ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 52.6MB in the beginning and 79.2MB in the end (delta: -26.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.21ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.91ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.08ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 55.0MB in the end (delta: 19.1MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11810.33ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 54.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 528.3MB. Max. memory is 16.1GB. * Witness Printer took 113.30ms. Allocated memory is still 2.3GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 35.7MB). 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 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) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] 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) [L788] 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) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 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 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 887 mSDsluCounter, 772 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1318 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2139 IncrementalHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 146 mSDtfsCounter, 2139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1019occurred in iteration=13, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1698 NumberOfCodeBlocks, 1698 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 7562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:07:46,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE