./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:20:49,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:20:49,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:20:49,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:20:49,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:20:49,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:20:49,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:20:49,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:20:49,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:20:49,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:20:49,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:20:49,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:20:49,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:20:49,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:20:49,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:20:49,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:20:49,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:20:49,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:20:49,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:20:49,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:20:49,164 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:20:49,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:20:49,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:20:49,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:20:49,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:20:49,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:20:49,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:20:49,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:20:49,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:20:49,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:20:49,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:20:49,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:20:49,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:20:49,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:20:49,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:20:49,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:20:49,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:20:49,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:20:49,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:20:49,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:20:49,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:20:49,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:20:49,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:20:49,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:20:49,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:20:49,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:20:49,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:20:49,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:20:49,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:20:49,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:20:49,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:20:49,201 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:20:49,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:20:49,201 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:20:49,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:20:49,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:20:49,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:20:49,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:20:49,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:20:49,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:20:49,203 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:20:49,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:20:49,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:20:49,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:20:49,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:20:49,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:20:49,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:20:49,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:20:49,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:20:49,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:20:49,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:20:49,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:20:49,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:20:49,205 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:20:49,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:20:49,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:20:49,206 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2022-07-22 21:20:49,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:20:49,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:20:49,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:20:49,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:20:49,480 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:20:49,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2022-07-22 21:20:49,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37549fb72/bf5be0127eef45d2b1f6863b5abc2e85/FLAG6623869c0 [2022-07-22 21:20:50,088 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:20:50,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2022-07-22 21:20:50,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37549fb72/bf5be0127eef45d2b1f6863b5abc2e85/FLAG6623869c0 [2022-07-22 21:20:50,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37549fb72/bf5be0127eef45d2b1f6863b5abc2e85 [2022-07-22 21:20:50,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:20:50,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:20:50,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:20:50,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:20:50,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:20:50,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:50,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e954ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50, skipping insertion in model container [2022-07-22 21:20:50,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:50,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:20:50,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:20:50,601 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/mix005_tso.oepc.i[949,962] [2022-07-22 21:20:50,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:20:50,813 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:20:50,828 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/mix005_tso.oepc.i[949,962] [2022-07-22 21:20:50,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:20:50,907 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:20:50,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50 WrapperNode [2022-07-22 21:20:50,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:20:50,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:20:50,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:20:50,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:20:50,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:50,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:50,981 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2022-07-22 21:20:50,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:20:50,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:20:50,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:20:50,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:20:50,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:50,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:20:51,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:20:51,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:20:51,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:20:51,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (1/1) ... [2022-07-22 21:20:51,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:20:51,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:20:51,093 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-22 21:20:51,116 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-22 21:20:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:20:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:20:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:20:51,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:20:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:20:51,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:20:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-22 21:20:51,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-22 21:20:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-22 21:20:51,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-22 21:20:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:20:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:20:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:20:51,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:20:51,146 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:20:51,303 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:20:51,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:20:51,826 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:20:52,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:20:52,181 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:20:52,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:20:52 BoogieIcfgContainer [2022-07-22 21:20:52,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:20:52,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:20:52,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:20:52,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:20:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:20:50" (1/3) ... [2022-07-22 21:20:52,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a99a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:20:52, skipping insertion in model container [2022-07-22 21:20:52,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:50" (2/3) ... [2022-07-22 21:20:52,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a99a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:20:52, skipping insertion in model container [2022-07-22 21:20:52,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:20:52" (3/3) ... [2022-07-22 21:20:52,197 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2022-07-22 21:20:52,203 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:20:52,211 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:20:52,212 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:20:52,212 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:20:52,305 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:20:52,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-07-22 21:20:52,424 INFO L129 PetriNetUnfolder]: 2/136 cut-off events. [2022-07-22 21:20:52,424 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:20:52,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-07-22 21:20:52,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-07-22 21:20:52,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-07-22 21:20:52,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:20:52,459 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@5fc61136, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7863ec8 [2022-07-22 21:20:52,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-22 21:20:52,478 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2022-07-22 21:20:52,478 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:20:52,479 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:52,480 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] [2022-07-22 21:20:52,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1996518298, now seen corresponding path program 1 times [2022-07-22 21:20:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:52,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925938892] [2022-07-22 21:20:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:52,822 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-22 21:20:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925938892] [2022-07-22 21:20:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925938892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:52,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:52,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:20:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827698174] [2022-07-22 21:20:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:52,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:20:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:52,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:20:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:20:52,874 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2022-07-22 21:20:52,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:52,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:52,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2022-07-22 21:20:52,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:53,230 INFO L129 PetriNetUnfolder]: 161/1036 cut-off events. [2022-07-22 21:20:53,230 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-07-22 21:20:53,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1036 events. 161/1036 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7025 event pairs, 103 based on Foata normal form. 35/1013 useless extension candidates. Maximal degree in co-relation 1279. Up to 187 conditions per place. [2022-07-22 21:20:53,245 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 17 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-07-22 21:20:53,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 334 flow [2022-07-22 21:20:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:20:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:20:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2022-07-22 21:20:53,260 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9428571428571428 [2022-07-22 21:20:53,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2022-07-22 21:20:53,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2022-07-22 21:20:53,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:53,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2022-07-22 21:20:53,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:53,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:53,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:53,286 INFO L186 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 396 transitions. [2022-07-22 21:20:53,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 334 flow [2022-07-22 21:20:53,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:20:53,294 INFO L242 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2022-07-22 21:20:53,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2022-07-22 21:20:53,300 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2022-07-22 21:20:53,301 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2022-07-22 21:20:53,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:53,302 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:53,302 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:20:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:20:53,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:53,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash -583916909, now seen corresponding path program 1 times [2022-07-22 21:20:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:53,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795940220] [2022-07-22 21:20:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:53,562 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-22 21:20:53,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:53,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795940220] [2022-07-22 21:20:53,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795940220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:53,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:53,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:20:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781408757] [2022-07-22 21:20:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:53,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:20:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:53,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:20:53,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:20:53,567 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2022-07-22 21:20:53,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:53,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:53,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2022-07-22 21:20:53,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:54,251 INFO L129 PetriNetUnfolder]: 869/2454 cut-off events. [2022-07-22 21:20:54,251 INFO L130 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-07-22 21:20:54,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2454 events. 869/2454 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 19565 event pairs, 129 based on Foata normal form. 0/2397 useless extension candidates. Maximal degree in co-relation 3867. Up to 609 conditions per place. [2022-07-22 21:20:54,268 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 21 selfloop transitions, 2 changer transitions 53/176 dead transitions. [2022-07-22 21:20:54,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 176 transitions, 504 flow [2022-07-22 21:20:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:20:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:20:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1118 transitions. [2022-07-22 21:20:54,273 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8873015873015873 [2022-07-22 21:20:54,273 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1118 transitions. [2022-07-22 21:20:54,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1118 transitions. [2022-07-22 21:20:54,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:54,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1118 transitions. [2022-07-22 21:20:54,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.22222222222223) internal successors, (1118), 9 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:54,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:54,281 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:54,281 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 9 states and 1118 transitions. [2022-07-22 21:20:54,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 176 transitions, 504 flow [2022-07-22 21:20:54,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 176 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:20:54,285 INFO L242 Difference]: Finished difference. Result has 156 places, 118 transitions, 264 flow [2022-07-22 21:20:54,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=156, PETRI_TRANSITIONS=118} [2022-07-22 21:20:54,286 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2022-07-22 21:20:54,287 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 118 transitions, 264 flow [2022-07-22 21:20:54,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:54,288 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:54,288 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:20:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:20:54,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1362219406, now seen corresponding path program 1 times [2022-07-22 21:20:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:54,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810350445] [2022-07-22 21:20:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:54,585 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-22 21:20:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810350445] [2022-07-22 21:20:54,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810350445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:54,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:54,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:20:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524603478] [2022-07-22 21:20:54,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:20:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:20:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:20:54,590 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2022-07-22 21:20:54,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 118 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:54,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:54,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2022-07-22 21:20:54,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:55,152 INFO L129 PetriNetUnfolder]: 746/1607 cut-off events. [2022-07-22 21:20:55,152 INFO L130 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2022-07-22 21:20:55,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 1607 events. 746/1607 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10105 event pairs, 200 based on Foata normal form. 36/1589 useless extension candidates. Maximal degree in co-relation 3057. Up to 571 conditions per place. [2022-07-22 21:20:55,166 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 22 selfloop transitions, 2 changer transitions 37/161 dead transitions. [2022-07-22 21:20:55,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 492 flow [2022-07-22 21:20:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:20:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:20:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1116 transitions. [2022-07-22 21:20:55,171 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2022-07-22 21:20:55,171 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1116 transitions. [2022-07-22 21:20:55,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1116 transitions. [2022-07-22 21:20:55,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:55,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1116 transitions. [2022-07-22 21:20:55,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:55,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:55,179 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:55,180 INFO L186 Difference]: Start difference. First operand has 156 places, 118 transitions, 264 flow. Second operand 9 states and 1116 transitions. [2022-07-22 21:20:55,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 492 flow [2022-07-22 21:20:55,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 460 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-22 21:20:55,192 INFO L242 Difference]: Finished difference. Result has 143 places, 118 transitions, 268 flow [2022-07-22 21:20:55,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2022-07-22 21:20:55,194 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2022-07-22 21:20:55,195 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 268 flow [2022-07-22 21:20:55,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:55,195 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:55,196 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-22 21:20:55,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:20:55,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1294539535, now seen corresponding path program 1 times [2022-07-22 21:20:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:55,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900164645] [2022-07-22 21:20:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:55,532 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-22 21:20:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900164645] [2022-07-22 21:20:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900164645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:55,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:20:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482472703] [2022-07-22 21:20:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:55,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:20:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:20:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:20:55,536 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-07-22 21:20:55,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:55,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:55,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-07-22 21:20:55,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:56,085 INFO L129 PetriNetUnfolder]: 862/1778 cut-off events. [2022-07-22 21:20:56,085 INFO L130 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2022-07-22 21:20:56,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 1778 events. 862/1778 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10794 event pairs, 320 based on Foata normal form. 36/1778 useless extension candidates. Maximal degree in co-relation 3489. Up to 822 conditions per place. [2022-07-22 21:20:56,101 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 22 selfloop transitions, 7 changer transitions 40/167 dead transitions. [2022-07-22 21:20:56,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 167 transitions, 530 flow [2022-07-22 21:20:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:20:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:20:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1336 transitions. [2022-07-22 21:20:56,106 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8675324675324675 [2022-07-22 21:20:56,106 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1336 transitions. [2022-07-22 21:20:56,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1336 transitions. [2022-07-22 21:20:56,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:56,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1336 transitions. [2022-07-22 21:20:56,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.45454545454545) internal successors, (1336), 11 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:56,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:56,114 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:56,114 INFO L186 Difference]: Start difference. First operand has 143 places, 118 transitions, 268 flow. Second operand 11 states and 1336 transitions. [2022-07-22 21:20:56,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 167 transitions, 530 flow [2022-07-22 21:20:56,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 167 transitions, 498 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-22 21:20:56,163 INFO L242 Difference]: Finished difference. Result has 146 places, 122 transitions, 325 flow [2022-07-22 21:20:56,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=325, PETRI_PLACES=146, PETRI_TRANSITIONS=122} [2022-07-22 21:20:56,169 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -1 predicate places. [2022-07-22 21:20:56,170 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 122 transitions, 325 flow [2022-07-22 21:20:56,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:56,170 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:56,171 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-22 21:20:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:20:56,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash 369886138, now seen corresponding path program 1 times [2022-07-22 21:20:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:56,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30742959] [2022-07-22 21:20:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:56,357 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-22 21:20:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30742959] [2022-07-22 21:20:56,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30742959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:56,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:56,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:20:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344028837] [2022-07-22 21:20:56,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:56,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:20:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:56,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:20:56,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:20:56,361 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2022-07-22 21:20:56,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 122 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:56,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:56,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2022-07-22 21:20:56,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:57,143 INFO L129 PetriNetUnfolder]: 1836/3690 cut-off events. [2022-07-22 21:20:57,143 INFO L130 PetriNetUnfolder]: For 7741/7741 co-relation queries the response was YES. [2022-07-22 21:20:57,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11771 conditions, 3690 events. 1836/3690 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 27029 event pairs, 272 based on Foata normal form. 34/3665 useless extension candidates. Maximal degree in co-relation 11701. Up to 1234 conditions per place. [2022-07-22 21:20:57,214 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 43 selfloop transitions, 2 changer transitions 20/163 dead transitions. [2022-07-22 21:20:57,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 163 transitions, 691 flow [2022-07-22 21:20:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:20:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:20:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2022-07-22 21:20:57,218 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2022-07-22 21:20:57,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2022-07-22 21:20:57,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2022-07-22 21:20:57,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:57,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2022-07-22 21:20:57,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:57,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:57,224 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:57,224 INFO L186 Difference]: Start difference. First operand has 146 places, 122 transitions, 325 flow. Second operand 7 states and 856 transitions. [2022-07-22 21:20:57,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 163 transitions, 691 flow [2022-07-22 21:20:57,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 163 transitions, 661 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-07-22 21:20:57,242 INFO L242 Difference]: Finished difference. Result has 145 places, 123 transitions, 329 flow [2022-07-22 21:20:57,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=145, PETRI_TRANSITIONS=123} [2022-07-22 21:20:57,243 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -2 predicate places. [2022-07-22 21:20:57,243 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 123 transitions, 329 flow [2022-07-22 21:20:57,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:57,244 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:57,244 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:20:57,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:20:57,245 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1057520432, now seen corresponding path program 2 times [2022-07-22 21:20:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:57,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907384079] [2022-07-22 21:20:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:57,533 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-22 21:20:57,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907384079] [2022-07-22 21:20:57,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907384079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:57,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:57,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 21:20:57,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831051899] [2022-07-22 21:20:57,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:57,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 21:20:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 21:20:57,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-22 21:20:57,540 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2022-07-22 21:20:57,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 123 transitions, 329 flow. Second operand has 13 states, 13 states have (on average 113.38461538461539) internal successors, (1474), 13 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:57,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:57,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2022-07-22 21:20:57,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:58,347 INFO L129 PetriNetUnfolder]: 1097/2335 cut-off events. [2022-07-22 21:20:58,348 INFO L130 PetriNetUnfolder]: For 5515/5739 co-relation queries the response was YES. [2022-07-22 21:20:58,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7947 conditions, 2335 events. 1097/2335 cut-off events. For 5515/5739 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16112 event pairs, 696 based on Foata normal form. 28/2289 useless extension candidates. Maximal degree in co-relation 7873. Up to 1426 conditions per place. [2022-07-22 21:20:58,376 INFO L132 encePairwiseOnDemand]: 126/140 looper letters, 26 selfloop transitions, 17 changer transitions 44/183 dead transitions. [2022-07-22 21:20:58,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 183 transitions, 911 flow [2022-07-22 21:20:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 21:20:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-22 21:20:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1989 transitions. [2022-07-22 21:20:58,381 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8357142857142857 [2022-07-22 21:20:58,382 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1989 transitions. [2022-07-22 21:20:58,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1989 transitions. [2022-07-22 21:20:58,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:58,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1989 transitions. [2022-07-22 21:20:58,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:58,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:58,393 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:58,393 INFO L186 Difference]: Start difference. First operand has 145 places, 123 transitions, 329 flow. Second operand 17 states and 1989 transitions. [2022-07-22 21:20:58,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 183 transitions, 911 flow [2022-07-22 21:20:58,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 183 transitions, 892 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-22 21:20:58,404 INFO L242 Difference]: Finished difference. Result has 165 places, 131 transitions, 473 flow [2022-07-22 21:20:58,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=473, PETRI_PLACES=165, PETRI_TRANSITIONS=131} [2022-07-22 21:20:58,406 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 18 predicate places. [2022-07-22 21:20:58,406 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 131 transitions, 473 flow [2022-07-22 21:20:58,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.38461538461539) internal successors, (1474), 13 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:58,407 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:58,407 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-22 21:20:58,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:20:58,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -256015204, now seen corresponding path program 1 times [2022-07-22 21:20:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:58,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762429168] [2022-07-22 21:20:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:58,657 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-22 21:20:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762429168] [2022-07-22 21:20:58,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762429168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:58,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:58,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 21:20:58,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204067065] [2022-07-22 21:20:58,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:58,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 21:20:58,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:58,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 21:20:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-22 21:20:58,664 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2022-07-22 21:20:58,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 131 transitions, 473 flow. Second operand has 13 states, 13 states have (on average 113.38461538461539) internal successors, (1474), 13 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:58,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:58,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2022-07-22 21:20:58,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:59,463 INFO L129 PetriNetUnfolder]: 1207/2658 cut-off events. [2022-07-22 21:20:59,463 INFO L130 PetriNetUnfolder]: For 13982/14415 co-relation queries the response was YES. [2022-07-22 21:20:59,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11530 conditions, 2658 events. 1207/2658 cut-off events. For 13982/14415 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19164 event pairs, 692 based on Foata normal form. 64/2644 useless extension candidates. Maximal degree in co-relation 11441. Up to 1375 conditions per place. [2022-07-22 21:20:59,497 INFO L132 encePairwiseOnDemand]: 125/140 looper letters, 36 selfloop transitions, 21 changer transitions 43/196 dead transitions. [2022-07-22 21:20:59,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 196 transitions, 1303 flow [2022-07-22 21:20:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 21:20:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-22 21:20:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1989 transitions. [2022-07-22 21:20:59,505 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8357142857142857 [2022-07-22 21:20:59,505 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1989 transitions. [2022-07-22 21:20:59,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1989 transitions. [2022-07-22 21:20:59,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:59,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1989 transitions. [2022-07-22 21:20:59,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:59,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:59,518 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:59,518 INFO L186 Difference]: Start difference. First operand has 165 places, 131 transitions, 473 flow. Second operand 17 states and 1989 transitions. [2022-07-22 21:20:59,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 196 transitions, 1303 flow [2022-07-22 21:20:59,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 196 transitions, 1163 flow, removed 66 selfloop flow, removed 10 redundant places. [2022-07-22 21:20:59,561 INFO L242 Difference]: Finished difference. Result has 173 places, 143 transitions, 643 flow [2022-07-22 21:20:59,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=643, PETRI_PLACES=173, PETRI_TRANSITIONS=143} [2022-07-22 21:20:59,563 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 26 predicate places. [2022-07-22 21:20:59,563 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 143 transitions, 643 flow [2022-07-22 21:20:59,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.38461538461539) internal successors, (1474), 13 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:59,564 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:59,564 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:20:59,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:20:59,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:59,565 INFO L85 PathProgramCache]: Analyzing trace with hash 564918203, now seen corresponding path program 1 times [2022-07-22 21:20:59,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:59,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134411403] [2022-07-22 21:20:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:59,697 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-22 21:20:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:59,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134411403] [2022-07-22 21:20:59,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134411403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:59,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:59,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:20:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469838464] [2022-07-22 21:20:59,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:59,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:20:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:59,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:20:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:20:59,701 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-07-22 21:20:59,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 143 transitions, 643 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:20:59,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:59,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-07-22 21:20:59,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:00,423 INFO L129 PetriNetUnfolder]: 1369/2912 cut-off events. [2022-07-22 21:21:00,424 INFO L130 PetriNetUnfolder]: For 28145/28738 co-relation queries the response was YES. [2022-07-22 21:21:00,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15507 conditions, 2912 events. 1369/2912 cut-off events. For 28145/28738 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20571 event pairs, 483 based on Foata normal form. 70/2876 useless extension candidates. Maximal degree in co-relation 15412. Up to 1130 conditions per place. [2022-07-22 21:21:00,465 INFO L132 encePairwiseOnDemand]: 128/140 looper letters, 51 selfloop transitions, 13 changer transitions 31/194 dead transitions. [2022-07-22 21:21:00,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 194 transitions, 1381 flow [2022-07-22 21:21:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:21:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:21:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1338 transitions. [2022-07-22 21:21:00,469 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8688311688311688 [2022-07-22 21:21:00,469 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1338 transitions. [2022-07-22 21:21:00,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1338 transitions. [2022-07-22 21:21:00,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:00,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1338 transitions. [2022-07-22 21:21:00,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.63636363636364) internal successors, (1338), 11 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:00,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:00,525 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:00,526 INFO L186 Difference]: Start difference. First operand has 173 places, 143 transitions, 643 flow. Second operand 11 states and 1338 transitions. [2022-07-22 21:21:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 194 transitions, 1381 flow [2022-07-22 21:21:00,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 194 transitions, 1179 flow, removed 97 selfloop flow, removed 13 redundant places. [2022-07-22 21:21:00,566 INFO L242 Difference]: Finished difference. Result has 168 places, 148 transitions, 671 flow [2022-07-22 21:21:00,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=671, PETRI_PLACES=168, PETRI_TRANSITIONS=148} [2022-07-22 21:21:00,569 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places. [2022-07-22 21:21:00,569 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 148 transitions, 671 flow [2022-07-22 21:21:00,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:00,570 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:00,570 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:00,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:21:00,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1375670791, now seen corresponding path program 2 times [2022-07-22 21:21:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:00,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075255585] [2022-07-22 21:21:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:00,753 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-22 21:21:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:00,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075255585] [2022-07-22 21:21:00,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075255585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:00,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:00,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:21:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299197910] [2022-07-22 21:21:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:00,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:21:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:21:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:21:00,757 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-07-22 21:21:00,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 148 transitions, 671 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:00,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:00,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-07-22 21:21:00,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:01,535 INFO L129 PetriNetUnfolder]: 1365/2915 cut-off events. [2022-07-22 21:21:01,535 INFO L130 PetriNetUnfolder]: For 19843/20710 co-relation queries the response was YES. [2022-07-22 21:21:01,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14273 conditions, 2915 events. 1365/2915 cut-off events. For 19843/20710 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20728 event pairs, 448 based on Foata normal form. 86/2898 useless extension candidates. Maximal degree in co-relation 14181. Up to 1119 conditions per place. [2022-07-22 21:21:01,572 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 52 selfloop transitions, 16 changer transitions 46/213 dead transitions. [2022-07-22 21:21:01,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 213 transitions, 1561 flow [2022-07-22 21:21:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:21:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:21:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1699 transitions. [2022-07-22 21:21:01,578 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8668367346938776 [2022-07-22 21:21:01,578 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1699 transitions. [2022-07-22 21:21:01,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1699 transitions. [2022-07-22 21:21:01,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:01,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1699 transitions. [2022-07-22 21:21:01,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 121.35714285714286) internal successors, (1699), 14 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:01,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:01,589 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:01,589 INFO L186 Difference]: Start difference. First operand has 168 places, 148 transitions, 671 flow. Second operand 14 states and 1699 transitions. [2022-07-22 21:21:01,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 213 transitions, 1561 flow [2022-07-22 21:21:01,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 213 transitions, 1445 flow, removed 51 selfloop flow, removed 8 redundant places. [2022-07-22 21:21:01,628 INFO L242 Difference]: Finished difference. Result has 177 places, 152 transitions, 746 flow [2022-07-22 21:21:01,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=746, PETRI_PLACES=177, PETRI_TRANSITIONS=152} [2022-07-22 21:21:01,630 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 30 predicate places. [2022-07-22 21:21:01,630 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 152 transitions, 746 flow [2022-07-22 21:21:01,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:01,631 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:01,631 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-22 21:21:01,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:21:01,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash -878224471, now seen corresponding path program 1 times [2022-07-22 21:21:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:01,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926431518] [2022-07-22 21:21:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:01,815 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-22 21:21:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:01,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926431518] [2022-07-22 21:21:01,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926431518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:01,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:01,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 21:21:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759969552] [2022-07-22 21:21:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:01,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:21:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:01,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:21:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:21:01,820 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-07-22 21:21:01,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 152 transitions, 746 flow. Second operand has 10 states, 10 states have (on average 116.6) internal successors, (1166), 10 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:01,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:01,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-07-22 21:21:01,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:02,583 INFO L129 PetriNetUnfolder]: 1136/2624 cut-off events. [2022-07-22 21:21:02,583 INFO L130 PetriNetUnfolder]: For 30527/31375 co-relation queries the response was YES. [2022-07-22 21:21:02,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15234 conditions, 2624 events. 1136/2624 cut-off events. For 30527/31375 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18775 event pairs, 408 based on Foata normal form. 62/2576 useless extension candidates. Maximal degree in co-relation 15137. Up to 1135 conditions per place. [2022-07-22 21:21:02,616 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 55 selfloop transitions, 17 changer transitions 37/208 dead transitions. [2022-07-22 21:21:02,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 208 transitions, 1787 flow [2022-07-22 21:21:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:21:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:21:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1690 transitions. [2022-07-22 21:21:02,620 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8622448979591837 [2022-07-22 21:21:02,620 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1690 transitions. [2022-07-22 21:21:02,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1690 transitions. [2022-07-22 21:21:02,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:02,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1690 transitions. [2022-07-22 21:21:02,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 120.71428571428571) internal successors, (1690), 14 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:02,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:02,642 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:02,642 INFO L186 Difference]: Start difference. First operand has 177 places, 152 transitions, 746 flow. Second operand 14 states and 1690 transitions. [2022-07-22 21:21:02,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 208 transitions, 1787 flow [2022-07-22 21:21:02,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 208 transitions, 1696 flow, removed 38 selfloop flow, removed 8 redundant places. [2022-07-22 21:21:02,677 INFO L242 Difference]: Finished difference. Result has 183 places, 156 transitions, 843 flow [2022-07-22 21:21:02,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=843, PETRI_PLACES=183, PETRI_TRANSITIONS=156} [2022-07-22 21:21:02,678 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 36 predicate places. [2022-07-22 21:21:02,678 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 156 transitions, 843 flow [2022-07-22 21:21:02,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.6) internal successors, (1166), 10 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:02,680 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:02,680 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-22 21:21:02,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:21:02,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1449535643, now seen corresponding path program 2 times [2022-07-22 21:21:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:02,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906725735] [2022-07-22 21:21:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:02,955 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-22 21:21:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:02,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906725735] [2022-07-22 21:21:02,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906725735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:02,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:02,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 21:21:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239414206] [2022-07-22 21:21:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:02,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 21:21:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 21:21:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-22 21:21:02,959 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 140 [2022-07-22 21:21:02,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 156 transitions, 843 flow. Second operand has 14 states, 14 states have (on average 112.42857142857143) internal successors, (1574), 14 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:02,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:02,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 140 [2022-07-22 21:21:02,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:03,894 INFO L129 PetriNetUnfolder]: 1329/2922 cut-off events. [2022-07-22 21:21:03,894 INFO L130 PetriNetUnfolder]: For 58259/60074 co-relation queries the response was YES. [2022-07-22 21:21:03,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20214 conditions, 2922 events. 1329/2922 cut-off events. For 58259/60074 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20924 event pairs, 228 based on Foata normal form. 110/2916 useless extension candidates. Maximal degree in co-relation 20108. Up to 1098 conditions per place. [2022-07-22 21:21:03,925 INFO L132 encePairwiseOnDemand]: 125/140 looper letters, 62 selfloop transitions, 18 changer transitions 47/222 dead transitions. [2022-07-22 21:21:03,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 222 transitions, 2251 flow [2022-07-22 21:21:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 21:21:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-22 21:21:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2204 transitions. [2022-07-22 21:21:03,929 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-07-22 21:21:03,929 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2204 transitions. [2022-07-22 21:21:03,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2204 transitions. [2022-07-22 21:21:03,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:03,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2204 transitions. [2022-07-22 21:21:03,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 116.0) internal successors, (2204), 19 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:03,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:03,937 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:03,937 INFO L186 Difference]: Start difference. First operand has 183 places, 156 transitions, 843 flow. Second operand 19 states and 2204 transitions. [2022-07-22 21:21:03,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 222 transitions, 2251 flow [2022-07-22 21:21:03,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 222 transitions, 1985 flow, removed 127 selfloop flow, removed 11 redundant places. [2022-07-22 21:21:03,986 INFO L242 Difference]: Finished difference. Result has 192 places, 159 transitions, 918 flow [2022-07-22 21:21:03,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=918, PETRI_PLACES=192, PETRI_TRANSITIONS=159} [2022-07-22 21:21:03,987 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 45 predicate places. [2022-07-22 21:21:03,987 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 159 transitions, 918 flow [2022-07-22 21:21:03,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 112.42857142857143) internal successors, (1574), 14 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:03,988 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:03,988 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-22 21:21:03,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:21:03,989 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -479566792, now seen corresponding path program 1 times [2022-07-22 21:21:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:03,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397778257] [2022-07-22 21:21:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:04,075 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-22 21:21:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:04,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397778257] [2022-07-22 21:21:04,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397778257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:04,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:04,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:21:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364521851] [2022-07-22 21:21:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:04,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:21:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:21:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:21:04,079 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-07-22 21:21:04,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 159 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:04,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:04,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-07-22 21:21:04,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:07,015 INFO L129 PetriNetUnfolder]: 11450/19205 cut-off events. [2022-07-22 21:21:07,015 INFO L130 PetriNetUnfolder]: For 368501/373004 co-relation queries the response was YES. [2022-07-22 21:21:07,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105328 conditions, 19205 events. 11450/19205 cut-off events. For 368501/373004 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 157769 event pairs, 340 based on Foata normal form. 1023/19526 useless extension candidates. Maximal degree in co-relation 105221. Up to 6746 conditions per place. [2022-07-22 21:21:07,480 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 118 selfloop transitions, 8 changer transitions 139/368 dead transitions. [2022-07-22 21:21:07,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 368 transitions, 3907 flow [2022-07-22 21:21:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:21:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:21:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2022-07-22 21:21:07,483 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2022-07-22 21:21:07,483 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2022-07-22 21:21:07,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2022-07-22 21:21:07,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:07,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2022-07-22 21:21:07,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:07,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:07,488 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:07,488 INFO L186 Difference]: Start difference. First operand has 192 places, 159 transitions, 918 flow. Second operand 10 states and 1230 transitions. [2022-07-22 21:21:07,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 368 transitions, 3907 flow [2022-07-22 21:21:07,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 368 transitions, 3396 flow, removed 220 selfloop flow, removed 19 redundant places. [2022-07-22 21:21:07,766 INFO L242 Difference]: Finished difference. Result has 179 places, 162 transitions, 876 flow [2022-07-22 21:21:07,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=876, PETRI_PLACES=179, PETRI_TRANSITIONS=162} [2022-07-22 21:21:07,767 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 32 predicate places. [2022-07-22 21:21:07,767 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 162 transitions, 876 flow [2022-07-22 21:21:07,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:07,768 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:07,768 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-22 21:21:07,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:21:07,768 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:07,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash -284429395, now seen corresponding path program 1 times [2022-07-22 21:21:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:07,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432438353] [2022-07-22 21:21:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:07,882 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-22 21:21:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432438353] [2022-07-22 21:21:07,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432438353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:07,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:07,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897602799] [2022-07-22 21:21:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:07,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:07,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:07,885 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-07-22 21:21:07,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 162 transitions, 876 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:07,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:07,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-07-22 21:21:07,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:09,892 INFO L129 PetriNetUnfolder]: 6568/12556 cut-off events. [2022-07-22 21:21:09,893 INFO L130 PetriNetUnfolder]: For 146565/149632 co-relation queries the response was YES. [2022-07-22 21:21:09,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64012 conditions, 12556 events. 6568/12556 cut-off events. For 146565/149632 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 111755 event pairs, 162 based on Foata normal form. 759/13113 useless extension candidates. Maximal degree in co-relation 63915. Up to 3307 conditions per place. [2022-07-22 21:21:10,036 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 162 selfloop transitions, 22 changer transitions 59/346 dead transitions. [2022-07-22 21:21:10,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 346 transitions, 3434 flow [2022-07-22 21:21:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:21:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:21:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1355 transitions. [2022-07-22 21:21:10,040 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8798701298701299 [2022-07-22 21:21:10,040 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1355 transitions. [2022-07-22 21:21:10,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1355 transitions. [2022-07-22 21:21:10,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:10,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1355 transitions. [2022-07-22 21:21:10,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.18181818181819) internal successors, (1355), 11 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:10,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:10,045 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:10,046 INFO L186 Difference]: Start difference. First operand has 179 places, 162 transitions, 876 flow. Second operand 11 states and 1355 transitions. [2022-07-22 21:21:10,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 346 transitions, 3434 flow [2022-07-22 21:21:10,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 346 transitions, 3418 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-07-22 21:21:10,180 INFO L242 Difference]: Finished difference. Result has 187 places, 176 transitions, 1071 flow [2022-07-22 21:21:10,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1071, PETRI_PLACES=187, PETRI_TRANSITIONS=176} [2022-07-22 21:21:10,182 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 40 predicate places. [2022-07-22 21:21:10,182 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 176 transitions, 1071 flow [2022-07-22 21:21:10,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:10,183 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:10,183 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] [2022-07-22 21:21:10,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 21:21:10,183 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -512682741, now seen corresponding path program 1 times [2022-07-22 21:21:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:10,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579065635] [2022-07-22 21:21:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:10,293 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-22 21:21:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579065635] [2022-07-22 21:21:10,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579065635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:10,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:10,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:21:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535913617] [2022-07-22 21:21:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:10,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:21:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:10,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:21:10,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:21:10,296 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-07-22 21:21:10,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 176 transitions, 1071 flow. Second operand has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:10,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:10,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-07-22 21:21:10,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:12,163 INFO L129 PetriNetUnfolder]: 5863/11711 cut-off events. [2022-07-22 21:21:12,163 INFO L130 PetriNetUnfolder]: For 149428/152427 co-relation queries the response was YES. [2022-07-22 21:21:12,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64853 conditions, 11711 events. 5863/11711 cut-off events. For 149428/152427 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 108672 event pairs, 129 based on Foata normal form. 626/12149 useless extension candidates. Maximal degree in co-relation 64751. Up to 2996 conditions per place. [2022-07-22 21:21:12,294 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 148 selfloop transitions, 38 changer transitions 79/368 dead transitions. [2022-07-22 21:21:12,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 368 transitions, 3984 flow [2022-07-22 21:21:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:21:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:21:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1725 transitions. [2022-07-22 21:21:12,297 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8801020408163265 [2022-07-22 21:21:12,297 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1725 transitions. [2022-07-22 21:21:12,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1725 transitions. [2022-07-22 21:21:12,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:12,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1725 transitions. [2022-07-22 21:21:12,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 123.21428571428571) internal successors, (1725), 14 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:12,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:12,303 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:12,303 INFO L186 Difference]: Start difference. First operand has 187 places, 176 transitions, 1071 flow. Second operand 14 states and 1725 transitions. [2022-07-22 21:21:12,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 368 transitions, 3984 flow [2022-07-22 21:21:13,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 368 transitions, 3656 flow, removed 101 selfloop flow, removed 6 redundant places. [2022-07-22 21:21:13,032 INFO L242 Difference]: Finished difference. Result has 200 places, 192 transitions, 1289 flow [2022-07-22 21:21:13,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1289, PETRI_PLACES=200, PETRI_TRANSITIONS=192} [2022-07-22 21:21:13,033 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 53 predicate places. [2022-07-22 21:21:13,033 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 192 transitions, 1289 flow [2022-07-22 21:21:13,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:13,033 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:13,034 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] [2022-07-22 21:21:13,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 21:21:13,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1895455213, now seen corresponding path program 1 times [2022-07-22 21:21:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:13,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285123957] [2022-07-22 21:21:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:21:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285123957] [2022-07-22 21:21:13,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285123957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:13,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:13,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:21:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415534652] [2022-07-22 21:21:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:13,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:21:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:21:13,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:21:13,186 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-07-22 21:21:13,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 192 transitions, 1289 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:13,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:13,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-07-22 21:21:13,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:15,259 INFO L129 PetriNetUnfolder]: 5603/11379 cut-off events. [2022-07-22 21:21:15,260 INFO L130 PetriNetUnfolder]: For 134134/136499 co-relation queries the response was YES. [2022-07-22 21:21:15,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60569 conditions, 11379 events. 5603/11379 cut-off events. For 134134/136499 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 107079 event pairs, 181 based on Foata normal form. 378/11565 useless extension candidates. Maximal degree in co-relation 60463. Up to 2243 conditions per place. [2022-07-22 21:21:15,369 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 134 selfloop transitions, 43 changer transitions 80/360 dead transitions. [2022-07-22 21:21:15,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 360 transitions, 3633 flow [2022-07-22 21:21:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 21:21:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-22 21:21:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2049 transitions. [2022-07-22 21:21:15,378 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8609243697478992 [2022-07-22 21:21:15,378 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2049 transitions. [2022-07-22 21:21:15,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2049 transitions. [2022-07-22 21:21:15,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:15,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2049 transitions. [2022-07-22 21:21:15,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 120.52941176470588) internal successors, (2049), 17 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:15,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:15,385 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 140.0) internal successors, (2520), 18 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:15,386 INFO L186 Difference]: Start difference. First operand has 200 places, 192 transitions, 1289 flow. Second operand 17 states and 2049 transitions. [2022-07-22 21:21:15,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 360 transitions, 3633 flow [2022-07-22 21:21:16,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 360 transitions, 3304 flow, removed 135 selfloop flow, removed 9 redundant places. [2022-07-22 21:21:16,224 INFO L242 Difference]: Finished difference. Result has 214 places, 191 transitions, 1172 flow [2022-07-22 21:21:16,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1172, PETRI_PLACES=214, PETRI_TRANSITIONS=191} [2022-07-22 21:21:16,225 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 67 predicate places. [2022-07-22 21:21:16,226 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 191 transitions, 1172 flow [2022-07-22 21:21:16,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:16,226 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:16,226 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, 1, 1, 1] [2022-07-22 21:21:16,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 21:21:16,227 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1717759508, now seen corresponding path program 1 times [2022-07-22 21:21:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:16,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038752338] [2022-07-22 21:21:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:16,349 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-22 21:21:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:16,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038752338] [2022-07-22 21:21:16,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038752338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:16,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:16,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332051018] [2022-07-22 21:21:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:16,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:16,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:16,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:16,352 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2022-07-22 21:21:16,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 191 transitions, 1172 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:16,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:16,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2022-07-22 21:21:16,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:17,558 INFO L129 PetriNetUnfolder]: 1991/7337 cut-off events. [2022-07-22 21:21:17,559 INFO L130 PetriNetUnfolder]: For 29893/31812 co-relation queries the response was YES. [2022-07-22 21:21:17,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26462 conditions, 7337 events. 1991/7337 cut-off events. For 29893/31812 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 91366 event pairs, 38 based on Foata normal form. 106/6980 useless extension candidates. Maximal degree in co-relation 26358. Up to 882 conditions per place. [2022-07-22 21:21:17,659 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 43 selfloop transitions, 1 changer transitions 43/231 dead transitions. [2022-07-22 21:21:17,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 231 transitions, 1685 flow [2022-07-22 21:21:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:21:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:21:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2022-07-22 21:21:17,661 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8540816326530613 [2022-07-22 21:21:17,661 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2022-07-22 21:21:17,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2022-07-22 21:21:17,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:17,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2022-07-22 21:21:17,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:17,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:17,664 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:17,665 INFO L186 Difference]: Start difference. First operand has 214 places, 191 transitions, 1172 flow. Second operand 7 states and 837 transitions. [2022-07-22 21:21:17,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 231 transitions, 1685 flow [2022-07-22 21:21:18,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 231 transitions, 1387 flow, removed 102 selfloop flow, removed 23 redundant places. [2022-07-22 21:21:18,025 INFO L242 Difference]: Finished difference. Result has 199 places, 180 transitions, 864 flow [2022-07-22 21:21:18,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=864, PETRI_PLACES=199, PETRI_TRANSITIONS=180} [2022-07-22 21:21:18,026 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 52 predicate places. [2022-07-22 21:21:18,027 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 180 transitions, 864 flow [2022-07-22 21:21:18,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:18,027 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:18,027 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, 1, 1, 1] [2022-07-22 21:21:18,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 21:21:18,027 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1256376186, now seen corresponding path program 2 times [2022-07-22 21:21:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:18,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928698608] [2022-07-22 21:21:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:18,148 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-22 21:21:18,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:18,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928698608] [2022-07-22 21:21:18,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928698608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:18,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:18,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823617759] [2022-07-22 21:21:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:18,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:18,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:18,152 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-07-22 21:21:18,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 180 transitions, 864 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:18,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:18,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-07-22 21:21:18,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:19,171 INFO L129 PetriNetUnfolder]: 1878/7664 cut-off events. [2022-07-22 21:21:19,171 INFO L130 PetriNetUnfolder]: For 10615/11561 co-relation queries the response was YES. [2022-07-22 21:21:19,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20602 conditions, 7664 events. 1878/7664 cut-off events. For 10615/11561 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 99306 event pairs, 56 based on Foata normal form. 43/7185 useless extension candidates. Maximal degree in co-relation 20566. Up to 774 conditions per place. [2022-07-22 21:21:19,258 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 36 selfloop transitions, 1 changer transitions 42/222 dead transitions. [2022-07-22 21:21:19,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 222 transitions, 1326 flow [2022-07-22 21:21:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:21:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:21:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2022-07-22 21:21:19,259 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8612244897959184 [2022-07-22 21:21:19,259 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2022-07-22 21:21:19,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2022-07-22 21:21:19,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:19,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2022-07-22 21:21:19,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:19,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:19,262 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:19,262 INFO L186 Difference]: Start difference. First operand has 199 places, 180 transitions, 864 flow. Second operand 7 states and 844 transitions. [2022-07-22 21:21:19,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 222 transitions, 1326 flow [2022-07-22 21:21:19,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 222 transitions, 1291 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-07-22 21:21:19,509 INFO L242 Difference]: Finished difference. Result has 198 places, 170 transitions, 783 flow [2022-07-22 21:21:19,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=783, PETRI_PLACES=198, PETRI_TRANSITIONS=170} [2022-07-22 21:21:19,510 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 51 predicate places. [2022-07-22 21:21:19,510 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 170 transitions, 783 flow [2022-07-22 21:21:19,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:19,511 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:19,511 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, 1, 1, 1] [2022-07-22 21:21:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 21:21:19,512 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1504379366, now seen corresponding path program 3 times [2022-07-22 21:21:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:19,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507251923] [2022-07-22 21:21:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:19,945 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-22 21:21:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507251923] [2022-07-22 21:21:19,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507251923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:19,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:19,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 21:21:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044915172] [2022-07-22 21:21:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:19,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 21:21:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 21:21:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-07-22 21:21:19,948 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2022-07-22 21:21:19,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 170 transitions, 783 flow. Second operand has 15 states, 15 states have (on average 109.8) internal successors, (1647), 15 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:19,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:19,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2022-07-22 21:21:19,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:20,485 INFO L129 PetriNetUnfolder]: 887/3903 cut-off events. [2022-07-22 21:21:20,485 INFO L130 PetriNetUnfolder]: For 4885/5153 co-relation queries the response was YES. [2022-07-22 21:21:20,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10310 conditions, 3903 events. 887/3903 cut-off events. For 4885/5153 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 44189 event pairs, 11 based on Foata normal form. 22/3724 useless extension candidates. Maximal degree in co-relation 10274. Up to 416 conditions per place. [2022-07-22 21:21:20,525 INFO L132 encePairwiseOnDemand]: 127/140 looper letters, 30 selfloop transitions, 12 changer transitions 8/183 dead transitions. [2022-07-22 21:21:20,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 183 transitions, 955 flow [2022-07-22 21:21:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:21:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:21:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1337 transitions. [2022-07-22 21:21:20,528 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7958333333333333 [2022-07-22 21:21:20,528 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1337 transitions. [2022-07-22 21:21:20,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1337 transitions. [2022-07-22 21:21:20,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:20,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1337 transitions. [2022-07-22 21:21:20,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 111.41666666666667) internal successors, (1337), 12 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:20,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:20,533 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:20,533 INFO L186 Difference]: Start difference. First operand has 198 places, 170 transitions, 783 flow. Second operand 12 states and 1337 transitions. [2022-07-22 21:21:20,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 183 transitions, 955 flow [2022-07-22 21:21:20,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 183 transitions, 908 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-07-22 21:21:20,622 INFO L242 Difference]: Finished difference. Result has 193 places, 171 transitions, 803 flow [2022-07-22 21:21:20,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=803, PETRI_PLACES=193, PETRI_TRANSITIONS=171} [2022-07-22 21:21:20,623 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 46 predicate places. [2022-07-22 21:21:20,624 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 171 transitions, 803 flow [2022-07-22 21:21:20,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 109.8) internal successors, (1647), 15 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:20,624 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:20,625 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, 1, 1, 1] [2022-07-22 21:21:20,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 21:21:20,625 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash 642191046, now seen corresponding path program 4 times [2022-07-22 21:21:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868835660] [2022-07-22 21:21:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:21:20,685 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:21:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:21:20,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:21:20,809 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:21:20,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-22 21:21:20,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-22 21:21:20,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-22 21:21:20,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-22 21:21:20,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-22 21:21:20,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-22 21:21:20,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-22 21:21:20,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 21:21:20,815 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:20,822 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:21:20,822 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:21:21,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:21:21 BasicIcfg [2022-07-22 21:21:21,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:21:21,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:21:21,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:21:21,002 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:21:21,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:20:52" (3/4) ... [2022-07-22 21:21:21,004 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:21:21,127 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:21:21,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:21:21,128 INFO L158 Benchmark]: Toolchain (without parser) took 30739.08ms. Allocated memory was 90.2MB in the beginning and 3.3GB in the end (delta: 3.3GB). Free memory was 54.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 875.8MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,129 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 59.2MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:21:21,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.56ms. Allocated memory is still 90.2MB. Free memory was 54.2MB in the beginning and 51.8MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.22ms. Allocated memory is still 90.2MB. Free memory was 51.8MB in the beginning and 48.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,130 INFO L158 Benchmark]: Boogie Preprocessor took 68.45ms. Allocated memory is still 90.2MB. Free memory was 48.8MB in the beginning and 46.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,130 INFO L158 Benchmark]: RCFGBuilder took 1134.36ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 46.4MB in the beginning and 46.5MB in the end (delta: -91.2kB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,130 INFO L158 Benchmark]: TraceAbstraction took 28811.35ms. Allocated memory was 109.1MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 45.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 800.8MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,130 INFO L158 Benchmark]: Witness Printer took 126.06ms. Allocated memory is still 3.3GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-07-22 21:21:21,132 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.28ms. Allocated memory is still 90.2MB. Free memory was 59.3MB in the beginning and 59.2MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.56ms. Allocated memory is still 90.2MB. Free memory was 54.2MB in the beginning and 51.8MB in the end (delta: 2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.22ms. Allocated memory is still 90.2MB. Free memory was 51.8MB in the beginning and 48.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.45ms. Allocated memory is still 90.2MB. Free memory was 48.8MB in the beginning and 46.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1134.36ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 46.4MB in the beginning and 46.5MB in the end (delta: -91.2kB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28811.35ms. Allocated memory was 109.1MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 45.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 800.8MB. Max. memory is 16.1GB. * Witness Printer took 126.06ms. Allocated memory is still 3.3GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L730] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L732] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L735] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L738] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L741] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L744] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t145; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-3, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-2, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 863]: 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: 859]: 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: 865]: 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: 861]: 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, 178 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: 28.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 743 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1657 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2821 IncrementalHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 149 mSDtfsCounter, 2821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1289occurred in iteration=14, InterpolantAutomatonStates: 209, 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.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1835 NumberOfCodeBlocks, 1835 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1708 ConstructedInterpolants, 0 QuantifiedInterpolants, 9788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-22 21:21:21,168 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