/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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:52:32,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:52:32,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:52:32,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:52:32,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:52:32,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:52:32,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:52:32,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:52:32,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:52:32,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:52:32,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:52:32,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:52:32,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:52:32,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:52:32,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:52:32,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:52:32,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:52:32,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:52:32,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:52:32,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:52:32,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:52:32,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:52:32,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:52:32,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:52:32,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:52:32,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:52:32,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:52:32,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:52:32,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:52:32,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:52:32,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:52:32,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:52:32,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:52:32,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:52:32,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:52:32,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:52:32,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:52:32,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:52:32,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:52:32,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:52:32,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:52:32,763 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-VariableLbe.epf [2023-01-28 06:52:32,791 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:52:32,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:52:32,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:52:32,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:52:32,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:52:32,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:52:32,793 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:52:32,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:52:32,793 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:52:32,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:52:32,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:52:32,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:52:32,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:52:32,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:52:32,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:52:32,794 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:52:32,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:52:32,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:52:32,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:52:32,796 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:52:33,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:52:33,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:52:33,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:52:33,035 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:52:33,035 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:52:33,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-01-28 06:52:34,147 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:52:34,383 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:52:34,383 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-01-28 06:52:34,397 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a31d11/00277a789aec4675ba2c541c79b11a4b/FLAGa854e33c1 [2023-01-28 06:52:34,414 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a31d11/00277a789aec4675ba2c541c79b11a4b [2023-01-28 06:52:34,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:52:34,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:52:34,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:52:34,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:52:34,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:52:34,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:52:34" (1/1) ... [2023-01-28 06:52:34,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab57865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:34, skipping insertion in model container [2023-01-28 06:52:34,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:52:34" (1/1) ... [2023-01-28 06:52:34,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:52:34,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:52:34,637 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i[944,957] [2023-01-28 06:52:34,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:52:34,911 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:52:34,922 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i[944,957] [2023-01-28 06:52:34,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:52:35,019 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:52:35,019 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:52:35,025 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:52:35,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35 WrapperNode [2023-01-28 06:52:35,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:52:35,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:52:35,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:52:35,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:52:35,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,091 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 282 [2023-01-28 06:52:35,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:52:35,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:52:35,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:52:35,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:52:35,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:52:35,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:52:35,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:52:35,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:52:35,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (1/1) ... [2023-01-28 06:52:35,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:52:35,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:52:35,155 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) [2023-01-28 06:52:35,177 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 [2023-01-28 06:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:52:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:52:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:52:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:52:35,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:52:35,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:52:35,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:52:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:52:35,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:52:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:52:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:52:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:52:35,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:52:35,195 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:52:35,404 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:52:35,405 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:52:35,805 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:52:36,029 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:52:36,029 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:52:36,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:52:36 BoogieIcfgContainer [2023-01-28 06:52:36,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:52:36,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:52:36,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:52:36,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:52:36,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:52:34" (1/3) ... [2023-01-28 06:52:36,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502854e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:52:36, skipping insertion in model container [2023-01-28 06:52:36,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:52:35" (2/3) ... [2023-01-28 06:52:36,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502854e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:52:36, skipping insertion in model container [2023-01-28 06:52:36,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:52:36" (3/3) ... [2023-01-28 06:52:36,038 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-01-28 06:52:36,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:52:36,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-01-28 06:52:36,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:52:36,147 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:52:36,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2023-01-28 06:52:36,232 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2023-01-28 06:52:36,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:52:36,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-01-28 06:52:36,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2023-01-28 06:52:36,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2023-01-28 06:52:36,243 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:52:36,250 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2023-01-28 06:52:36,252 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2023-01-28 06:52:36,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2023-01-28 06:52:36,278 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2023-01-28 06:52:36,279 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:52:36,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-01-28 06:52:36,282 INFO L119 LiptonReduction]: Number of co-enabled transitions 3392 [2023-01-28 06:52:43,334 INFO L134 LiptonReduction]: Checked pairs total: 9980 [2023-01-28 06:52:43,334 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-01-28 06:52:43,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:52:43,349 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a4c2892, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:52:43,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-01-28 06:52:43,353 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-01-28 06:52:43,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:52:43,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:52:43,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:52:43,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:52:43,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:52:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash 749938511, now seen corresponding path program 1 times [2023-01-28 06:52:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:52:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955416036] [2023-01-28 06:52:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:52:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:52:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:52:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:52:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:52:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955416036] [2023-01-28 06:52:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955416036] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:52:43,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:52:43,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:52:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212434844] [2023-01-28 06:52:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:52:43,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:52:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:52:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:52:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:52:43,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-01-28 06:52:43,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:43,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:52:43,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-01-28 06:52:43,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:52:45,619 INFO L130 PetriNetUnfolder]: 7477/10303 cut-off events. [2023-01-28 06:52:45,620 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2023-01-28 06:52:45,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20605 conditions, 10303 events. 7477/10303 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 53731 event pairs, 2413 based on Foata normal form. 0/9398 useless extension candidates. Maximal degree in co-relation 20593. Up to 8473 conditions per place. [2023-01-28 06:52:45,677 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 44 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-01-28 06:52:45,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 210 flow [2023-01-28 06:52:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:52:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:52:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-01-28 06:52:45,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256869772998806 [2023-01-28 06:52:45,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-01-28 06:52:45,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-01-28 06:52:45,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:52:45,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-01-28 06:52:45,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:45,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:45,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:45,702 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 76 flow. Second operand 3 states and 440 transitions. [2023-01-28 06:52:45,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 210 flow [2023-01-28 06:52:45,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:52:45,707 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2023-01-28 06:52:45,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-01-28 06:52:45,711 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-01-28 06:52:45,711 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2023-01-28 06:52:45,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:45,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:52:45,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:52:45,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:52:45,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:52:45,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:52:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash -881519320, now seen corresponding path program 1 times [2023-01-28 06:52:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:52:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903558962] [2023-01-28 06:52:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:52:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:52:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:52:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:52:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:52:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903558962] [2023-01-28 06:52:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903558962] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:52:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:52:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:52:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983071952] [2023-01-28 06:52:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:52:45,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:52:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:52:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:52:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:52:45,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-01-28 06:52:45,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:45,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:52:45,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-01-28 06:52:45,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:52:47,408 INFO L130 PetriNetUnfolder]: 6237/8887 cut-off events. [2023-01-28 06:52:47,408 INFO L131 PetriNetUnfolder]: For 437/437 co-relation queries the response was YES. [2023-01-28 06:52:47,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17987 conditions, 8887 events. 6237/8887 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 49383 event pairs, 1277 based on Foata normal form. 0/8466 useless extension candidates. Maximal degree in co-relation 17977. Up to 6561 conditions per place. [2023-01-28 06:52:47,459 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 36 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-01-28 06:52:47,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 182 flow [2023-01-28 06:52:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:52:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:52:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-01-28 06:52:47,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-01-28 06:52:47,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-01-28 06:52:47,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-01-28 06:52:47,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:52:47,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-01-28 06:52:47,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:47,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:47,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:47,470 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 434 transitions. [2023-01-28 06:52:47,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 182 flow [2023-01-28 06:52:47,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:52:47,472 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-01-28 06:52:47,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-01-28 06:52:47,473 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2023-01-28 06:52:47,473 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-01-28 06:52:47,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:47,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:52:47,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:52:47,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:52:47,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:52:47,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:52:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1031410502, now seen corresponding path program 1 times [2023-01-28 06:52:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:52:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043271656] [2023-01-28 06:52:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:52:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:52:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:52:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:52:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:52:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043271656] [2023-01-28 06:52:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043271656] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:52:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:52:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:52:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987959504] [2023-01-28 06:52:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:52:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:52:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:52:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:52:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:52:57,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 279 [2023-01-28 06:52:57,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:57,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:52:57,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 279 [2023-01-28 06:52:57,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:52:58,890 INFO L130 PetriNetUnfolder]: 12735/17042 cut-off events. [2023-01-28 06:52:58,891 INFO L131 PetriNetUnfolder]: For 574/574 co-relation queries the response was YES. [2023-01-28 06:52:58,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35138 conditions, 17042 events. 12735/17042 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 79330 event pairs, 1917 based on Foata normal form. 180/17222 useless extension candidates. Maximal degree in co-relation 35128. Up to 14973 conditions per place. [2023-01-28 06:52:58,955 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 51 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2023-01-28 06:52:58,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 272 flow [2023-01-28 06:52:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:52:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:52:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-01-28 06:52:58,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525089605734767 [2023-01-28 06:52:58,958 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-01-28 06:52:58,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-01-28 06:52:58,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:52:58,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-01-28 06:52:58,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:58,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:58,962 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:58,962 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 4 states and 505 transitions. [2023-01-28 06:52:58,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 272 flow [2023-01-28 06:52:58,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:52:58,975 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 150 flow [2023-01-28 06:52:58,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-01-28 06:52:58,976 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-01-28 06:52:58,976 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 150 flow [2023-01-28 06:52:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:58,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:52:58,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:52:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:52:58,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:52:58,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:52:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1909040358, now seen corresponding path program 1 times [2023-01-28 06:52:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:52:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574367683] [2023-01-28 06:52:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:52:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:52:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:52:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:52:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:52:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574367683] [2023-01-28 06:52:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574367683] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:52:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:52:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:52:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011300883] [2023-01-28 06:52:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:52:59,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:52:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:52:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:52:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:52:59,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-01-28 06:52:59,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:52:59,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:52:59,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-01-28 06:52:59,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:00,401 INFO L130 PetriNetUnfolder]: 6985/9839 cut-off events. [2023-01-28 06:53:00,401 INFO L131 PetriNetUnfolder]: For 3509/3733 co-relation queries the response was YES. [2023-01-28 06:53:00,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26211 conditions, 9839 events. 6985/9839 cut-off events. For 3509/3733 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54415 event pairs, 1779 based on Foata normal form. 236/9960 useless extension candidates. Maximal degree in co-relation 26199. Up to 6451 conditions per place. [2023-01-28 06:53:00,444 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 53 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-01-28 06:53:00,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 339 flow [2023-01-28 06:53:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:53:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:53:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-01-28 06:53:00,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197132616487455 [2023-01-28 06:53:00,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-01-28 06:53:00,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-01-28 06:53:00,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:00,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-01-28 06:53:00,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:00,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:00,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:00,459 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 150 flow. Second operand 3 states and 435 transitions. [2023-01-28 06:53:00,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 339 flow [2023-01-28 06:53:00,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:53:00,463 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 161 flow [2023-01-28 06:53:00,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-01-28 06:53:00,464 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-01-28 06:53:00,465 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 161 flow [2023-01-28 06:53:00,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:00,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:00,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:53:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:53:00,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:00,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -307548249, now seen corresponding path program 1 times [2023-01-28 06:53:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641550782] [2023-01-28 06:53:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641550782] [2023-01-28 06:53:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641550782] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:53:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564653125] [2023-01-28 06:53:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:00,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:53:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:53:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:53:00,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-01-28 06:53:00,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:00,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:00,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-01-28 06:53:00,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:01,977 INFO L130 PetriNetUnfolder]: 6941/9827 cut-off events. [2023-01-28 06:53:01,978 INFO L131 PetriNetUnfolder]: For 5572/6116 co-relation queries the response was YES. [2023-01-28 06:53:01,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26748 conditions, 9827 events. 6941/9827 cut-off events. For 5572/6116 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 53332 event pairs, 2505 based on Foata normal form. 304/9864 useless extension candidates. Maximal degree in co-relation 26733. Up to 5215 conditions per place. [2023-01-28 06:53:02,025 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 43 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-01-28 06:53:02,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 292 flow [2023-01-28 06:53:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:53:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:53:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-01-28 06:53:02,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149342891278376 [2023-01-28 06:53:02,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-01-28 06:53:02,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-01-28 06:53:02,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:02,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-01-28 06:53:02,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:02,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:02,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:02,032 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 161 flow. Second operand 3 states and 431 transitions. [2023-01-28 06:53:02,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 292 flow [2023-01-28 06:53:02,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:53:02,038 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 166 flow [2023-01-28 06:53:02,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-01-28 06:53:02,038 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-01-28 06:53:02,038 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 166 flow [2023-01-28 06:53:02,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:02,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:02,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:53:02,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:53:02,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:02,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1387425292, now seen corresponding path program 1 times [2023-01-28 06:53:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:02,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910965129] [2023-01-28 06:53:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910965129] [2023-01-28 06:53:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910965129] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:02,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:53:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510419771] [2023-01-28 06:53:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:02,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:53:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:53:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:53:02,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-01-28 06:53:02,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:02,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:02,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-01-28 06:53:02,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:03,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 110#L872true, 91#L820true, 187#(= ~__unbuffered_p3_EAX~0 0), 173#true, 65#L3true, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 144#L781true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:03,131 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:53:03,131 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:03,132 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:03,132 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:03,216 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][104], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, 91#L820true, 187#(= ~__unbuffered_p3_EAX~0 0), 173#true, 65#L3true, 115#P0EXITtrue, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:03,216 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:53:03,217 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:03,217 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:03,217 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:03,587 INFO L130 PetriNetUnfolder]: 6282/8867 cut-off events. [2023-01-28 06:53:03,587 INFO L131 PetriNetUnfolder]: For 5752/6162 co-relation queries the response was YES. [2023-01-28 06:53:03,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25286 conditions, 8867 events. 6282/8867 cut-off events. For 5752/6162 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 48726 event pairs, 1109 based on Foata normal form. 734/9309 useless extension candidates. Maximal degree in co-relation 25270. Up to 5039 conditions per place. [2023-01-28 06:53:03,619 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 84 selfloop transitions, 8 changer transitions 15/113 dead transitions. [2023-01-28 06:53:03,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 113 transitions, 673 flow [2023-01-28 06:53:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:53:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:53:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-01-28 06:53:03,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917562724014337 [2023-01-28 06:53:03,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-01-28 06:53:03,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-01-28 06:53:03,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:03,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-01-28 06:53:03,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:03,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:03,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:03,629 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 166 flow. Second operand 5 states and 686 transitions. [2023-01-28 06:53:03,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 113 transitions, 673 flow [2023-01-28 06:53:03,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 113 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:53:03,640 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 227 flow [2023-01-28 06:53:03,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-01-28 06:53:03,642 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-01-28 06:53:03,643 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 227 flow [2023-01-28 06:53:03,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:03,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:03,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:53:03,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:53:03,645 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:03,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2044306062, now seen corresponding path program 1 times [2023-01-28 06:53:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869380254] [2023-01-28 06:53:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869380254] [2023-01-28 06:53:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869380254] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:53:04,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753782537] [2023-01-28 06:53:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:04,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:53:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:53:04,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:53:04,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-01-28 06:53:04,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:04,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:04,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-01-28 06:53:04,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:04,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 144#L781true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:04,651 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:53:04,651 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:04,651 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:04,651 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:04,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][107], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, 115#P0EXITtrue, 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:04,722 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:53:04,722 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:04,722 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:04,722 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:05,002 INFO L130 PetriNetUnfolder]: 4875/7058 cut-off events. [2023-01-28 06:53:05,002 INFO L131 PetriNetUnfolder]: For 6803/7209 co-relation queries the response was YES. [2023-01-28 06:53:05,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23300 conditions, 7058 events. 4875/7058 cut-off events. For 6803/7209 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39184 event pairs, 691 based on Foata normal form. 460/7297 useless extension candidates. Maximal degree in co-relation 23281. Up to 3304 conditions per place. [2023-01-28 06:53:05,027 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 102 selfloop transitions, 15 changer transitions 29/152 dead transitions. [2023-01-28 06:53:05,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 152 transitions, 978 flow [2023-01-28 06:53:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:53:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:53:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions. [2023-01-28 06:53:05,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2023-01-28 06:53:05,031 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 961 transitions. [2023-01-28 06:53:05,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions. [2023-01-28 06:53:05,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:05,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions. [2023-01-28 06:53:05,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:05,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:05,037 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:05,037 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 227 flow. Second operand 7 states and 961 transitions. [2023-01-28 06:53:05,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 152 transitions, 978 flow [2023-01-28 06:53:05,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 152 transitions, 973 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:53:05,052 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 330 flow [2023-01-28 06:53:05,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-01-28 06:53:05,053 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-01-28 06:53:05,053 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 330 flow [2023-01-28 06:53:05,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:05,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:05,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:53:05,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:53:05,054 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:05,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 828471236, now seen corresponding path program 1 times [2023-01-28 06:53:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634279789] [2023-01-28 06:53:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634279789] [2023-01-28 06:53:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634279789] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:53:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822128328] [2023-01-28 06:53:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:05,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:53:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:05,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:53:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:53:05,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-01-28 06:53:05,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:05,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:05,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-01-28 06:53:05,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:06,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, 220#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, 144#L781true, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:06,050 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:53:06,050 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:06,050 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:06,050 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:06,120 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][107], [P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 65#L3true, 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 115#P0EXITtrue, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, 222#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:06,120 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:53:06,120 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:06,120 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:06,121 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:53:06,362 INFO L130 PetriNetUnfolder]: 4306/6270 cut-off events. [2023-01-28 06:53:06,362 INFO L131 PetriNetUnfolder]: For 9554/9952 co-relation queries the response was YES. [2023-01-28 06:53:06,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22393 conditions, 6270 events. 4306/6270 cut-off events. For 9554/9952 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 34963 event pairs, 617 based on Foata normal form. 192/6262 useless extension candidates. Maximal degree in co-relation 22370. Up to 2935 conditions per place. [2023-01-28 06:53:06,394 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 113 selfloop transitions, 20 changer transitions 41/180 dead transitions. [2023-01-28 06:53:06,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 180 transitions, 1240 flow [2023-01-28 06:53:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:53:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:53:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2023-01-28 06:53:06,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49143767423337315 [2023-01-28 06:53:06,398 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1234 transitions. [2023-01-28 06:53:06,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1234 transitions. [2023-01-28 06:53:06,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:06,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1234 transitions. [2023-01-28 06:53:06,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:06,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:06,405 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:06,405 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 330 flow. Second operand 9 states and 1234 transitions. [2023-01-28 06:53:06,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 180 transitions, 1240 flow [2023-01-28 06:53:06,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 180 transitions, 1205 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 06:53:06,553 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 398 flow [2023-01-28 06:53:06,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-01-28 06:53:06,555 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2023-01-28 06:53:06,555 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 398 flow [2023-01-28 06:53:06,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:06,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:06,556 INFO L208 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] [2023-01-28 06:53:06,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:53:06,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:06,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 314529884, now seen corresponding path program 1 times [2023-01-28 06:53:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036156912] [2023-01-28 06:53:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:07,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036156912] [2023-01-28 06:53:07,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036156912] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:07,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:53:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364199303] [2023-01-28 06:53:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:07,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:53:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:53:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:53:07,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 279 [2023-01-28 06:53:07,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:07,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:07,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 279 [2023-01-28 06:53:07,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:07,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][47], [P0Thread1of1ForFork1InUse, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 217#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 59#L927-3true, Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, 91#L820true, 215#(= ~__unbuffered_cnt~0 0), 153#L771true, 173#true, Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 231#(= ~a~0 1), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, P1Thread1of1ForFork3InUse, 202#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:07,423 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2023-01-28 06:53:07,423 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 06:53:07,423 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 06:53:07,423 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-01-28 06:53:07,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][47], [P0Thread1of1ForFork1InUse, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 220#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P2Thread1of1ForFork0InUse, Black: 217#(<= ~__unbuffered_cnt~0 2), Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 153#L771true, 173#true, 65#L3true, Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), Black: 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 231#(= ~a~0 1), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:07,535 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-01-28 06:53:07,535 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 06:53:07,535 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 06:53:07,535 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-01-28 06:53:08,296 INFO L130 PetriNetUnfolder]: 6090/9084 cut-off events. [2023-01-28 06:53:08,298 INFO L131 PetriNetUnfolder]: For 16185/16510 co-relation queries the response was YES. [2023-01-28 06:53:08,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32471 conditions, 9084 events. 6090/9084 cut-off events. For 16185/16510 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 55956 event pairs, 1242 based on Foata normal form. 68/8882 useless extension candidates. Maximal degree in co-relation 32444. Up to 5249 conditions per place. [2023-01-28 06:53:08,347 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 107 selfloop transitions, 2 changer transitions 15/129 dead transitions. [2023-01-28 06:53:08,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 1175 flow [2023-01-28 06:53:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:53:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:53:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-01-28 06:53:08,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134408602150538 [2023-01-28 06:53:08,350 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-01-28 06:53:08,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-01-28 06:53:08,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:08,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-01-28 06:53:08,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:08,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:08,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:08,353 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 398 flow. Second operand 4 states and 573 transitions. [2023-01-28 06:53:08,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 1175 flow [2023-01-28 06:53:08,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 995 flow, removed 51 selfloop flow, removed 7 redundant places. [2023-01-28 06:53:08,540 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 329 flow [2023-01-28 06:53:08,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-01-28 06:53:08,540 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2023-01-28 06:53:08,541 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 329 flow [2023-01-28 06:53:08,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:08,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:08,541 INFO L208 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] [2023-01-28 06:53:08,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:53:08,541 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:08,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:08,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1767145540, now seen corresponding path program 2 times [2023-01-28 06:53:08,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:08,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952725899] [2023-01-28 06:53:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:08,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952725899] [2023-01-28 06:53:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952725899] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:08,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:08,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:53:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835607367] [2023-01-28 06:53:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:53:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:08,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:53:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:53:08,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-01-28 06:53:08,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 329 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:08,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:08,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-01-28 06:53:08,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:09,728 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([612] L840-->L852: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_209 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_155 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0)))) (let ((.cse2 (and .cse11 (not (= (mod v_~z$w_buff0_used~0_156 256) 0)))) (.cse3 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_147 256) 0)))) (.cse4 (and .cse8 .cse11)) (.cse7 (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_199 256))))) (.cse5 (and .cse1 .cse10)) (.cse6 (and (not (= 0 (mod v_~x$w_buff0_used~0_210 256))) .cse10))) (and (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_198 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse2 v_~z$w_buff0~0_87 (ite .cse3 v_~z$w_buff1~0_78 v_~z~0_148)) v_~z~0_147) (= v_~z$w_buff0_used~0_155 (ite .cse2 0 v_~z$w_buff0_used~0_156)) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_147) v_~z$w_buff1_used~0_146) (= v_~z$r_buff0_thd3~0_37 (ite .cse4 0 v_~z$r_buff0_thd3~0_38)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse6 v_~x$w_buff0~0_95 (ite .cse7 v_~x$w_buff1~0_90 v_~x~0_146)) v_~x~0_145) (= v_~x$w_buff1_used~0_198 (ite (or .cse7 .cse5) 0 v_~x$w_buff1_used~0_199)) (= v_~x$w_buff0_used~0_209 (ite .cse6 0 v_~x$w_buff0_used~0_210)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$w_buff1_used~0_146 256) 0)))) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_145} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0][74], [P0Thread1of1ForFork1InUse, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 217#(<= ~__unbuffered_cnt~0 2), Black: 193#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 110#L872true, Black: 192#(= ~__unbuffered_cnt~0 0), 91#L820true, 173#true, 246#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 234#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 65#L3true, Black: 175#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), Black: 208#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 1), Black: 176#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0)))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= 2 ~z~0))))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0)))))), 231#(= ~a~0 1), Black: 182#(= ~__unbuffered_p1_EAX~0 0), 123#L852true, 206#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, 144#L781true, P3Thread1of1ForFork2InUse]) [2023-01-28 06:53:09,728 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:53:09,728 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:09,728 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:09,728 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:53:10,128 INFO L130 PetriNetUnfolder]: 4973/7299 cut-off events. [2023-01-28 06:53:10,129 INFO L131 PetriNetUnfolder]: For 8286/8712 co-relation queries the response was YES. [2023-01-28 06:53:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24785 conditions, 7299 events. 4973/7299 cut-off events. For 8286/8712 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 43312 event pairs, 712 based on Foata normal form. 103/7161 useless extension candidates. Maximal degree in co-relation 24759. Up to 3399 conditions per place. [2023-01-28 06:53:10,154 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 84 selfloop transitions, 22 changer transitions 64/176 dead transitions. [2023-01-28 06:53:10,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 176 transitions, 1209 flow [2023-01-28 06:53:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 06:53:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 06:53:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1473 transitions. [2023-01-28 06:53:10,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47996089931573804 [2023-01-28 06:53:10,159 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1473 transitions. [2023-01-28 06:53:10,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1473 transitions. [2023-01-28 06:53:10,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:10,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1473 transitions. [2023-01-28 06:53:10,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 133.9090909090909) internal successors, (1473), 11 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:10,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:10,167 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:10,167 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 329 flow. Second operand 11 states and 1473 transitions. [2023-01-28 06:53:10,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 176 transitions, 1209 flow [2023-01-28 06:53:10,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 1163 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 06:53:10,272 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 359 flow [2023-01-28 06:53:10,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=359, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-01-28 06:53:10,272 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-01-28 06:53:10,272 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 359 flow [2023-01-28 06:53:10,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:10,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:10,273 INFO L208 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] [2023-01-28 06:53:10,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:53:10,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:10,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2140264249, now seen corresponding path program 1 times [2023-01-28 06:53:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549054568] [2023-01-28 06:53:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549054568] [2023-01-28 06:53:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549054568] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:53:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448024568] [2023-01-28 06:53:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:17,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:53:17,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:17,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:53:17,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:53:17,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 279 [2023-01-28 06:53:17,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 359 flow. Second operand has 8 states, 8 states have (on average 110.625) internal successors, (885), 8 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:17,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:17,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 279 [2023-01-28 06:53:17,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:19,071 INFO L130 PetriNetUnfolder]: 8987/13174 cut-off events. [2023-01-28 06:53:19,071 INFO L131 PetriNetUnfolder]: For 20447/20447 co-relation queries the response was YES. [2023-01-28 06:53:19,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46941 conditions, 13174 events. 8987/13174 cut-off events. For 20447/20447 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 75621 event pairs, 716 based on Foata normal form. 2/13176 useless extension candidates. Maximal degree in co-relation 46920. Up to 6390 conditions per place. [2023-01-28 06:53:19,121 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 73 selfloop transitions, 4 changer transitions 130/207 dead transitions. [2023-01-28 06:53:19,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 207 transitions, 1762 flow [2023-01-28 06:53:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:53:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:53:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 971 transitions. [2023-01-28 06:53:19,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350358422939068 [2023-01-28 06:53:19,125 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 971 transitions. [2023-01-28 06:53:19,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 971 transitions. [2023-01-28 06:53:19,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:19,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 971 transitions. [2023-01-28 06:53:19,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.375) internal successors, (971), 8 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) [2023-01-28 06:53:19,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:19,130 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:19,130 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 359 flow. Second operand 8 states and 971 transitions. [2023-01-28 06:53:19,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 207 transitions, 1762 flow [2023-01-28 06:53:19,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 207 transitions, 1462 flow, removed 73 selfloop flow, removed 9 redundant places. [2023-01-28 06:53:19,380 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 298 flow [2023-01-28 06:53:19,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2023-01-28 06:53:19,381 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-01-28 06:53:19,381 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 298 flow [2023-01-28 06:53:19,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.625) internal successors, (885), 8 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:19,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:19,382 INFO L208 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] [2023-01-28 06:53:19,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:53:19,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:19,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 441029205, now seen corresponding path program 2 times [2023-01-28 06:53:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309927021] [2023-01-28 06:53:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:21,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:21,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309927021] [2023-01-28 06:53:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309927021] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 06:53:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369362227] [2023-01-28 06:53:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:21,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 06:53:21,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:21,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 06:53:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 06:53:21,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 279 [2023-01-28 06:53:21,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 298 flow. Second operand has 11 states, 11 states have (on average 116.45454545454545) internal successors, (1281), 11 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:21,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:21,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 279 [2023-01-28 06:53:21,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:23,156 INFO L130 PetriNetUnfolder]: 5092/7870 cut-off events. [2023-01-28 06:53:23,157 INFO L131 PetriNetUnfolder]: For 13300/13311 co-relation queries the response was YES. [2023-01-28 06:53:23,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28818 conditions, 7870 events. 5092/7870 cut-off events. For 13300/13311 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 45573 event pairs, 664 based on Foata normal form. 3/7833 useless extension candidates. Maximal degree in co-relation 28790. Up to 3004 conditions per place. [2023-01-28 06:53:23,182 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 118 selfloop transitions, 28 changer transitions 126/275 dead transitions. [2023-01-28 06:53:23,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 275 transitions, 2052 flow [2023-01-28 06:53:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 06:53:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-28 06:53:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2003 transitions. [2023-01-28 06:53:23,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44870071684587814 [2023-01-28 06:53:23,188 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2003 transitions. [2023-01-28 06:53:23,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2003 transitions. [2023-01-28 06:53:23,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:23,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2003 transitions. [2023-01-28 06:53:23,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 125.1875) internal successors, (2003), 16 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:23,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 279.0) internal successors, (4743), 17 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:23,198 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 279.0) internal successors, (4743), 17 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:23,198 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 298 flow. Second operand 16 states and 2003 transitions. [2023-01-28 06:53:23,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 275 transitions, 2052 flow [2023-01-28 06:53:23,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 275 transitions, 1876 flow, removed 88 selfloop flow, removed 7 redundant places. [2023-01-28 06:53:23,356 INFO L231 Difference]: Finished difference. Result has 85 places, 72 transitions, 512 flow [2023-01-28 06:53:23,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=512, PETRI_PLACES=85, PETRI_TRANSITIONS=72} [2023-01-28 06:53:23,357 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2023-01-28 06:53:23,357 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 72 transitions, 512 flow [2023-01-28 06:53:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 116.45454545454545) internal successors, (1281), 11 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:23,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:23,358 INFO L208 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] [2023-01-28 06:53:23,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:53:23,358 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:23,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1357980891, now seen corresponding path program 3 times [2023-01-28 06:53:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535187008] [2023-01-28 06:53:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535187008] [2023-01-28 06:53:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535187008] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:26,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 06:53:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557499341] [2023-01-28 06:53:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:26,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 06:53:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 06:53:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-01-28 06:53:26,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 279 [2023-01-28 06:53:26,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 72 transitions, 512 flow. Second operand has 11 states, 11 states have (on average 118.36363636363636) internal successors, (1302), 11 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:26,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:26,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 279 [2023-01-28 06:53:26,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:27,343 INFO L130 PetriNetUnfolder]: 4374/7039 cut-off events. [2023-01-28 06:53:27,343 INFO L131 PetriNetUnfolder]: For 30544/30645 co-relation queries the response was YES. [2023-01-28 06:53:27,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32392 conditions, 7039 events. 4374/7039 cut-off events. For 30544/30645 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 44127 event pairs, 1088 based on Foata normal form. 24/6986 useless extension candidates. Maximal degree in co-relation 32356. Up to 4164 conditions per place. [2023-01-28 06:53:27,371 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 81 selfloop transitions, 28 changer transitions 109/224 dead transitions. [2023-01-28 06:53:27,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 224 transitions, 1936 flow [2023-01-28 06:53:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:53:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:53:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1041 transitions. [2023-01-28 06:53:27,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46639784946236557 [2023-01-28 06:53:27,375 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1041 transitions. [2023-01-28 06:53:27,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1041 transitions. [2023-01-28 06:53:27,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:27,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1041 transitions. [2023-01-28 06:53:27,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.125) internal successors, (1041), 8 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:27,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:27,380 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:27,381 INFO L175 Difference]: Start difference. First operand has 85 places, 72 transitions, 512 flow. Second operand 8 states and 1041 transitions. [2023-01-28 06:53:27,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 224 transitions, 1936 flow [2023-01-28 06:53:27,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 224 transitions, 1841 flow, removed 40 selfloop flow, removed 6 redundant places. [2023-01-28 06:53:27,561 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 752 flow [2023-01-28 06:53:27,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=752, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2023-01-28 06:53:27,561 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2023-01-28 06:53:27,562 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 752 flow [2023-01-28 06:53:27,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.36363636363636) internal successors, (1302), 11 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:27,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:27,562 INFO L208 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] [2023-01-28 06:53:27,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:53:27,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:27,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash -162056023, now seen corresponding path program 4 times [2023-01-28 06:53:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:27,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549160132] [2023-01-28 06:53:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:53:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:53:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:53:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549160132] [2023-01-28 06:53:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549160132] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:53:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:53:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:53:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826340648] [2023-01-28 06:53:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:53:28,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:53:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:53:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:53:28,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:53:28,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 279 [2023-01-28 06:53:28,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:28,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:53:28,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 279 [2023-01-28 06:53:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:53:29,430 INFO L130 PetriNetUnfolder]: 3717/6069 cut-off events. [2023-01-28 06:53:29,430 INFO L131 PetriNetUnfolder]: For 28646/28916 co-relation queries the response was YES. [2023-01-28 06:53:29,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29423 conditions, 6069 events. 3717/6069 cut-off events. For 28646/28916 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 38615 event pairs, 971 based on Foata normal form. 93/6024 useless extension candidates. Maximal degree in co-relation 29385. Up to 3315 conditions per place. [2023-01-28 06:53:29,455 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 90 selfloop transitions, 10 changer transitions 33/143 dead transitions. [2023-01-28 06:53:29,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 1431 flow [2023-01-28 06:53:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:53:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:53:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-01-28 06:53:29,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910394265232975 [2023-01-28 06:53:29,457 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-01-28 06:53:29,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-01-28 06:53:29,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:53:29,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-01-28 06:53:29,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:29,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:29,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:29,459 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 752 flow. Second operand 4 states and 548 transitions. [2023-01-28 06:53:29,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 1431 flow [2023-01-28 06:53:29,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 1417 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 06:53:29,586 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 753 flow [2023-01-28 06:53:29,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=753, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2023-01-28 06:53:29,587 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2023-01-28 06:53:29,587 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 753 flow [2023-01-28 06:53:29,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:53:29,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:53:29,588 INFO L208 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] [2023-01-28 06:53:29,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:53:29,588 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:53:29,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:53:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2075710455, now seen corresponding path program 5 times [2023-01-28 06:53:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:53:29,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210050638] [2023-01-28 06:53:29,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:53:29,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:53:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:53:29,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:53:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:53:29,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:53:29,803 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:53:29,804 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-01-28 06:53:29,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-01-28 06:53:29,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-01-28 06:53:29,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-01-28 06:53:29,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-01-28 06:53:29,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-01-28 06:53:29,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-01-28 06:53:29,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-01-28 06:53:29,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-01-28 06:53:29,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:53:29,810 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:53:29,815 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:53:29,815 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:53:29,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:53:29 BasicIcfg [2023-01-28 06:53:29,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:53:29,920 INFO L158 Benchmark]: Toolchain (without parser) took 55502.23ms. Allocated memory was 343.9MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 300.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-28 06:53:29,920 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:53:29,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.59ms. Allocated memory is still 343.9MB. Free memory was 300.2MB in the beginning and 271.3MB in the end (delta: 28.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 06:53:29,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.03ms. Allocated memory is still 343.9MB. Free memory was 271.3MB in the beginning and 267.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:53:29,921 INFO L158 Benchmark]: Boogie Preprocessor took 33.42ms. Allocated memory is still 343.9MB. Free memory was 267.1MB in the beginning and 264.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:53:29,921 INFO L158 Benchmark]: RCFGBuilder took 905.23ms. Allocated memory is still 343.9MB. Free memory was 264.3MB in the beginning and 241.3MB in the end (delta: 22.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.0GB. [2023-01-28 06:53:29,921 INFO L158 Benchmark]: TraceAbstraction took 53886.31ms. Allocated memory was 343.9MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 241.3MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-01-28 06:53:29,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 605.59ms. Allocated memory is still 343.9MB. Free memory was 300.2MB in the beginning and 271.3MB in the end (delta: 28.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.03ms. Allocated memory is still 343.9MB. Free memory was 271.3MB in the beginning and 267.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.42ms. Allocated memory is still 343.9MB. Free memory was 267.1MB in the beginning and 264.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 905.23ms. Allocated memory is still 343.9MB. Free memory was 264.3MB in the beginning and 241.3MB in the end (delta: 22.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.0GB. * TraceAbstraction took 53886.31ms. Allocated memory was 343.9MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 241.3MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 158 PlacesBefore, 45 PlacesAfterwards, 147 TransitionsBefore, 32 TransitionsAfterwards, 3392 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 9980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3806, independent: 3544, independent conditional: 0, independent unconditional: 3544, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1803, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3806, independent: 1793, independent conditional: 0, independent unconditional: 1793, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 1803, unknown conditional: 0, unknown unconditional: 1803] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=-3, t625={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=-2, t625={5:0}, t626={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=-1, t625={5:0}, t626={6:0}, t627={7:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L926] 0 pthread_t t628; [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L776] 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) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L822] 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) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 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 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L842] 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) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 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 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 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) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 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 [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 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 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 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) [L961] 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)) [L962] 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)) [L963] 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)) [L964] 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)) [L965] 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)) [L966] 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)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 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: 923]: 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: 927]: 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: 921]: 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: 925]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 9 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: 53.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 721 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2200 IncrementalHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 27 mSDtfsCounter, 2200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=753occurred in iteration=14, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 4134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-01-28 06:53:29,941 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...