./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/mix018_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 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:45:15,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:45:15,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:45:15,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:45:15,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:45:15,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:45:15,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:45:15,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:45:15,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:45:15,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:45:15,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:45:15,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:45:15,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:45:15,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:45:15,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:45:15,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:45:15,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:45:15,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:45:15,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:45:15,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:45:15,986 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:45:15,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:45:15,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:45:15,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:45:15,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:45:15,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:45:15,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:45:15,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:45:15,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:45:15,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:45:15,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:45:15,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:45:15,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:45:15,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:45:15,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:45:16,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:45:16,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:45:16,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:45:16,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:45:16,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:45:16,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:45:16,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:45:16,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:45:16,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:45:16,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:45:16,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:45:16,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:45:16,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:45:16,028 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:45:16,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:45:16,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:45:16,029 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:45:16,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:45:16,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:45:16,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:45:16,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:45:16,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:45:16,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:45:16,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:45:16,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:45:16,031 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:45:16,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:45:16,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:45:16,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:45:16,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:45:16,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:45:16,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:45:16,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:45:16,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:45:16,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:45:16,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:45:16,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:45:16,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:45:16,033 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:45:16,033 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:45:16,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:45:16,033 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2022-07-13 21:45:16,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:45:16,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:45:16,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:45:16,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:45:16,263 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:45:16,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2022-07-13 21:45:16,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1adc1d3e/b44e60b696f149ce8acb8897a9772141/FLAGde93ea1d7 [2022-07-13 21:45:16,706 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:45:16,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2022-07-13 21:45:16,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1adc1d3e/b44e60b696f149ce8acb8897a9772141/FLAGde93ea1d7 [2022-07-13 21:45:16,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1adc1d3e/b44e60b696f149ce8acb8897a9772141 [2022-07-13 21:45:16,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:45:16,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:45:16,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:45:16,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:45:16,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:45:16,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:45:16" (1/1) ... [2022-07-13 21:45:16,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a7e636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:16, skipping insertion in model container [2022-07-13 21:45:16,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:45:16" (1/1) ... [2022-07-13 21:45:16,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:45:16,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:45:16,917 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/mix018_tso.oepc.i[949,962] [2022-07-13 21:45:17,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:45:17,067 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:45:17,080 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/mix018_tso.oepc.i[949,962] [2022-07-13 21:45:17,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:45:17,173 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:45:17,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17 WrapperNode [2022-07-13 21:45:17,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:45:17,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:45:17,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:45:17,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:45:17,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,294 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292 [2022-07-13 21:45:17,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:45:17,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:45:17,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:45:17,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:45:17,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:45:17,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:45:17,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:45:17,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:45:17,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (1/1) ... [2022-07-13 21:45:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:45:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:45:17,420 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-13 21:45:17,422 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-13 21:45:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:45:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:45:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:45:17,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:45:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:45:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-13 21:45:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-13 21:45:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:45:17,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:45:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:45:17,480 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:45:17,597 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:45:17,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:45:17,952 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:45:18,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:45:18,302 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:45:18,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:45:18 BoogieIcfgContainer [2022-07-13 21:45:18,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:45:18,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:45:18,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:45:18,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:45:18,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:45:16" (1/3) ... [2022-07-13 21:45:18,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec9a7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:45:18, skipping insertion in model container [2022-07-13 21:45:18,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:45:17" (2/3) ... [2022-07-13 21:45:18,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec9a7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:45:18, skipping insertion in model container [2022-07-13 21:45:18,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:45:18" (3/3) ... [2022-07-13 21:45:18,311 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2022-07-13 21:45:18,316 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:45:18,322 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:45:18,323 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:45:18,323 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:45:18,374 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:45:18,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-07-13 21:45:18,478 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2022-07-13 21:45:18,479 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:45:18,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-07-13 21:45:18,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-07-13 21:45:18,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-07-13 21:45:18,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:45:18,499 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@774677cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55562f91 [2022-07-13 21:45:18,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:45:18,507 INFO L129 PetriNetUnfolder]: 0/66 cut-off events. [2022-07-13 21:45:18,509 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:45:18,509 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:18,510 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] [2022-07-13 21:45:18,511 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-13 21:45:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1109753730, now seen corresponding path program 1 times [2022-07-13 21:45:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473850650] [2022-07-13 21:45:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:18,887 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-13 21:45:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473850650] [2022-07-13 21:45:18,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473850650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:18,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:18,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:45:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460247698] [2022-07-13 21:45:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:18,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:45:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:45:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:45:18,923 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 138 [2022-07-13 21:45:18,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:18,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:18,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 138 [2022-07-13 21:45:18,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:19,153 INFO L129 PetriNetUnfolder]: 161/676 cut-off events. [2022-07-13 21:45:19,154 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-07-13 21:45:19,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 676 events. 161/676 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3697 event pairs, 35 based on Foata normal form. 30/672 useless extension candidates. Maximal degree in co-relation 920. Up to 187 conditions per place. [2022-07-13 21:45:19,162 INFO L132 encePairwiseOnDemand]: 133/138 looper letters, 17 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2022-07-13 21:45:19,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 137 transitions, 330 flow [2022-07-13 21:45:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:45:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:45:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-07-13 21:45:19,178 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-07-13 21:45:19,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-07-13 21:45:19,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-07-13 21:45:19,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:19,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-07-13 21:45:19,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,196 INFO L186 Difference]: Start difference. First operand has 145 places, 134 transitions, 280 flow. Second operand 3 states and 390 transitions. [2022-07-13 21:45:19,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 137 transitions, 330 flow [2022-07-13 21:45:19,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 137 transitions, 324 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:19,203 INFO L242 Difference]: Finished difference. Result has 141 places, 130 transitions, 272 flow [2022-07-13 21:45:19,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2022-07-13 21:45:19,207 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-07-13 21:45:19,207 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 272 flow [2022-07-13 21:45:19,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,208 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:19,208 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:19,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:45:19,209 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-13 21:45:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1244501482, now seen corresponding path program 1 times [2022-07-13 21:45:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:19,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436615417] [2022-07-13 21:45:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:19,380 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-13 21:45:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:19,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436615417] [2022-07-13 21:45:19,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436615417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:19,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:19,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:45:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339287493] [2022-07-13 21:45:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:19,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:45:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:45:19,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:45:19,385 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2022-07-13 21:45:19,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:19,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2022-07-13 21:45:19,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:19,895 INFO L129 PetriNetUnfolder]: 869/2440 cut-off events. [2022-07-13 21:45:19,896 INFO L130 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-07-13 21:45:19,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 2440 events. 869/2440 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18951 event pairs, 141 based on Foata normal form. 0/2382 useless extension candidates. Maximal degree in co-relation 3854. Up to 609 conditions per place. [2022-07-13 21:45:19,908 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 21 selfloop transitions, 2 changer transitions 53/174 dead transitions. [2022-07-13 21:45:19,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 174 transitions, 500 flow [2022-07-13 21:45:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:45:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:45:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1100 transitions. [2022-07-13 21:45:19,912 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8856682769726248 [2022-07-13 21:45:19,912 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1100 transitions. [2022-07-13 21:45:19,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1100 transitions. [2022-07-13 21:45:19,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:19,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1100 transitions. [2022-07-13 21:45:19,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,917 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,918 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 9 states and 1100 transitions. [2022-07-13 21:45:19,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 174 transitions, 500 flow [2022-07-13 21:45:19,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 174 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:45:19,922 INFO L242 Difference]: Finished difference. Result has 154 places, 116 transitions, 260 flow [2022-07-13 21:45:19,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=154, PETRI_TRANSITIONS=116} [2022-07-13 21:45:19,923 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2022-07-13 21:45:19,924 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 116 transitions, 260 flow [2022-07-13 21:45:19,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:19,924 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:19,924 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] [2022-07-13 21:45:19,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:45:19,925 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-13 21:45:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -559800482, now seen corresponding path program 1 times [2022-07-13 21:45:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:19,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762000185] [2022-07-13 21:45:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:20,165 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-13 21:45:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762000185] [2022-07-13 21:45:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762000185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:20,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:45:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621081959] [2022-07-13 21:45:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:20,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:45:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:45:20,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:45:20,168 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-07-13 21:45:20,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 116 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:20,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:20,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-07-13 21:45:20,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:20,592 INFO L129 PetriNetUnfolder]: 895/1945 cut-off events. [2022-07-13 21:45:20,593 INFO L130 PetriNetUnfolder]: For 436/436 co-relation queries the response was YES. [2022-07-13 21:45:20,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3741 conditions, 1945 events. 895/1945 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12803 event pairs, 410 based on Foata normal form. 39/1926 useless extension candidates. Maximal degree in co-relation 3675. Up to 802 conditions per place. [2022-07-13 21:45:20,604 INFO L132 encePairwiseOnDemand]: 125/138 looper letters, 25 selfloop transitions, 11 changer transitions 52/184 dead transitions. [2022-07-13 21:45:20,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 184 transitions, 610 flow [2022-07-13 21:45:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:45:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-13 21:45:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1673 transitions. [2022-07-13 21:45:20,609 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8659420289855072 [2022-07-13 21:45:20,609 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1673 transitions. [2022-07-13 21:45:20,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1673 transitions. [2022-07-13 21:45:20,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:20,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1673 transitions. [2022-07-13 21:45:20,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 119.5) internal successors, (1673), 14 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:20,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:20,617 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:20,617 INFO L186 Difference]: Start difference. First operand has 154 places, 116 transitions, 260 flow. Second operand 14 states and 1673 transitions. [2022-07-13 21:45:20,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 184 transitions, 610 flow [2022-07-13 21:45:20,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 184 transitions, 570 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-07-13 21:45:20,629 INFO L242 Difference]: Finished difference. Result has 150 places, 124 transitions, 354 flow [2022-07-13 21:45:20,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=354, PETRI_PLACES=150, PETRI_TRANSITIONS=124} [2022-07-13 21:45:20,631 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 5 predicate places. [2022-07-13 21:45:20,631 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 124 transitions, 354 flow [2022-07-13 21:45:20,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:20,632 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:20,632 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:20,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:45:20,633 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-13 21:45:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1335538144, now seen corresponding path program 1 times [2022-07-13 21:45:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:20,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603969193] [2022-07-13 21:45:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:20,827 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-13 21:45:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:20,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603969193] [2022-07-13 21:45:20,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603969193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:20,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:20,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 21:45:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8888513] [2022-07-13 21:45:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:20,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 21:45:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 21:45:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:45:20,833 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-07-13 21:45:20,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 124 transitions, 354 flow. Second operand has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:20,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:20,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-07-13 21:45:20,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:21,400 INFO L129 PetriNetUnfolder]: 759/1582 cut-off events. [2022-07-13 21:45:21,401 INFO L130 PetriNetUnfolder]: For 4259/4728 co-relation queries the response was YES. [2022-07-13 21:45:21,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5764 conditions, 1582 events. 759/1582 cut-off events. For 4259/4728 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9728 event pairs, 391 based on Foata normal form. 33/1580 useless extension candidates. Maximal degree in co-relation 5687. Up to 832 conditions per place. [2022-07-13 21:45:21,413 INFO L132 encePairwiseOnDemand]: 123/138 looper letters, 36 selfloop transitions, 21 changer transitions 50/200 dead transitions. [2022-07-13 21:45:21,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 1102 flow [2022-07-13 21:45:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:45:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-13 21:45:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1968 transitions. [2022-07-13 21:45:21,417 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8388746803069054 [2022-07-13 21:45:21,417 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1968 transitions. [2022-07-13 21:45:21,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1968 transitions. [2022-07-13 21:45:21,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:21,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1968 transitions. [2022-07-13 21:45:21,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 115.76470588235294) internal successors, (1968), 17 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:21,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:21,424 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:21,424 INFO L186 Difference]: Start difference. First operand has 150 places, 124 transitions, 354 flow. Second operand 17 states and 1968 transitions. [2022-07-13 21:45:21,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 1102 flow [2022-07-13 21:45:21,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 200 transitions, 1082 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:21,430 INFO L242 Difference]: Finished difference. Result has 165 places, 141 transitions, 588 flow [2022-07-13 21:45:21,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=588, PETRI_PLACES=165, PETRI_TRANSITIONS=141} [2022-07-13 21:45:21,431 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 20 predicate places. [2022-07-13 21:45:21,431 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 141 transitions, 588 flow [2022-07-13 21:45:21,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:21,432 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:21,432 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:21,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:45:21,432 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-13 21:45:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 956932900, now seen corresponding path program 2 times [2022-07-13 21:45:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635999379] [2022-07-13 21:45:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:45:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635999379] [2022-07-13 21:45:21,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635999379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:21,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:21,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 21:45:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891661948] [2022-07-13 21:45:21,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:21,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 21:45:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 21:45:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:45:21,608 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-07-13 21:45:21,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 141 transitions, 588 flow. Second operand has 11 states, 11 states have (on average 113.45454545454545) internal successors, (1248), 11 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:21,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:21,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-07-13 21:45:21,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:22,053 INFO L129 PetriNetUnfolder]: 775/1590 cut-off events. [2022-07-13 21:45:22,054 INFO L130 PetriNetUnfolder]: For 10107/11139 co-relation queries the response was YES. [2022-07-13 21:45:22,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7760 conditions, 1590 events. 775/1590 cut-off events. For 10107/11139 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9555 event pairs, 385 based on Foata normal form. 55/1608 useless extension candidates. Maximal degree in co-relation 7672. Up to 793 conditions per place. [2022-07-13 21:45:22,069 INFO L132 encePairwiseOnDemand]: 125/138 looper letters, 33 selfloop transitions, 24 changer transitions 35/187 dead transitions. [2022-07-13 21:45:22,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 187 transitions, 1252 flow [2022-07-13 21:45:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1528 transitions. [2022-07-13 21:45:22,072 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8517279821627648 [2022-07-13 21:45:22,072 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1528 transitions. [2022-07-13 21:45:22,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1528 transitions. [2022-07-13 21:45:22,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:22,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1528 transitions. [2022-07-13 21:45:22,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.53846153846153) internal successors, (1528), 13 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,078 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,078 INFO L186 Difference]: Start difference. First operand has 165 places, 141 transitions, 588 flow. Second operand 13 states and 1528 transitions. [2022-07-13 21:45:22,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 187 transitions, 1252 flow [2022-07-13 21:45:22,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 187 transitions, 1178 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-07-13 21:45:22,086 INFO L242 Difference]: Finished difference. Result has 169 places, 144 transitions, 675 flow [2022-07-13 21:45:22,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=675, PETRI_PLACES=169, PETRI_TRANSITIONS=144} [2022-07-13 21:45:22,087 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 24 predicate places. [2022-07-13 21:45:22,088 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 144 transitions, 675 flow [2022-07-13 21:45:22,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.45454545454545) internal successors, (1248), 11 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,088 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:22,088 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:22,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:45:22,089 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-13 21:45:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1767006340, now seen corresponding path program 1 times [2022-07-13 21:45:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989818920] [2022-07-13 21:45:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:22,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:22,286 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-13 21:45:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:22,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989818920] [2022-07-13 21:45:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989818920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:22,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:22,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 21:45:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041708269] [2022-07-13 21:45:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:22,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:45:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:22,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:45:22,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:45:22,290 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-07-13 21:45:22,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 144 transitions, 675 flow. Second operand has 12 states, 12 states have (on average 111.5) internal successors, (1338), 12 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-13 21:45:22,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:22,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-07-13 21:45:22,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:22,954 INFO L129 PetriNetUnfolder]: 694/1584 cut-off events. [2022-07-13 21:45:22,954 INFO L130 PetriNetUnfolder]: For 18534/18999 co-relation queries the response was YES. [2022-07-13 21:45:22,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9151 conditions, 1584 events. 694/1584 cut-off events. For 18534/18999 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9754 event pairs, 209 based on Foata normal form. 38/1565 useless extension candidates. Maximal degree in co-relation 9055. Up to 619 conditions per place. [2022-07-13 21:45:22,971 INFO L132 encePairwiseOnDemand]: 124/138 looper letters, 57 selfloop transitions, 14 changer transitions 47/211 dead transitions. [2022-07-13 21:45:22,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 211 transitions, 1799 flow [2022-07-13 21:45:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 21:45:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-13 21:45:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2075 transitions. [2022-07-13 21:45:22,975 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8353462157809984 [2022-07-13 21:45:22,975 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2075 transitions. [2022-07-13 21:45:22,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2075 transitions. [2022-07-13 21:45:22,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:22,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2075 transitions. [2022-07-13 21:45:22,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 115.27777777777777) internal successors, (2075), 18 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 138.0) internal successors, (2622), 19 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,983 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 138.0) internal successors, (2622), 19 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:22,983 INFO L186 Difference]: Start difference. First operand has 169 places, 144 transitions, 675 flow. Second operand 18 states and 2075 transitions. [2022-07-13 21:45:22,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 211 transitions, 1799 flow [2022-07-13 21:45:22,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 211 transitions, 1703 flow, removed 33 selfloop flow, removed 8 redundant places. [2022-07-13 21:45:22,995 INFO L242 Difference]: Finished difference. Result has 183 places, 148 transitions, 751 flow [2022-07-13 21:45:22,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=751, PETRI_PLACES=183, PETRI_TRANSITIONS=148} [2022-07-13 21:45:22,996 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 38 predicate places. [2022-07-13 21:45:22,996 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 148 transitions, 751 flow [2022-07-13 21:45:22,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.5) internal successors, (1338), 12 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-13 21:45:22,997 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:22,997 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-13 21:45:22,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:45:22,997 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-13 21:45:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash 93545029, now seen corresponding path program 1 times [2022-07-13 21:45:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180839951] [2022-07-13 21:45:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:23,071 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-13 21:45:23,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180839951] [2022-07-13 21:45:23,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180839951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:23,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:23,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:45:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115122154] [2022-07-13 21:45:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:23,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:45:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:23,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:45:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:45:23,073 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-07-13 21:45:23,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 148 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:23,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:23,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-07-13 21:45:23,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:24,310 INFO L129 PetriNetUnfolder]: 4754/8162 cut-off events. [2022-07-13 21:45:24,311 INFO L130 PetriNetUnfolder]: For 154972/155463 co-relation queries the response was YES. [2022-07-13 21:45:24,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46187 conditions, 8162 events. 4754/8162 cut-off events. For 154972/155463 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 60564 event pairs, 190 based on Foata normal form. 117/8113 useless extension candidates. Maximal degree in co-relation 46087. Up to 2798 conditions per place. [2022-07-13 21:45:24,383 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 95 selfloop transitions, 14 changer transitions 87/294 dead transitions. [2022-07-13 21:45:24,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 294 transitions, 2866 flow [2022-07-13 21:45:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:45:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:45:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1210 transitions. [2022-07-13 21:45:24,386 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8768115942028986 [2022-07-13 21:45:24,386 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1210 transitions. [2022-07-13 21:45:24,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1210 transitions. [2022-07-13 21:45:24,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:24,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1210 transitions. [2022-07-13 21:45:24,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:24,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:24,391 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:24,391 INFO L186 Difference]: Start difference. First operand has 183 places, 148 transitions, 751 flow. Second operand 10 states and 1210 transitions. [2022-07-13 21:45:24,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 294 transitions, 2866 flow [2022-07-13 21:45:24,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 294 transitions, 2200 flow, removed 308 selfloop flow, removed 21 redundant places. [2022-07-13 21:45:24,454 INFO L242 Difference]: Finished difference. Result has 168 places, 155 transitions, 687 flow [2022-07-13 21:45:24,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=687, PETRI_PLACES=168, PETRI_TRANSITIONS=155} [2022-07-13 21:45:24,455 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 23 predicate places. [2022-07-13 21:45:24,456 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 155 transitions, 687 flow [2022-07-13 21:45:24,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:24,456 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:24,456 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:24,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:45:24,457 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-13 21:45:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash -117485868, now seen corresponding path program 1 times [2022-07-13 21:45:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:24,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286628510] [2022-07-13 21:45:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:24,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-13 21:45:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:24,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286628510] [2022-07-13 21:45:24,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286628510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:24,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:24,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153269089] [2022-07-13 21:45:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:24,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:24,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:24,536 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-07-13 21:45:24,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 155 transitions, 687 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:24,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:24,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-07-13 21:45:24,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:25,756 INFO L129 PetriNetUnfolder]: 4197/7785 cut-off events. [2022-07-13 21:45:25,756 INFO L130 PetriNetUnfolder]: For 90629/91035 co-relation queries the response was YES. [2022-07-13 21:45:25,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39942 conditions, 7785 events. 4197/7785 cut-off events. For 90629/91035 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 63067 event pairs, 164 based on Foata normal form. 220/7949 useless extension candidates. Maximal degree in co-relation 39854. Up to 1763 conditions per place. [2022-07-13 21:45:25,891 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 130 selfloop transitions, 28 changer transitions 74/330 dead transitions. [2022-07-13 21:45:25,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 330 transitions, 2839 flow [2022-07-13 21:45:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:45:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:45:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1571 transitions. [2022-07-13 21:45:25,895 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8756967670011149 [2022-07-13 21:45:25,895 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1571 transitions. [2022-07-13 21:45:25,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1571 transitions. [2022-07-13 21:45:25,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:25,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1571 transitions. [2022-07-13 21:45:25,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.84615384615384) internal successors, (1571), 13 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:25,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:25,901 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:25,901 INFO L186 Difference]: Start difference. First operand has 168 places, 155 transitions, 687 flow. Second operand 13 states and 1571 transitions. [2022-07-13 21:45:25,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 330 transitions, 2839 flow [2022-07-13 21:45:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 330 transitions, 2765 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:25,955 INFO L242 Difference]: Finished difference. Result has 182 places, 169 transitions, 893 flow [2022-07-13 21:45:25,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=893, PETRI_PLACES=182, PETRI_TRANSITIONS=169} [2022-07-13 21:45:25,956 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 37 predicate places. [2022-07-13 21:45:25,956 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 169 transitions, 893 flow [2022-07-13 21:45:25,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:25,957 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:25,957 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-13 21:45:25,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:45:25,957 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-13 21:45:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1590059871, now seen corresponding path program 1 times [2022-07-13 21:45:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:25,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113892005] [2022-07-13 21:45:25,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:26,052 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-13 21:45:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:26,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113892005] [2022-07-13 21:45:26,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113892005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:26,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:26,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:45:26,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992368219] [2022-07-13 21:45:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:26,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:45:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:26,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:45:26,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:45:26,055 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-07-13 21:45:26,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 169 transitions, 893 flow. Second operand has 8 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:26,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:26,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-07-13 21:45:26,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:27,284 INFO L129 PetriNetUnfolder]: 3696/7368 cut-off events. [2022-07-13 21:45:27,285 INFO L130 PetriNetUnfolder]: For 85340/85599 co-relation queries the response was YES. [2022-07-13 21:45:27,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39690 conditions, 7368 events. 3696/7368 cut-off events. For 85340/85599 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 64272 event pairs, 95 based on Foata normal form. 180/7520 useless extension candidates. Maximal degree in co-relation 39597. Up to 1595 conditions per place. [2022-07-13 21:45:27,334 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 121 selfloop transitions, 44 changer transitions 93/355 dead transitions. [2022-07-13 21:45:27,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 355 transitions, 3412 flow [2022-07-13 21:45:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:45:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-13 21:45:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1935 transitions. [2022-07-13 21:45:27,339 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.876358695652174 [2022-07-13 21:45:27,339 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1935 transitions. [2022-07-13 21:45:27,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1935 transitions. [2022-07-13 21:45:27,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:27,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1935 transitions. [2022-07-13 21:45:27,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.9375) internal successors, (1935), 16 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:27,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:27,346 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:27,346 INFO L186 Difference]: Start difference. First operand has 182 places, 169 transitions, 893 flow. Second operand 16 states and 1935 transitions. [2022-07-13 21:45:27,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 355 transitions, 3412 flow [2022-07-13 21:45:27,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 355 transitions, 3238 flow, removed 50 selfloop flow, removed 6 redundant places. [2022-07-13 21:45:27,539 INFO L242 Difference]: Finished difference. Result has 197 places, 187 transitions, 1163 flow [2022-07-13 21:45:27,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1163, PETRI_PLACES=197, PETRI_TRANSITIONS=187} [2022-07-13 21:45:27,540 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 52 predicate places. [2022-07-13 21:45:27,540 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 1163 flow [2022-07-13 21:45:27,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:27,540 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:27,541 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:27,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:45:27,541 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-13 21:45:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1014559032, now seen corresponding path program 1 times [2022-07-13 21:45:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:27,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638438476] [2022-07-13 21:45:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:27,665 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-13 21:45:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:27,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638438476] [2022-07-13 21:45:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638438476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:27,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:27,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367732381] [2022-07-13 21:45:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:27,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:27,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:27,671 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-07-13 21:45:27,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 1163 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:27,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:27,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-07-13 21:45:27,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:28,536 INFO L129 PetriNetUnfolder]: 1341/5406 cut-off events. [2022-07-13 21:45:28,536 INFO L130 PetriNetUnfolder]: For 27196/29227 co-relation queries the response was YES. [2022-07-13 21:45:28,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20837 conditions, 5406 events. 1341/5406 cut-off events. For 27196/29227 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 63768 event pairs, 79 based on Foata normal form. 29/5087 useless extension candidates. Maximal degree in co-relation 20738. Up to 1101 conditions per place. [2022-07-13 21:45:28,595 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 87 selfloop transitions, 2 changer transitions 16/254 dead transitions. [2022-07-13 21:45:28,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 254 transitions, 2019 flow [2022-07-13 21:45:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:45:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:45:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2022-07-13 21:45:28,597 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8819875776397516 [2022-07-13 21:45:28,597 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2022-07-13 21:45:28,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2022-07-13 21:45:28,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:28,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2022-07-13 21:45:28,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:28,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:28,601 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:28,601 INFO L186 Difference]: Start difference. First operand has 197 places, 187 transitions, 1163 flow. Second operand 7 states and 852 transitions. [2022-07-13 21:45:28,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 254 transitions, 2019 flow [2022-07-13 21:45:28,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 254 transitions, 1858 flow, removed 62 selfloop flow, removed 7 redundant places. [2022-07-13 21:45:28,979 INFO L242 Difference]: Finished difference. Result has 201 places, 188 transitions, 1021 flow [2022-07-13 21:45:28,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1021, PETRI_PLACES=201, PETRI_TRANSITIONS=188} [2022-07-13 21:45:28,981 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 56 predicate places. [2022-07-13 21:45:28,981 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 188 transitions, 1021 flow [2022-07-13 21:45:28,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:28,986 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:28,986 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:45:28,987 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-13 21:45:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1806897734, now seen corresponding path program 2 times [2022-07-13 21:45:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:28,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831026341] [2022-07-13 21:45:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:29,099 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-13 21:45:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:29,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831026341] [2022-07-13 21:45:29,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831026341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:29,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:29,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:45:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233847854] [2022-07-13 21:45:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:29,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:45:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:45:29,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:45:29,102 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-07-13 21:45:29,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 188 transitions, 1021 flow. Second operand has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:29,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:29,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-07-13 21:45:29,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:31,334 INFO L129 PetriNetUnfolder]: 6843/13635 cut-off events. [2022-07-13 21:45:31,338 INFO L130 PetriNetUnfolder]: For 144974/145841 co-relation queries the response was YES. [2022-07-13 21:45:31,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68016 conditions, 13635 events. 6843/13635 cut-off events. For 144974/145841 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 133421 event pairs, 230 based on Foata normal form. 250/13647 useless extension candidates. Maximal degree in co-relation 67969. Up to 3080 conditions per place. [2022-07-13 21:45:31,448 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 107 selfloop transitions, 49 changer transitions 100/354 dead transitions. [2022-07-13 21:45:31,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 354 transitions, 3142 flow [2022-07-13 21:45:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 21:45:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-13 21:45:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2253 transitions. [2022-07-13 21:45:31,455 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8592677345537757 [2022-07-13 21:45:31,462 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2253 transitions. [2022-07-13 21:45:31,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2253 transitions. [2022-07-13 21:45:31,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:31,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2253 transitions. [2022-07-13 21:45:31,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.57894736842105) internal successors, (2253), 19 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:31,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:31,482 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:31,482 INFO L186 Difference]: Start difference. First operand has 201 places, 188 transitions, 1021 flow. Second operand 19 states and 2253 transitions. [2022-07-13 21:45:31,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 354 transitions, 3142 flow [2022-07-13 21:45:32,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 354 transitions, 3074 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-07-13 21:45:32,012 INFO L242 Difference]: Finished difference. Result has 217 places, 188 transitions, 1103 flow [2022-07-13 21:45:32,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1103, PETRI_PLACES=217, PETRI_TRANSITIONS=188} [2022-07-13 21:45:32,013 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 72 predicate places. [2022-07-13 21:45:32,013 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 188 transitions, 1103 flow [2022-07-13 21:45:32,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:32,013 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:32,014 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] [2022-07-13 21:45:32,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:45:32,014 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-13 21:45:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 830011452, now seen corresponding path program 1 times [2022-07-13 21:45:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:32,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515029515] [2022-07-13 21:45:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:32,150 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-13 21:45:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515029515] [2022-07-13 21:45:32,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515029515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:32,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:32,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176994948] [2022-07-13 21:45:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:32,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:32,152 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-07-13 21:45:32,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 188 transitions, 1103 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:32,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:32,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-07-13 21:45:32,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:33,501 INFO L129 PetriNetUnfolder]: 2110/8580 cut-off events. [2022-07-13 21:45:33,501 INFO L130 PetriNetUnfolder]: For 29232/30923 co-relation queries the response was YES. [2022-07-13 21:45:33,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30370 conditions, 8580 events. 2110/8580 cut-off events. For 29232/30923 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 115420 event pairs, 59 based on Foata normal form. 42/8059 useless extension candidates. Maximal degree in co-relation 30263. Up to 959 conditions per place. [2022-07-13 21:45:33,582 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 69 selfloop transitions, 2 changer transitions 5/226 dead transitions. [2022-07-13 21:45:33,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 226 transitions, 1547 flow [2022-07-13 21:45:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:45:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:45:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2022-07-13 21:45:33,599 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-07-13 21:45:33,599 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2022-07-13 21:45:33,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2022-07-13 21:45:33,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:33,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2022-07-13 21:45:33,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:33,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:33,602 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:33,603 INFO L186 Difference]: Start difference. First operand has 217 places, 188 transitions, 1103 flow. Second operand 7 states and 828 transitions. [2022-07-13 21:45:33,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 226 transitions, 1547 flow [2022-07-13 21:45:34,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 226 transitions, 1266 flow, removed 81 selfloop flow, removed 26 redundant places. [2022-07-13 21:45:34,161 INFO L242 Difference]: Finished difference. Result has 199 places, 189 transitions, 901 flow [2022-07-13 21:45:34,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=901, PETRI_PLACES=199, PETRI_TRANSITIONS=189} [2022-07-13 21:45:34,163 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 54 predicate places. [2022-07-13 21:45:34,163 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 189 transitions, 901 flow [2022-07-13 21:45:34,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:34,164 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:34,165 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:34,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:45:34,165 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-13 21:45:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1372679060, now seen corresponding path program 2 times [2022-07-13 21:45:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:34,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158569730] [2022-07-13 21:45:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:45:34,343 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-13 21:45:34,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:45:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158569730] [2022-07-13 21:45:34,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158569730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:45:34,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:45:34,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:45:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186221429] [2022-07-13 21:45:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:45:34,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:45:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:45:34,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:45:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:45:34,346 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-07-13 21:45:34,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 189 transitions, 901 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:34,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:45:34,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-07-13 21:45:34,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:45:36,444 INFO L129 PetriNetUnfolder]: 4300/17173 cut-off events. [2022-07-13 21:45:36,445 INFO L130 PetriNetUnfolder]: For 23590/24518 co-relation queries the response was YES. [2022-07-13 21:45:36,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46916 conditions, 17173 events. 4300/17173 cut-off events. For 23590/24518 co-relation queries the response was YES. Maximal size of possible extension queue 2255. Compared 259074 event pairs, 125 based on Foata normal form. 82/15972 useless extension candidates. Maximal degree in co-relation 46879. Up to 1971 conditions per place. [2022-07-13 21:45:36,571 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 31 selfloop transitions, 1 changer transitions 56/235 dead transitions. [2022-07-13 21:45:36,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 235 transitions, 1353 flow [2022-07-13 21:45:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:45:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:45:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2022-07-13 21:45:36,573 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8509316770186336 [2022-07-13 21:45:36,573 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2022-07-13 21:45:36,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2022-07-13 21:45:36,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:45:36,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2022-07-13 21:45:36,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:36,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:36,576 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:36,576 INFO L186 Difference]: Start difference. First operand has 199 places, 189 transitions, 901 flow. Second operand 7 states and 822 transitions. [2022-07-13 21:45:36,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 235 transitions, 1353 flow [2022-07-13 21:45:38,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 235 transitions, 1342 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-13 21:45:38,115 INFO L242 Difference]: Finished difference. Result has 203 places, 175 transitions, 818 flow [2022-07-13 21:45:38,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=818, PETRI_PLACES=203, PETRI_TRANSITIONS=175} [2022-07-13 21:45:38,116 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 58 predicate places. [2022-07-13 21:45:38,116 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 175 transitions, 818 flow [2022-07-13 21:45:38,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:45:38,116 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:45:38,116 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] [2022-07-13 21:45:38,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:45:38,117 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-13 21:45:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:45:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1262467446, now seen corresponding path program 3 times [2022-07-13 21:45:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:45:38,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098036777] [2022-07-13 21:45:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:45:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:45:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:45:38,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:45:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:45:38,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:45:38,290 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:45:38,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-13 21:45:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-13 21:45:38,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-13 21:45:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-13 21:45:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-13 21:45:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-13 21:45:38,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-13 21:45:38,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:45:38,294 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:45:38,299 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:45:38,299 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:45:38,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:45:38 BasicIcfg [2022-07-13 21:45:38,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:45:38,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:45:38,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:45:38,490 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:45:38,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:45:18" (3/4) ... [2022-07-13 21:45:38,492 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:45:38,611 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:45:38,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:45:38,612 INFO L158 Benchmark]: Toolchain (without parser) took 21883.89ms. Allocated memory was 159.4MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 124.0MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 826.0MB. Max. memory is 16.1GB. [2022-07-13 21:45:38,613 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:45:38,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.22ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 121.1MB in the end (delta: 2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:45:38,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.11ms. Allocated memory is still 159.4MB. Free memory was 121.1MB in the beginning and 117.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:45:38,614 INFO L158 Benchmark]: Boogie Preprocessor took 67.54ms. Allocated memory is still 159.4MB. Free memory was 117.8MB in the beginning and 114.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:45:38,614 INFO L158 Benchmark]: RCFGBuilder took 941.00ms. Allocated memory is still 159.4MB. Free memory was 114.8MB in the beginning and 109.9MB in the end (delta: 4.9MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. [2022-07-13 21:45:38,616 INFO L158 Benchmark]: TraceAbstraction took 20182.41ms. Allocated memory was 159.4MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 109.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-13 21:45:38,616 INFO L158 Benchmark]: Witness Printer took 121.49ms. Allocated memory is still 7.1GB. Free memory was 6.3GB in the beginning and 6.2GB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-07-13 21:45:38,618 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.16ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.22ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 121.1MB in the end (delta: 2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.11ms. Allocated memory is still 159.4MB. Free memory was 121.1MB in the beginning and 117.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.54ms. Allocated memory is still 159.4MB. Free memory was 117.8MB in the beginning and 114.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 941.00ms. Allocated memory is still 159.4MB. Free memory was 114.8MB in the beginning and 109.9MB in the end (delta: 4.9MB). Peak memory consumption was 73.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20182.41ms. Allocated memory was 159.4MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 109.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 121.49ms. Allocated memory is still 7.1GB. Free memory was 6.3GB in the beginning and 6.2GB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L726] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L729] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L730] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L731] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L736] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L737] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L738] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}] [L739] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L740] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L741] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L742] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L853] 0 pthread_t t489; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489={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] [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-3, t489={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] [L855] 0 pthread_t t490; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, t490={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] [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-2, t489={5:0}, t490={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] [L857] 0 pthread_t t491; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={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] [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={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] [L859] 0 pthread_t t492; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={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] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L788] 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) [L788] 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) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 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 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 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 [L758] 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) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] 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) [L758] 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) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 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 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 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 [L831] 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) [L831] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L833] 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 [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L835] 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 [L808] 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) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] 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) [L808] 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) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 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 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 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 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={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] [L864] 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=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] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 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) [L866] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L866] 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) [L866] 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) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L868] 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 [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L870] 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 [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 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) [L877] 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) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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)) [L882] 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)) [L882] 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)) [L883] 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)) [L883] 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)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=50, 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] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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: 858]: 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: 856]: 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: 854]: 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: 860]: 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, 175 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: 19.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 993 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 993 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1222 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2069 IncrementalHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 95 mSDtfsCounter, 2069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1163occurred in iteration=9, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1315 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 5613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-13 21:45:38,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE