./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/mix033_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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:08:20,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:08:20,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:08:20,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:08:20,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:08:20,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:08:20,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:08:20,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:08:20,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:08:20,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:08:20,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:08:20,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:08:20,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:08:20,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:08:20,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:08:20,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:08:20,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:08:20,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:08:20,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:08:20,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:08:20,115 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:08:20,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:08:20,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:08:20,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:08:20,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:08:20,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:08:20,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:08:20,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:08:20,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:08:20,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:08:20,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:08:20,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:08:20,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:08:20,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:08:20,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:08:20,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:08:20,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:08:20,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:08:20,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:08:20,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:08:20,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:08:20,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:08:20,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:08:20,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:08:20,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:08:20,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:08:20,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:08:20,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:08:20,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:08:20,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:08:20,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:08:20,160 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:08:20,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:08:20,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:08:20,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:08:20,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:08:20,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:08:20,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:08:20,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:08:20,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:08:20,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:08:20,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:08:20,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:08:20,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:08:20,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:08:20,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:08:20,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:08:20,164 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:08:20,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:08:20,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:08:20,165 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2022-07-19 21:08:20,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:08:20,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:08:20,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:08:20,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:08:20,416 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:08:20,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2022-07-19 21:08:20,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5135a5550/df7dacc5f81e4edcbc243f48daf47ffe/FLAGb55d43a7a [2022-07-19 21:08:20,915 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:08:20,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2022-07-19 21:08:20,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5135a5550/df7dacc5f81e4edcbc243f48daf47ffe/FLAGb55d43a7a [2022-07-19 21:08:20,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5135a5550/df7dacc5f81e4edcbc243f48daf47ffe [2022-07-19 21:08:20,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:08:20,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:08:20,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:08:20,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:08:20,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:08:20,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:08:20" (1/1) ... [2022-07-19 21:08:20,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc7bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:20, skipping insertion in model container [2022-07-19 21:08:20,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:08:20" (1/1) ... [2022-07-19 21:08:20,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:08:21,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:08:21,184 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/mix033_tso.oepc.i[949,962] [2022-07-19 21:08:21,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:08:21,369 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:08:21,384 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/mix033_tso.oepc.i[949,962] [2022-07-19 21:08:21,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:08:21,438 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:08:21,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21 WrapperNode [2022-07-19 21:08:21,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:08:21,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:08:21,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:08:21,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:08:21,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,479 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 285 [2022-07-19 21:08:21,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:08:21,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:08:21,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:08:21,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:08:21,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:08:21,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:08:21,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:08:21,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:08:21,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (1/1) ... [2022-07-19 21:08:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:08:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:08:21,589 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-19 21:08:21,635 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-19 21:08:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:08:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:08:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:08:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:08:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:08:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-19 21:08:21,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-19 21:08:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-19 21:08:21,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-19 21:08:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-19 21:08:21,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-19 21:08:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:08:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:08:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:08:21,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:08:21,671 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:08:21,831 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:08:21,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:08:22,268 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:08:22,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:08:22,508 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:08:22,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:08:22 BoogieIcfgContainer [2022-07-19 21:08:22,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:08:22,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:08:22,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:08:22,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:08:22,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:08:20" (1/3) ... [2022-07-19 21:08:22,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf30937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:08:22, skipping insertion in model container [2022-07-19 21:08:22,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:21" (2/3) ... [2022-07-19 21:08:22,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf30937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:08:22, skipping insertion in model container [2022-07-19 21:08:22,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:08:22" (3/3) ... [2022-07-19 21:08:22,517 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2022-07-19 21:08:22,523 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:08:22,529 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:08:22,530 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:08:22,530 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:08:22,569 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-19 21:08:22,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-07-19 21:08:22,640 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2022-07-19 21:08:22,657 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:08:22,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-07-19 21:08:22,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-07-19 21:08:22,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow [2022-07-19 21:08:22,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:08:22,684 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@757191b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a6a253 [2022-07-19 21:08:22,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-19 21:08:22,697 INFO L129 PetriNetUnfolder]: 0/64 cut-off events. [2022-07-19 21:08:22,698 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:08:22,698 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:22,698 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] [2022-07-19 21:08:22,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 137669064, now seen corresponding path program 1 times [2022-07-19 21:08:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278526167] [2022-07-19 21:08:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:22,961 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-19 21:08:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:22,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278526167] [2022-07-19 21:08:22,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278526167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:22,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:22,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:08:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855931499] [2022-07-19 21:08:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:22,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:08:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:08:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:08:22,997 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2022-07-19 21:08:23,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:23,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2022-07-19 21:08:23,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:23,148 INFO L129 PetriNetUnfolder]: 57/358 cut-off events. [2022-07-19 21:08:23,148 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-19 21:08:23,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 358 events. 57/358 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1588 event pairs, 11 based on Foata normal form. 19/362 useless extension candidates. Maximal degree in co-relation 427. Up to 75 conditions per place. [2022-07-19 21:08:23,155 INFO L132 encePairwiseOnDemand]: 118/123 looper letters, 13 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-07-19 21:08:23,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 121 transitions, 284 flow [2022-07-19 21:08:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:08:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:08:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-07-19 21:08:23,173 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.940379403794038 [2022-07-19 21:08:23,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-07-19 21:08:23,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-07-19 21:08:23,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:23,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-07-19 21:08:23,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,191 INFO L186 Difference]: Start difference. First operand has 128 places, 120 transitions, 249 flow. Second operand 3 states and 347 transitions. [2022-07-19 21:08:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 121 transitions, 284 flow [2022-07-19 21:08:23,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 121 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:08:23,199 INFO L242 Difference]: Finished difference. Result has 125 places, 116 transitions, 242 flow [2022-07-19 21:08:23,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=125, PETRI_TRANSITIONS=116} [2022-07-19 21:08:23,204 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2022-07-19 21:08:23,205 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 116 transitions, 242 flow [2022-07-19 21:08:23,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,206 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:23,206 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] [2022-07-19 21:08:23,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:08:23,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1868569681, now seen corresponding path program 1 times [2022-07-19 21:08:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:23,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613644292] [2022-07-19 21:08:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:23,469 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-19 21:08:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:23,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613644292] [2022-07-19 21:08:23,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613644292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:23,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:23,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:08:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345898998] [2022-07-19 21:08:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:23,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:08:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:23,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:08:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:08:23,476 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2022-07-19 21:08:23,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:23,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2022-07-19 21:08:23,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:23,789 INFO L129 PetriNetUnfolder]: 330/1091 cut-off events. [2022-07-19 21:08:23,789 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-07-19 21:08:23,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 1091 events. 330/1091 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7327 event pairs, 53 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1663. Up to 257 conditions per place. [2022-07-19 21:08:23,794 INFO L132 encePairwiseOnDemand]: 117/123 looper letters, 18 selfloop transitions, 2 changer transitions 45/153 dead transitions. [2022-07-19 21:08:23,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 153 transitions, 438 flow [2022-07-19 21:08:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:08:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:08:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 974 transitions. [2022-07-19 21:08:23,797 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8798554652213189 [2022-07-19 21:08:23,797 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 974 transitions. [2022-07-19 21:08:23,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 974 transitions. [2022-07-19 21:08:23,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:23,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 974 transitions. [2022-07-19 21:08:23,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,802 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,803 INFO L186 Difference]: Start difference. First operand has 125 places, 116 transitions, 242 flow. Second operand 9 states and 974 transitions. [2022-07-19 21:08:23,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 153 transitions, 438 flow [2022-07-19 21:08:23,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 153 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:08:23,806 INFO L242 Difference]: Finished difference. Result has 138 places, 104 transitions, 234 flow [2022-07-19 21:08:23,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=138, PETRI_TRANSITIONS=104} [2022-07-19 21:08:23,807 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 10 predicate places. [2022-07-19 21:08:23,807 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 234 flow [2022-07-19 21:08:23,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,807 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:23,808 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:23,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:08:23,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash -521217521, now seen corresponding path program 1 times [2022-07-19 21:08:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:23,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673352849] [2022-07-19 21:08:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:24,013 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-19 21:08:24,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:24,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673352849] [2022-07-19 21:08:24,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673352849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:24,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:24,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:08:24,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487198461] [2022-07-19 21:08:24,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:24,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:08:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:24,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:08:24,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:08:24,016 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-07-19 21:08:24,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 104 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:24,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-07-19 21:08:24,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:24,380 INFO L129 PetriNetUnfolder]: 314/811 cut-off events. [2022-07-19 21:08:24,380 INFO L130 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-07-19 21:08:24,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 811 events. 314/811 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4516 event pairs, 145 based on Foata normal form. 18/805 useless extension candidates. Maximal degree in co-relation 1495. Up to 319 conditions per place. [2022-07-19 21:08:24,385 INFO L132 encePairwiseOnDemand]: 111/123 looper letters, 20 selfloop transitions, 10 changer transitions 44/159 dead transitions. [2022-07-19 21:08:24,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 159 transitions, 526 flow [2022-07-19 21:08:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:08:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-19 21:08:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1562 transitions. [2022-07-19 21:08:24,388 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8466124661246612 [2022-07-19 21:08:24,388 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1562 transitions. [2022-07-19 21:08:24,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1562 transitions. [2022-07-19 21:08:24,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:24,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1562 transitions. [2022-07-19 21:08:24,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 104.13333333333334) internal successors, (1562), 15 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 123.0) internal successors, (1968), 16 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-19 21:08:24,395 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 123.0) internal successors, (1968), 16 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-19 21:08:24,395 INFO L186 Difference]: Start difference. First operand has 138 places, 104 transitions, 234 flow. Second operand 15 states and 1562 transitions. [2022-07-19 21:08:24,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 159 transitions, 526 flow [2022-07-19 21:08:24,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 159 transitions, 486 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-07-19 21:08:24,401 INFO L242 Difference]: Finished difference. Result has 137 places, 110 transitions, 302 flow [2022-07-19 21:08:24,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=302, PETRI_PLACES=137, PETRI_TRANSITIONS=110} [2022-07-19 21:08:24,402 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2022-07-19 21:08:24,402 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 110 transitions, 302 flow [2022-07-19 21:08:24,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,402 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:24,403 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] [2022-07-19 21:08:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:08:24,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash -766875248, now seen corresponding path program 1 times [2022-07-19 21:08:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:24,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044188698] [2022-07-19 21:08:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:24,500 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-19 21:08:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044188698] [2022-07-19 21:08:24,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044188698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:24,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:24,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:08:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945580118] [2022-07-19 21:08:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:24,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:08:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:24,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:08:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:08:24,503 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2022-07-19 21:08:24,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 110 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:24,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2022-07-19 21:08:24,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:24,753 INFO L129 PetriNetUnfolder]: 266/815 cut-off events. [2022-07-19 21:08:24,753 INFO L130 PetriNetUnfolder]: For 1307/1316 co-relation queries the response was YES. [2022-07-19 21:08:24,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 815 events. 266/815 cut-off events. For 1307/1316 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4608 event pairs, 87 based on Foata normal form. 20/805 useless extension candidates. Maximal degree in co-relation 1999. Up to 196 conditions per place. [2022-07-19 21:08:24,759 INFO L132 encePairwiseOnDemand]: 117/123 looper letters, 31 selfloop transitions, 10 changer transitions 12/143 dead transitions. [2022-07-19 21:08:24,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 143 transitions, 571 flow [2022-07-19 21:08:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:08:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:08:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 968 transitions. [2022-07-19 21:08:24,762 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8744354110207768 [2022-07-19 21:08:24,762 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 968 transitions. [2022-07-19 21:08:24,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 968 transitions. [2022-07-19 21:08:24,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:24,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 968 transitions. [2022-07-19 21:08:24,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,766 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,766 INFO L186 Difference]: Start difference. First operand has 137 places, 110 transitions, 302 flow. Second operand 9 states and 968 transitions. [2022-07-19 21:08:24,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 143 transitions, 571 flow [2022-07-19 21:08:24,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 143 transitions, 545 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-07-19 21:08:24,772 INFO L242 Difference]: Finished difference. Result has 134 places, 118 transitions, 365 flow [2022-07-19 21:08:24,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=134, PETRI_TRANSITIONS=118} [2022-07-19 21:08:24,773 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2022-07-19 21:08:24,773 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 118 transitions, 365 flow [2022-07-19 21:08:24,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,773 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:24,774 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:24,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:08:24,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2083963855, now seen corresponding path program 1 times [2022-07-19 21:08:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:24,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990805606] [2022-07-19 21:08:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:24,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:24,876 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-19 21:08:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:24,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990805606] [2022-07-19 21:08:24,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990805606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:24,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:24,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:08:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655190753] [2022-07-19 21:08:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:08:24,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:08:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:08:24,880 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-07-19 21:08:24,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 118 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:24,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:24,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-07-19 21:08:24,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:25,248 INFO L129 PetriNetUnfolder]: 943/2164 cut-off events. [2022-07-19 21:08:25,248 INFO L130 PetriNetUnfolder]: For 3164/3183 co-relation queries the response was YES. [2022-07-19 21:08:25,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 2164 events. 943/2164 cut-off events. For 3164/3183 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15708 event pairs, 46 based on Foata normal form. 2/2120 useless extension candidates. Maximal degree in co-relation 5441. Up to 619 conditions per place. [2022-07-19 21:08:25,260 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 50 selfloop transitions, 13 changer transitions 30/186 dead transitions. [2022-07-19 21:08:25,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 186 transitions, 829 flow [2022-07-19 21:08:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:08:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:08:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1072 transitions. [2022-07-19 21:08:25,263 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8715447154471545 [2022-07-19 21:08:25,263 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1072 transitions. [2022-07-19 21:08:25,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1072 transitions. [2022-07-19 21:08:25,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:25,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1072 transitions. [2022-07-19 21:08:25,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.2) internal successors, (1072), 10 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,267 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 123.0) internal successors, (1353), 11 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,267 INFO L186 Difference]: Start difference. First operand has 134 places, 118 transitions, 365 flow. Second operand 10 states and 1072 transitions. [2022-07-19 21:08:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 186 transitions, 829 flow [2022-07-19 21:08:25,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 186 transitions, 815 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-07-19 21:08:25,275 INFO L242 Difference]: Finished difference. Result has 148 places, 129 transitions, 449 flow [2022-07-19 21:08:25,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=449, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2022-07-19 21:08:25,276 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 20 predicate places. [2022-07-19 21:08:25,276 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 449 flow [2022-07-19 21:08:25,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,277 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:25,277 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-19 21:08:25,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:08:25,277 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -844549094, now seen corresponding path program 1 times [2022-07-19 21:08:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:25,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884183417] [2022-07-19 21:08:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:25,364 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-19 21:08:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:25,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884183417] [2022-07-19 21:08:25,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884183417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:25,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:25,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:08:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709574151] [2022-07-19 21:08:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:08:25,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:08:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:08:25,367 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-07-19 21:08:25,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 449 flow. Second operand has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:25,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-07-19 21:08:25,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:25,769 INFO L129 PetriNetUnfolder]: 737/1808 cut-off events. [2022-07-19 21:08:25,769 INFO L130 PetriNetUnfolder]: For 3571/3599 co-relation queries the response was YES. [2022-07-19 21:08:25,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5589 conditions, 1808 events. 737/1808 cut-off events. For 3571/3599 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13355 event pairs, 55 based on Foata normal form. 38/1826 useless extension candidates. Maximal degree in co-relation 5509. Up to 305 conditions per place. [2022-07-19 21:08:25,781 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 57 selfloop transitions, 24 changer transitions 48/215 dead transitions. [2022-07-19 21:08:25,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 215 transitions, 1211 flow [2022-07-19 21:08:25,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:08:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:08:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1392 transitions. [2022-07-19 21:08:25,784 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8705440900562852 [2022-07-19 21:08:25,784 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1392 transitions. [2022-07-19 21:08:25,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1392 transitions. [2022-07-19 21:08:25,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:25,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1392 transitions. [2022-07-19 21:08:25,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 107.07692307692308) internal successors, (1392), 13 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,789 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 123.0) internal successors, (1722), 14 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,789 INFO L186 Difference]: Start difference. First operand has 148 places, 129 transitions, 449 flow. Second operand 13 states and 1392 transitions. [2022-07-19 21:08:25,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 215 transitions, 1211 flow [2022-07-19 21:08:25,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 215 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:08:25,798 INFO L242 Difference]: Finished difference. Result has 165 places, 136 transitions, 600 flow [2022-07-19 21:08:25,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=600, PETRI_PLACES=165, PETRI_TRANSITIONS=136} [2022-07-19 21:08:25,799 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 37 predicate places. [2022-07-19 21:08:25,799 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 136 transitions, 600 flow [2022-07-19 21:08:25,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,800 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:25,800 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-19 21:08:25,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:08:25,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 917386977, now seen corresponding path program 1 times [2022-07-19 21:08:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:25,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793906531] [2022-07-19 21:08:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:25,926 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-19 21:08:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:25,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793906531] [2022-07-19 21:08:25,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793906531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:25,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:25,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:08:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919201499] [2022-07-19 21:08:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:25,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:08:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:08:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:08:25,929 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-07-19 21:08:25,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 136 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:25,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:25,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-07-19 21:08:25,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:26,332 INFO L129 PetriNetUnfolder]: 630/1631 cut-off events. [2022-07-19 21:08:26,332 INFO L130 PetriNetUnfolder]: For 4551/4584 co-relation queries the response was YES. [2022-07-19 21:08:26,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 1631 events. 630/1631 cut-off events. For 4551/4584 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12676 event pairs, 44 based on Foata normal form. 19/1636 useless extension candidates. Maximal degree in co-relation 5603. Up to 235 conditions per place. [2022-07-19 21:08:26,343 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 49 selfloop transitions, 28 changer transitions 40/203 dead transitions. [2022-07-19 21:08:26,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 203 transitions, 1246 flow [2022-07-19 21:08:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:08:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:08:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1678 transitions. [2022-07-19 21:08:26,374 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8526422764227642 [2022-07-19 21:08:26,374 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1678 transitions. [2022-07-19 21:08:26,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1678 transitions. [2022-07-19 21:08:26,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:26,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1678 transitions. [2022-07-19 21:08:26,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 104.875) internal successors, (1678), 16 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 123.0) internal successors, (2091), 17 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,382 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 123.0) internal successors, (2091), 17 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,382 INFO L186 Difference]: Start difference. First operand has 165 places, 136 transitions, 600 flow. Second operand 16 states and 1678 transitions. [2022-07-19 21:08:26,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 203 transitions, 1246 flow [2022-07-19 21:08:26,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 203 transitions, 1060 flow, removed 83 selfloop flow, removed 15 redundant places. [2022-07-19 21:08:26,411 INFO L242 Difference]: Finished difference. Result has 166 places, 137 transitions, 596 flow [2022-07-19 21:08:26,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=596, PETRI_PLACES=166, PETRI_TRANSITIONS=137} [2022-07-19 21:08:26,412 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 38 predicate places. [2022-07-19 21:08:26,412 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 137 transitions, 596 flow [2022-07-19 21:08:26,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.125) internal successors, (809), 8 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,413 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:26,413 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-19 21:08:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:08:26,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 127523976, now seen corresponding path program 1 times [2022-07-19 21:08:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:26,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197014295] [2022-07-19 21:08:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:26,508 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-19 21:08:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:26,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197014295] [2022-07-19 21:08:26,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197014295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:26,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:26,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:08:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862090904] [2022-07-19 21:08:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:26,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:08:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:08:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:08:26,511 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 123 [2022-07-19 21:08:26,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 137 transitions, 596 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:26,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 123 [2022-07-19 21:08:26,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:26,704 INFO L129 PetriNetUnfolder]: 188/1154 cut-off events. [2022-07-19 21:08:26,704 INFO L130 PetriNetUnfolder]: For 2311/2499 co-relation queries the response was YES. [2022-07-19 21:08:26,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1154 events. 188/1154 cut-off events. For 2311/2499 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10594 event pairs, 17 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 3232. Up to 135 conditions per place. [2022-07-19 21:08:26,713 INFO L132 encePairwiseOnDemand]: 117/123 looper letters, 24 selfloop transitions, 2 changer transitions 12/153 dead transitions. [2022-07-19 21:08:26,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 153 transitions, 725 flow [2022-07-19 21:08:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:08:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:08:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 731 transitions. [2022-07-19 21:08:26,715 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8490127758420442 [2022-07-19 21:08:26,715 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 731 transitions. [2022-07-19 21:08:26,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 731 transitions. [2022-07-19 21:08:26,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:26,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 731 transitions. [2022-07-19 21:08:26,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,719 INFO L186 Difference]: Start difference. First operand has 166 places, 137 transitions, 596 flow. Second operand 7 states and 731 transitions. [2022-07-19 21:08:26,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 153 transitions, 725 flow [2022-07-19 21:08:26,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 153 transitions, 635 flow, removed 15 selfloop flow, removed 15 redundant places. [2022-07-19 21:08:26,733 INFO L242 Difference]: Finished difference. Result has 159 places, 137 transitions, 520 flow [2022-07-19 21:08:26,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=159, PETRI_TRANSITIONS=137} [2022-07-19 21:08:26,734 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 31 predicate places. [2022-07-19 21:08:26,734 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 137 transitions, 520 flow [2022-07-19 21:08:26,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,735 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:26,735 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-19 21:08:26,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:08:26,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:26,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2032868780, now seen corresponding path program 2 times [2022-07-19 21:08:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:26,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612138090] [2022-07-19 21:08:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:26,859 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-19 21:08:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:26,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612138090] [2022-07-19 21:08:26,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612138090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:26,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:26,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:08:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66542863] [2022-07-19 21:08:26,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:26,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:08:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:08:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:08:26,862 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123 [2022-07-19 21:08:26,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 137 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:26,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:26,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123 [2022-07-19 21:08:26,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:27,217 INFO L129 PetriNetUnfolder]: 400/2394 cut-off events. [2022-07-19 21:08:27,218 INFO L130 PetriNetUnfolder]: For 2372/2445 co-relation queries the response was YES. [2022-07-19 21:08:27,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5785 conditions, 2394 events. 400/2394 cut-off events. For 2372/2445 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 26863 event pairs, 23 based on Foata normal form. 2/2260 useless extension candidates. Maximal degree in co-relation 5759. Up to 285 conditions per place. [2022-07-19 21:08:27,229 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 25 selfloop transitions, 1 changer transitions 31/169 dead transitions. [2022-07-19 21:08:27,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 169 transitions, 756 flow [2022-07-19 21:08:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:08:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:08:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2022-07-19 21:08:27,232 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8364950316169828 [2022-07-19 21:08:27,232 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2022-07-19 21:08:27,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2022-07-19 21:08:27,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:27,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2022-07-19 21:08:27,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.88888888888889) internal successors, (926), 9 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:27,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:27,236 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:27,236 INFO L186 Difference]: Start difference. First operand has 159 places, 137 transitions, 520 flow. Second operand 9 states and 926 transitions. [2022-07-19 21:08:27,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 169 transitions, 756 flow [2022-07-19 21:08:27,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 169 transitions, 745 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-19 21:08:27,258 INFO L242 Difference]: Finished difference. Result has 167 places, 134 transitions, 537 flow [2022-07-19 21:08:27,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=537, PETRI_PLACES=167, PETRI_TRANSITIONS=134} [2022-07-19 21:08:27,260 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 39 predicate places. [2022-07-19 21:08:27,260 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 134 transitions, 537 flow [2022-07-19 21:08:27,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:27,260 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:27,260 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-19 21:08:27,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:08:27,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:27,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash -92664792, now seen corresponding path program 3 times [2022-07-19 21:08:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:27,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572211808] [2022-07-19 21:08:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:08:27,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:08:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:08:27,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:08:27,395 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:08:27,396 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-19 21:08:27,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-19 21:08:27,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-19 21:08:27,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-19 21:08:27,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-19 21:08:27,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-19 21:08:27,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:08:27,399 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:27,403 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:08:27,403 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:08:27,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:08:27 BasicIcfg [2022-07-19 21:08:27,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:08:27,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:08:27,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:08:27,510 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:08:27,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:08:22" (3/4) ... [2022-07-19 21:08:27,511 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:08:27,581 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:08:27,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:08:27,581 INFO L158 Benchmark]: Toolchain (without parser) took 6631.63ms. Allocated memory was 88.1MB in the beginning and 272.6MB in the end (delta: 184.5MB). Free memory was 54.6MB in the beginning and 109.7MB in the end (delta: -55.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,582 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 44.9MB in the beginning and 44.9MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:08:27,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.54ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 54.3MB in the beginning and 84.0MB in the end (delta: -29.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.09ms. Allocated memory is still 121.6MB. Free memory was 84.0MB in the beginning and 81.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,582 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 121.6MB. Free memory was 81.2MB in the beginning and 78.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,583 INFO L158 Benchmark]: RCFGBuilder took 986.50ms. Allocated memory is still 121.6MB. Free memory was 78.4MB in the beginning and 59.0MB in the end (delta: 19.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,583 INFO L158 Benchmark]: TraceAbstraction took 4997.23ms. Allocated memory was 121.6MB in the beginning and 272.6MB in the end (delta: 151.0MB). Free memory was 58.3MB in the beginning and 140.2MB in the end (delta: -81.8MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,583 INFO L158 Benchmark]: Witness Printer took 71.59ms. Allocated memory is still 272.6MB. Free memory was 140.2MB in the beginning and 109.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-19 21:08:27,584 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.18ms. Allocated memory is still 88.1MB. Free memory was 44.9MB in the beginning and 44.9MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.54ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 54.3MB in the beginning and 84.0MB in the end (delta: -29.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.09ms. Allocated memory is still 121.6MB. Free memory was 84.0MB in the beginning and 81.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 121.6MB. Free memory was 81.2MB in the beginning and 78.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 986.50ms. Allocated memory is still 121.6MB. Free memory was 78.4MB in the beginning and 59.0MB in the end (delta: 19.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4997.23ms. Allocated memory was 121.6MB in the beginning and 272.6MB in the end (delta: 151.0MB). Free memory was 58.3MB in the beginning and 140.2MB in the end (delta: -81.8MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. * Witness Printer took 71.59ms. Allocated memory is still 272.6MB. Free memory was 140.2MB in the beginning and 109.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L737] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L738] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L739] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L740] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L741] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L840] 0 pthread_t t891; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t891, ((void *)0), P0, ((void *)0))=-2, t891={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L842] 0 pthread_t t892; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t892, ((void *)0), P1, ((void *)0))=-1, t891={5:0}, t892={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L844] 0 pthread_t t893; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t893, ((void *)0), P2, ((void *)0))=0, t891={5:0}, t892={6:0}, t893={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 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) [L757] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L757] 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) [L757] 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) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 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 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 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 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L792] 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) [L792] 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) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 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 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 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 [L818] 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) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] 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) [L818] 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) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 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 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 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) [L851] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L851] 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) [L851] 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) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 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 [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 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 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 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) [L862] 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) [L863] 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)) [L863] EXPR 0 !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) [L863] 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)) [L863] 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)) [L864] 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)) [L864] EXPR 0 !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) [L864] 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)) [L864] 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)) [L865] 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)) [L865] EXPR 0 !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) [L865] 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)) [L865] 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)) [L866] 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)) [L866] EXPR 0 !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) [L866] 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)) [L866] 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)) [L867] 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)) [L867] EXPR 0 !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) [L867] 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)) [L867] 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)) [L868] 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)) [L868] EXPR 0 !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) [L868] 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)) [L868] 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)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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: 843]: 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: 845]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 643 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 59 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=6, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 2529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-19 21:08:27,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE