/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:41:53,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:41:53,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:41:53,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:41:53,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:41:53,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:41:53,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:41:53,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:41:53,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:41:54,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:41:54,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:41:54,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:41:54,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:41:54,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:41:54,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:41:54,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:41:54,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:41:54,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:41:54,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:41:54,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:41:54,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:41:54,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:41:54,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:41:54,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:41:54,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:41:54,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:41:54,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:41:54,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:41:54,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:41:54,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:41:54,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:41:54,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:41:54,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:41:54,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:41:54,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:41:54,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:41:54,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:41:54,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:41:54,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:41:54,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:41:54,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:41:54,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:41:54,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:41:54,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:41:54,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:41:54,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:41:54,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:41:54,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:41:54,050 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:41:54,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:41:54,050 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:41:54,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:41:54,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:41:54,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:41:54,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:41:54,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:41:54,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:41:54,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:41:54,053 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:41:54,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:41:54,053 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 [2022-01-18 22:41:54,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:41:54,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:41:54,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:41:54,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:41:54,250 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:41:54,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2022-01-18 22:41:54,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b2a1e68/9411cb927a924b408049800b068ab2c9/FLAG98c3ab07d [2022-01-18 22:41:54,763 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:41:54,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2022-01-18 22:41:54,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b2a1e68/9411cb927a924b408049800b068ab2c9/FLAG98c3ab07d [2022-01-18 22:41:54,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b2a1e68/9411cb927a924b408049800b068ab2c9 [2022-01-18 22:41:54,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:41:54,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:41:54,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:41:54,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:41:54,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:41:54,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:41:54" (1/1) ... [2022-01-18 22:41:54,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c070aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:54, skipping insertion in model container [2022-01-18 22:41:54,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:41:54" (1/1) ... [2022-01-18 22:41:54,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:41:54,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:41:54,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i[949,962] [2022-01-18 22:41:55,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:41:55,082 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:41:55,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i[949,962] [2022-01-18 22:41:55,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:41:55,140 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:41:55,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55 WrapperNode [2022-01-18 22:41:55,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:41:55,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:41:55,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:41:55,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:41:55,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,177 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 285 [2022-01-18 22:41:55,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:41:55,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:41:55,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:41:55,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:41:55,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:41:55,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:41:55,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:41:55,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:41:55,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (1/1) ... [2022-01-18 22:41:55,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:41:55,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:41:55,225 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-01-18 22:41:55,242 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-01-18 22:41:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:41:55,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:41:55,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:41:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:41:55,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:41:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:41:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:41:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:41:55,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:41:55,267 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:41:55,347 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:41:55,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:41:55,674 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:41:56,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:41:56,022 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:41:56,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:41:56 BoogieIcfgContainer [2022-01-18 22:41:56,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:41:56,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:41:56,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:41:56,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:41:56,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:41:54" (1/3) ... [2022-01-18 22:41:56,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49103e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:41:56, skipping insertion in model container [2022-01-18 22:41:56,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:41:55" (2/3) ... [2022-01-18 22:41:56,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49103e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:41:56, skipping insertion in model container [2022-01-18 22:41:56,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:41:56" (3/3) ... [2022-01-18 22:41:56,029 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2022-01-18 22:41:56,033 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:41:56,033 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:41:56,033 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:41:56,069 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,070 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,071 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,072 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,072 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,072 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,072 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,073 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,073 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,073 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,073 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,073 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,074 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,074 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,074 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,075 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,076 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,077 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,078 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,078 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,078 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,078 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,078 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,079 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,079 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,079 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,079 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,079 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,079 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,080 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,081 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,081 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,081 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,081 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,081 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,081 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,082 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,083 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,084 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,084 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,087 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,088 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,088 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,088 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,089 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,089 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,090 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,094 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,094 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,094 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,094 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,095 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,095 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,096 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,096 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,096 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,096 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,096 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,097 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,098 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,098 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:41:56,099 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:41:56,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:41:56,139 INFO L339 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=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:41:56,139 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:41:56,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-01-18 22:41:56,178 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2022-01-18 22:41:56,179 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:41:56,181 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-01-18 22:41:56,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-01-18 22:41:56,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow [2022-01-18 22:41:56,194 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2022-01-18 22:41:56,194 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:41:56,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:56,195 INFO L254 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-01-18 22:41:56,195 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 137669064, now seen corresponding path program 1 times [2022-01-18 22:41:56,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:56,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549639971] [2022-01-18 22:41:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:56,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:56,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:56,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549639971] [2022-01-18 22:41:56,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549639971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:56,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:56,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:41:56,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596843400] [2022-01-18 22:41:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:56,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:41:56,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:41:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:41:56,399 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2022-01-18 22:41:56,401 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-01-18 22:41:56,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:56,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2022-01-18 22:41:56,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:56,480 INFO L129 PetriNetUnfolder]: 57/358 cut-off events. [2022-01-18 22:41:56,481 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-18 22:41:56,482 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 1574 event pairs, 11 based on Foata normal form. 19/363 useless extension candidates. Maximal degree in co-relation 427. Up to 75 conditions per place. [2022-01-18 22:41:56,484 INFO L132 encePairwiseOnDemand]: 118/123 looper letters, 13 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-01-18 22:41:56,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 121 transitions, 284 flow [2022-01-18 22:41:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:41:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:41:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-01-18 22:41:56,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.940379403794038 [2022-01-18 22:41:56,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-01-18 22:41:56,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-01-18 22:41:56,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:56,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-01-18 22:41:56,499 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-01-18 22:41:56,503 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-01-18 22:41:56,503 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-01-18 22:41:56,504 INFO L186 Difference]: Start difference. First operand has 128 places, 120 transitions, 249 flow. Second operand 3 states and 347 transitions. [2022-01-18 22:41:56,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 121 transitions, 284 flow [2022-01-18 22:41:56,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 121 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:41:56,509 INFO L242 Difference]: Finished difference. Result has 125 places, 116 transitions, 242 flow [2022-01-18 22:41:56,510 INFO L317 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-01-18 22:41:56,513 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2022-01-18 22:41:56,513 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 116 transitions, 242 flow [2022-01-18 22:41:56,513 INFO L471 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-01-18 22:41:56,513 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:56,514 INFO L254 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-01-18 22:41:56,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:41:56,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1868569681, now seen corresponding path program 1 times [2022-01-18 22:41:56,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:56,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907514194] [2022-01-18 22:41:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:56,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:56,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:56,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907514194] [2022-01-18 22:41:56,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907514194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:56,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:56,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:41:56,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46973567] [2022-01-18 22:41:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:56,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:41:56,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:41:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:41:56,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2022-01-18 22:41:56,674 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-01-18 22:41:56,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:56,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2022-01-18 22:41:56,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:56,925 INFO L129 PetriNetUnfolder]: 256/863 cut-off events. [2022-01-18 22:41:56,925 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-01-18 22:41:56,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 863 events. 256/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5676 event pairs, 46 based on Foata normal form. 0/841 useless extension candidates. Maximal degree in co-relation 1291. Up to 171 conditions per place. [2022-01-18 22:41:56,930 INFO L132 encePairwiseOnDemand]: 117/123 looper letters, 18 selfloop transitions, 2 changer transitions 42/150 dead transitions. [2022-01-18 22:41:56,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 150 transitions, 420 flow [2022-01-18 22:41:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:41:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:41:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 971 transitions. [2022-01-18 22:41:56,934 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8771454381210478 [2022-01-18 22:41:56,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 971 transitions. [2022-01-18 22:41:56,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 971 transitions. [2022-01-18 22:41:56,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:56,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 971 transitions. [2022-01-18 22:41:56,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:56,939 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-01-18 22:41:56,939 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-01-18 22:41:56,940 INFO L186 Difference]: Start difference. First operand has 125 places, 116 transitions, 242 flow. Second operand 9 states and 971 transitions. [2022-01-18 22:41:56,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 150 transitions, 420 flow [2022-01-18 22:41:56,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 150 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:41:56,943 INFO L242 Difference]: Finished difference. Result has 138 places, 104 transitions, 234 flow [2022-01-18 22:41:56,943 INFO L317 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-01-18 22:41:56,943 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 10 predicate places. [2022-01-18 22:41:56,943 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 234 flow [2022-01-18 22:41:56,944 INFO L471 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-01-18 22:41:56,944 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:56,944 INFO L254 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-01-18 22:41:56,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:41:56,944 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1584186876, now seen corresponding path program 1 times [2022-01-18 22:41:56,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:56,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551447390] [2022-01-18 22:41:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:56,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:57,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:57,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551447390] [2022-01-18 22:41:57,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551447390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:57,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:57,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:41:57,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785861672] [2022-01-18 22:41:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:57,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:41:57,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:41:57,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:41:57,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 123 [2022-01-18 22:41:57,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 104 transitions, 234 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-01-18 22:41:57,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:57,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 123 [2022-01-18 22:41:57,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:57,298 INFO L129 PetriNetUnfolder]: 189/522 cut-off events. [2022-01-18 22:41:57,298 INFO L130 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-01-18 22:41:57,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 522 events. 189/522 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2613 event pairs, 43 based on Foata normal form. 12/520 useless extension candidates. Maximal degree in co-relation 929. Up to 165 conditions per place. [2022-01-18 22:41:57,301 INFO L132 encePairwiseOnDemand]: 117/123 looper letters, 18 selfloop transitions, 2 changer transitions 25/133 dead transitions. [2022-01-18 22:41:57,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 133 transitions, 400 flow [2022-01-18 22:41:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:41:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:41:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 965 transitions. [2022-01-18 22:41:57,303 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8717253839205059 [2022-01-18 22:41:57,303 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 965 transitions. [2022-01-18 22:41:57,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 965 transitions. [2022-01-18 22:41:57,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:57,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 965 transitions. [2022-01-18 22:41:57,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.22222222222223) internal successors, (965), 9 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:57,307 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-01-18 22:41:57,307 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-01-18 22:41:57,307 INFO L186 Difference]: Start difference. First operand has 138 places, 104 transitions, 234 flow. Second operand 9 states and 965 transitions. [2022-01-18 22:41:57,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 133 transitions, 400 flow [2022-01-18 22:41:57,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 133 transitions, 368 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-18 22:41:57,313 INFO L242 Difference]: Finished difference. Result has 127 places, 104 transitions, 238 flow [2022-01-18 22:41:57,313 INFO L317 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=127, PETRI_TRANSITIONS=104} [2022-01-18 22:41:57,315 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2022-01-18 22:41:57,315 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 104 transitions, 238 flow [2022-01-18 22:41:57,315 INFO L471 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-01-18 22:41:57,315 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:57,316 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:41:57,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:41:57,316 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:57,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:57,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1671489584, now seen corresponding path program 1 times [2022-01-18 22:41:57,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:57,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655392773] [2022-01-18 22:41:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:57,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:57,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655392773] [2022-01-18 22:41:57,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655392773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:57,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:57,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:41:57,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930021206] [2022-01-18 22:41:57,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:57,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:41:57,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:41:57,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:41:57,565 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 123 [2022-01-18 22:41:57,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 104 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 101.55555555555556) internal successors, (914), 9 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:57,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:57,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 123 [2022-01-18 22:41:57,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:57,833 INFO L129 PetriNetUnfolder]: 217/614 cut-off events. [2022-01-18 22:41:57,833 INFO L130 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-01-18 22:41:57,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 614 events. 217/614 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3155 event pairs, 82 based on Foata normal form. 12/607 useless extension candidates. Maximal degree in co-relation 1101. Up to 244 conditions per place. [2022-01-18 22:41:57,837 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 19 selfloop transitions, 6 changer transitions 28/139 dead transitions. [2022-01-18 22:41:57,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 139 transitions, 438 flow [2022-01-18 22:41:57,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:41:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:41:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1155 transitions. [2022-01-18 22:41:57,839 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8536585365853658 [2022-01-18 22:41:57,839 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1155 transitions. [2022-01-18 22:41:57,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1155 transitions. [2022-01-18 22:41:57,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:57,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1155 transitions. [2022-01-18 22:41:57,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:57,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 123.0) internal successors, (1476), 12 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:57,844 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 123.0) internal successors, (1476), 12 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:57,844 INFO L186 Difference]: Start difference. First operand has 127 places, 104 transitions, 238 flow. Second operand 11 states and 1155 transitions. [2022-01-18 22:41:57,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 139 transitions, 438 flow [2022-01-18 22:41:57,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 139 transitions, 406 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-18 22:41:57,849 INFO L242 Difference]: Finished difference. Result has 130 places, 107 transitions, 282 flow [2022-01-18 22:41:57,850 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=107} [2022-01-18 22:41:57,851 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places. [2022-01-18 22:41:57,851 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 107 transitions, 282 flow [2022-01-18 22:41:57,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.55555555555556) internal successors, (914), 9 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:57,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:57,852 INFO L254 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-01-18 22:41:57,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:41:57,853 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1440872075, now seen corresponding path program 1 times [2022-01-18 22:41:57,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:57,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854901007] [2022-01-18 22:41:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:57,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:58,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:58,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854901007] [2022-01-18 22:41:58,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854901007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:58,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:58,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:58,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659007540] [2022-01-18 22:41:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:58,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:58,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:58,002 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 123 [2022-01-18 22:41:58,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 107 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:58,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:58,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 123 [2022-01-18 22:41:58,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:58,233 INFO L129 PetriNetUnfolder]: 387/1062 cut-off events. [2022-01-18 22:41:58,233 INFO L130 PetriNetUnfolder]: For 1867/1867 co-relation queries the response was YES. [2022-01-18 22:41:58,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 1062 events. 387/1062 cut-off events. For 1867/1867 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6586 event pairs, 67 based on Foata normal form. 11/1051 useless extension candidates. Maximal degree in co-relation 2957. Up to 288 conditions per place. [2022-01-18 22:41:58,240 INFO L132 encePairwiseOnDemand]: 117/123 looper letters, 33 selfloop transitions, 2 changer transitions 14/136 dead transitions. [2022-01-18 22:41:58,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 136 transitions, 545 flow [2022-01-18 22:41:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:41:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:41:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 745 transitions. [2022-01-18 22:41:58,266 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8652729384436701 [2022-01-18 22:41:58,266 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 745 transitions. [2022-01-18 22:41:58,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 745 transitions. [2022-01-18 22:41:58,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:58,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 745 transitions. [2022-01-18 22:41:58,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:58,269 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-01-18 22:41:58,269 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-01-18 22:41:58,269 INFO L186 Difference]: Start difference. First operand has 130 places, 107 transitions, 282 flow. Second operand 7 states and 745 transitions. [2022-01-18 22:41:58,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 136 transitions, 545 flow [2022-01-18 22:41:58,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 136 transitions, 518 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-01-18 22:41:58,274 INFO L242 Difference]: Finished difference. Result has 129 places, 108 transitions, 287 flow [2022-01-18 22:41:58,274 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=129, PETRI_TRANSITIONS=108} [2022-01-18 22:41:58,274 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2022-01-18 22:41:58,274 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 108 transitions, 287 flow [2022-01-18 22:41:58,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:41:58,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:58,275 INFO L254 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-01-18 22:41:58,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:41:58,277 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2104017803, now seen corresponding path program 2 times [2022-01-18 22:41:58,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:58,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431351019] [2022-01-18 22:41:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:58,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:58,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431351019] [2022-01-18 22:41:58,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431351019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:58,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:58,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:41:58,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330193370] [2022-01-18 22:41:58,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:58,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:41:58,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:58,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:41:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:41:58,397 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-01-18 22:41:58,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 108 transitions, 287 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-01-18 22:41:58,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:58,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-01-18 22:41:58,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:58,837 INFO L129 PetriNetUnfolder]: 1514/3227 cut-off events. [2022-01-18 22:41:58,837 INFO L130 PetriNetUnfolder]: For 5774/6026 co-relation queries the response was YES. [2022-01-18 22:41:58,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8409 conditions, 3227 events. 1514/3227 cut-off events. For 5774/6026 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24781 event pairs, 87 based on Foata normal form. 5/3104 useless extension candidates. Maximal degree in co-relation 8342. Up to 940 conditions per place. [2022-01-18 22:41:58,855 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 47 selfloop transitions, 13 changer transitions 26/172 dead transitions. [2022-01-18 22:41:58,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 172 transitions, 711 flow [2022-01-18 22:41:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:41:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:41:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1072 transitions. [2022-01-18 22:41:58,857 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8715447154471545 [2022-01-18 22:41:58,857 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1072 transitions. [2022-01-18 22:41:58,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1072 transitions. [2022-01-18 22:41:58,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:58,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1072 transitions. [2022-01-18 22:41:58,859 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-01-18 22:41:58,860 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-01-18 22:41:58,861 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-01-18 22:41:58,861 INFO L186 Difference]: Start difference. First operand has 129 places, 108 transitions, 287 flow. Second operand 10 states and 1072 transitions. [2022-01-18 22:41:58,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 172 transitions, 711 flow [2022-01-18 22:41:58,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 172 transitions, 704 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-18 22:41:58,867 INFO L242 Difference]: Finished difference. Result has 137 places, 119 transitions, 378 flow [2022-01-18 22:41:58,868 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=378, PETRI_PLACES=137, PETRI_TRANSITIONS=119} [2022-01-18 22:41:58,869 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2022-01-18 22:41:58,869 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 119 transitions, 378 flow [2022-01-18 22:41:58,869 INFO L471 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-01-18 22:41:58,869 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:58,870 INFO L254 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-01-18 22:41:58,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:41:58,870 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1608679520, now seen corresponding path program 1 times [2022-01-18 22:41:58,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:58,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973660143] [2022-01-18 22:41:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:58,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:58,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-01-18 22:41:58,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:58,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973660143] [2022-01-18 22:41:58,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973660143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:58,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:58,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:41:58,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492384243] [2022-01-18 22:41:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:58,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:41:58,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:41:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:41:58,963 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-01-18 22:41:58,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 119 transitions, 378 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-01-18 22:41:58,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:58,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-01-18 22:41:58,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:59,380 INFO L129 PetriNetUnfolder]: 1231/2924 cut-off events. [2022-01-18 22:41:59,380 INFO L130 PetriNetUnfolder]: For 7258/7524 co-relation queries the response was YES. [2022-01-18 22:41:59,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9467 conditions, 2924 events. 1231/2924 cut-off events. For 7258/7524 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 24005 event pairs, 66 based on Foata normal form. 67/2927 useless extension candidates. Maximal degree in co-relation 9395. Up to 549 conditions per place. [2022-01-18 22:41:59,394 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 55 selfloop transitions, 24 changer transitions 36/201 dead transitions. [2022-01-18 22:41:59,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 201 transitions, 1100 flow [2022-01-18 22:41:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:41:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:41:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1392 transitions. [2022-01-18 22:41:59,397 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8705440900562852 [2022-01-18 22:41:59,397 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1392 transitions. [2022-01-18 22:41:59,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1392 transitions. [2022-01-18 22:41:59,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:41:59,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1392 transitions. [2022-01-18 22:41:59,400 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-01-18 22:41:59,401 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-01-18 22:41:59,402 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-01-18 22:41:59,402 INFO L186 Difference]: Start difference. First operand has 137 places, 119 transitions, 378 flow. Second operand 13 states and 1392 transitions. [2022-01-18 22:41:59,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 201 transitions, 1100 flow [2022-01-18 22:41:59,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 201 transitions, 1098 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 22:41:59,410 INFO L242 Difference]: Finished difference. Result has 154 places, 134 transitions, 580 flow [2022-01-18 22:41:59,411 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=580, PETRI_PLACES=154, PETRI_TRANSITIONS=134} [2022-01-18 22:41:59,411 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 26 predicate places. [2022-01-18 22:41:59,411 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 134 transitions, 580 flow [2022-01-18 22:41:59,411 INFO L471 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-01-18 22:41:59,411 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:41:59,412 INFO L254 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-01-18 22:41:59,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:41:59,412 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:41:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:41:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 813357401, now seen corresponding path program 1 times [2022-01-18 22:41:59,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:41:59,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927506783] [2022-01-18 22:41:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:41:59,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:41:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:41:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:41:59,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:41:59,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927506783] [2022-01-18 22:41:59,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927506783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:41:59,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:41:59,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:41:59,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853095157] [2022-01-18 22:41:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:41:59,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:41:59,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:41:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:41:59,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:41:59,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2022-01-18 22:41:59,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 134 transitions, 580 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-01-18 22:41:59,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:41:59,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2022-01-18 22:41:59,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:41:59,988 INFO L129 PetriNetUnfolder]: 1047/2710 cut-off events. [2022-01-18 22:41:59,988 INFO L130 PetriNetUnfolder]: For 9182/9473 co-relation queries the response was YES. [2022-01-18 22:42:00,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9858 conditions, 2710 events. 1047/2710 cut-off events. For 9182/9473 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23505 event pairs, 92 based on Foata normal form. 30/2674 useless extension candidates. Maximal degree in co-relation 9778. Up to 480 conditions per place. [2022-01-18 22:42:00,007 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 37 selfloop transitions, 22 changer transitions 52/197 dead transitions. [2022-01-18 22:42:00,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 197 transitions, 1188 flow [2022-01-18 22:42:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 22:42:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 22:42:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1678 transitions. [2022-01-18 22:42:00,011 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8526422764227642 [2022-01-18 22:42:00,011 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1678 transitions. [2022-01-18 22:42:00,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1678 transitions. [2022-01-18 22:42:00,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:42:00,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1678 transitions. [2022-01-18 22:42:00,014 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-01-18 22:42:00,017 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-01-18 22:42:00,017 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-01-18 22:42:00,018 INFO L186 Difference]: Start difference. First operand has 154 places, 134 transitions, 580 flow. Second operand 16 states and 1678 transitions. [2022-01-18 22:42:00,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 197 transitions, 1188 flow [2022-01-18 22:42:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 197 transitions, 1106 flow, removed 33 selfloop flow, removed 6 redundant places. [2022-01-18 22:42:00,058 INFO L242 Difference]: Finished difference. Result has 170 places, 128 transitions, 539 flow [2022-01-18 22:42:00,058 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=539, PETRI_PLACES=170, PETRI_TRANSITIONS=128} [2022-01-18 22:42:00,059 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 42 predicate places. [2022-01-18 22:42:00,059 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 128 transitions, 539 flow [2022-01-18 22:42:00,059 INFO L471 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-01-18 22:42:00,059 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:42:00,060 INFO L254 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-01-18 22:42:00,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:42:00,060 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:42:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:42:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 525605210, now seen corresponding path program 1 times [2022-01-18 22:42:00,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:42:00,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623765068] [2022-01-18 22:42:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:42:00,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:42:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:42:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:42:00,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:42:00,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623765068] [2022-01-18 22:42:00,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623765068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:42:00,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:42:00,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:42:00,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314142559] [2022-01-18 22:42:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:42:00,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:42:00,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:42:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:42:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:42:00,219 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 123 [2022-01-18 22:42:00,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 128 transitions, 539 flow. Second operand has 11 states, 11 states have (on average 98.9090909090909) internal successors, (1088), 11 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:42:00,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:42:00,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 123 [2022-01-18 22:42:00,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:42:00,553 INFO L129 PetriNetUnfolder]: 336/2034 cut-off events. [2022-01-18 22:42:00,554 INFO L130 PetriNetUnfolder]: For 4893/5062 co-relation queries the response was YES. [2022-01-18 22:42:00,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6175 conditions, 2034 events. 336/2034 cut-off events. For 4893/5062 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21446 event pairs, 26 based on Foata normal form. 2/1917 useless extension candidates. Maximal degree in co-relation 6085. Up to 272 conditions per place. [2022-01-18 22:42:00,569 INFO L132 encePairwiseOnDemand]: 113/123 looper letters, 25 selfloop transitions, 2 changer transitions 33/164 dead transitions. [2022-01-18 22:42:00,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 164 transitions, 837 flow [2022-01-18 22:42:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:42:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:42:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1115 transitions. [2022-01-18 22:42:00,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8240946045824095 [2022-01-18 22:42:00,571 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1115 transitions. [2022-01-18 22:42:00,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1115 transitions. [2022-01-18 22:42:00,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:42:00,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1115 transitions. [2022-01-18 22:42:00,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.36363636363636) internal successors, (1115), 11 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:42:00,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 123.0) internal successors, (1476), 12 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:42:00,575 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 123.0) internal successors, (1476), 12 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:42:00,575 INFO L186 Difference]: Start difference. First operand has 170 places, 128 transitions, 539 flow. Second operand 11 states and 1115 transitions. [2022-01-18 22:42:00,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 164 transitions, 837 flow [2022-01-18 22:42:00,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 164 transitions, 675 flow, removed 58 selfloop flow, removed 19 redundant places. [2022-01-18 22:42:00,603 INFO L242 Difference]: Finished difference. Result has 160 places, 127 transitions, 470 flow [2022-01-18 22:42:00,604 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=470, PETRI_PLACES=160, PETRI_TRANSITIONS=127} [2022-01-18 22:42:00,604 INFO L334 CegarLoopForPetriNet]: 128 programPoint places, 32 predicate places. [2022-01-18 22:42:00,604 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 127 transitions, 470 flow [2022-01-18 22:42:00,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 98.9090909090909) internal successors, (1088), 11 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:42:00,605 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:42:00,605 INFO L254 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-01-18 22:42:00,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:42:00,605 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:42:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:42:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1422492904, now seen corresponding path program 2 times [2022-01-18 22:42:00,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:42:00,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755320665] [2022-01-18 22:42:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:42:00,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:42:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:42:00,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:42:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:42:00,725 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:42:00,725 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:42:00,726 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:42:00,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:42:00,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:42:00,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:42:00,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:42:00,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:42:00,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:42:00,730 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-01-18 22:42:00,733 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:42:00,733 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:42:00,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:42:00 BasicIcfg [2022-01-18 22:42:00,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:42:00,833 INFO L158 Benchmark]: Toolchain (without parser) took 6043.86ms. Allocated memory was 348.1MB in the beginning and 679.5MB in the end (delta: 331.4MB). Free memory was 289.2MB in the beginning and 605.5MB in the end (delta: -316.3MB). Peak memory consumption was 376.7MB. Max. memory is 16.0GB. [2022-01-18 22:42:00,833 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory was 307.6MB in the beginning and 307.6MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:42:00,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.46ms. Allocated memory was 348.1MB in the beginning and 486.5MB in the end (delta: 138.4MB). Free memory was 289.0MB in the beginning and 444.3MB in the end (delta: -155.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. [2022-01-18 22:42:00,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.80ms. Allocated memory is still 486.5MB. Free memory was 444.3MB in the beginning and 441.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:42:00,834 INFO L158 Benchmark]: Boogie Preprocessor took 20.66ms. Allocated memory is still 486.5MB. Free memory was 441.1MB in the beginning and 439.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:42:00,834 INFO L158 Benchmark]: RCFGBuilder took 824.76ms. Allocated memory is still 486.5MB. Free memory was 439.0MB in the beginning and 356.2MB in the end (delta: 82.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.0GB. [2022-01-18 22:42:00,834 INFO L158 Benchmark]: TraceAbstraction took 4807.99ms. Allocated memory was 486.5MB in the beginning and 679.5MB in the end (delta: 192.9MB). Free memory was 355.1MB in the beginning and 605.5MB in the end (delta: -250.3MB). Peak memory consumption was 303.3MB. Max. memory is 16.0GB. [2022-01-18 22:42:00,835 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.12ms. Allocated memory is still 348.1MB. Free memory was 307.6MB in the beginning and 307.6MB in the end (delta: 66.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 350.46ms. Allocated memory was 348.1MB in the beginning and 486.5MB in the end (delta: 138.4MB). Free memory was 289.0MB in the beginning and 444.3MB in the end (delta: -155.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.80ms. Allocated memory is still 486.5MB. Free memory was 444.3MB in the beginning and 441.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.66ms. Allocated memory is still 486.5MB. Free memory was 441.1MB in the beginning and 439.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 824.76ms. Allocated memory is still 486.5MB. Free memory was 439.0MB in the beginning and 356.2MB in the end (delta: 82.8MB). Peak memory consumption was 83.9MB. Max. memory is 16.0GB. * TraceAbstraction took 4807.99ms. Allocated memory was 486.5MB in the beginning and 679.5MB in the end (delta: 192.9MB). Free memory was 355.1MB in the beginning and 605.5MB in the end (delta: -250.3MB). Peak memory consumption was 303.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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}, 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 [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 [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=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] [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=1, expression=0, 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)=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] - 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.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 636 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1015 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 60 mSDtfsCounter, 1015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=7, InterpolantAutomatonStates: 89, 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.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 747 ConstructedInterpolants, 0 QuantifiedInterpolants, 2489 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-01-18 22:42:00,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...