/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:07:28,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:07:28,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:07:29,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:07:29,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:07:29,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:07:29,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:07:29,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:07:29,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:07:29,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:07:29,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:07:29,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:07:29,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:07:29,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:07:29,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:07:29,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:07:29,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:07:29,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:07:29,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:07:29,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:07:29,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:07:29,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:07:29,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:07:29,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:07:29,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:07:29,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:07:29,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:07:29,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:07:29,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:07:29,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:07:29,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:07:29,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:07:29,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:07:29,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:07:29,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:07:29,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:07:29,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:07:29,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:07:29,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:07:29,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:07:29,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:07:29,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 11:07:29,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:07:29,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:07:29,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:07:29,100 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:07:29,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:07:29,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:07:29,101 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:07:29,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:07:29,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:07:29,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:07:29,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:07:29,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:07:29,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:07:29,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:07:29,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:07:29,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:07:29,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:07:29,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:07:29,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:07:29,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 11:07:29,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:07:29,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:07:29,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:07:29,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:07:29,332 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:07:29,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2022-01-19 11:07:29,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3043d9c/750ccb50e7454db1bfcb2769cc7c6f9b/FLAG386f72188 [2022-01-19 11:07:29,822 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:07:29,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2022-01-19 11:07:29,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3043d9c/750ccb50e7454db1bfcb2769cc7c6f9b/FLAG386f72188 [2022-01-19 11:07:30,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3043d9c/750ccb50e7454db1bfcb2769cc7c6f9b [2022-01-19 11:07:30,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:07:30,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:07:30,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:07:30,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:07:30,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:07:30,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7edfd921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30, skipping insertion in model container [2022-01-19 11:07:30,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:07:30,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:07:30,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i[944,957] [2022-01-19 11:07:30,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:07:30,615 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:07:30,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i[944,957] [2022-01-19 11:07:30,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:07:30,703 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:07:30,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30 WrapperNode [2022-01-19 11:07:30,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:07:30,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:07:30,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:07:30,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:07:30,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,756 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 295 [2022-01-19 11:07:30,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:07:30,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:07:30,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:07:30,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:07:30,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:07:30,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:07:30,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:07:30,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:07:30,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (1/1) ... [2022-01-19 11:07:30,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:07:30,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:07:30,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 11:07:30,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 11:07:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:07:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:07:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:07:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:07:30,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:07:30,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:07:30,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 11:07:30,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:07:30,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:07:30,855 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:07:30,968 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:07:30,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:07:31,469 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:07:31,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:07:31,737 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:07:31,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:07:31 BoogieIcfgContainer [2022-01-19 11:07:31,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:07:31,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:07:31,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:07:31,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:07:31,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:07:30" (1/3) ... [2022-01-19 11:07:31,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ea1d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:07:31, skipping insertion in model container [2022-01-19 11:07:31,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:30" (2/3) ... [2022-01-19 11:07:31,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ea1d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:07:31, skipping insertion in model container [2022-01-19 11:07:31,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:07:31" (3/3) ... [2022-01-19 11:07:31,745 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2022-01-19 11:07:31,749 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:07:31,749 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:07:31,749 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:07:31,787 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,788 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,789 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,789 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,789 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,789 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,790 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,791 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,791 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,791 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,791 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,792 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,797 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,797 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,797 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,797 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,800 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,801 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,801 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,801 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,802 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,803 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,807 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,808 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,808 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,808 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,808 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,808 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,808 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,813 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,816 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,817 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,819 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,819 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,819 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,820 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,821 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,822 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,822 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,822 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,822 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,822 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,822 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,824 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,825 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,825 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,825 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,825 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,826 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,830 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,830 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,830 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,830 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,832 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,832 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,832 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,832 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,832 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,839 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,840 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,841 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,845 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,845 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,845 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,845 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:31,845 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:07:31,887 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:07:31,892 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 11:07:31,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:07:31,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-01-19 11:07:31,946 INFO L129 PetriNetUnfolder]: 2/131 cut-off events. [2022-01-19 11:07:31,947 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:07:31,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-01-19 11:07:31,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2022-01-19 11:07:31,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2022-01-19 11:07:31,977 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2022-01-19 11:07:31,978 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:07:31,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:31,979 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:31,979 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash -193157899, now seen corresponding path program 1 times [2022-01-19 11:07:31,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:31,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576713539] [2022-01-19 11:07:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:31,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:32,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:32,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576713539] [2022-01-19 11:07:32,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576713539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:32,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:32,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:07:32,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736137992] [2022-01-19 11:07:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:32,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:07:32,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:07:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:07:32,257 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 135 [2022-01-19 11:07:32,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:32,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:32,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 135 [2022-01-19 11:07:32,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:32,350 INFO L129 PetriNetUnfolder]: 14/170 cut-off events. [2022-01-19 11:07:32,351 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 11:07:32,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 170 events. 14/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 273 event pairs, 2 based on Foata normal form. 5/166 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2022-01-19 11:07:32,353 INFO L132 encePairwiseOnDemand]: 130/135 looper letters, 10 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2022-01-19 11:07:32,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 129 transitions, 294 flow [2022-01-19 11:07:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:07:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:07:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-01-19 11:07:32,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9382716049382716 [2022-01-19 11:07:32,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2022-01-19 11:07:32,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2022-01-19 11:07:32,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:32,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2022-01-19 11:07:32,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:32,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:32,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:32,375 INFO L186 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 3 states and 380 transitions. [2022-01-19 11:07:32,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 129 transitions, 294 flow [2022-01-19 11:07:32,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 11:07:32,379 INFO L242 Difference]: Finished difference. Result has 138 places, 127 transitions, 266 flow [2022-01-19 11:07:32,381 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2022-01-19 11:07:32,383 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -4 predicate places. [2022-01-19 11:07:32,383 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 266 flow [2022-01-19 11:07:32,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:32,384 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:32,384 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:32,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:07:32,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2039374663, now seen corresponding path program 1 times [2022-01-19 11:07:32,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:32,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560760000] [2022-01-19 11:07:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:32,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:32,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:32,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560760000] [2022-01-19 11:07:32,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560760000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:32,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:32,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:32,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448475005] [2022-01-19 11:07:32,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:32,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:32,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:32,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:32,561 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 135 [2022-01-19 11:07:32,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:32,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:32,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 135 [2022-01-19 11:07:32,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:33,491 INFO L129 PetriNetUnfolder]: 1866/4712 cut-off events. [2022-01-19 11:07:33,491 INFO L130 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-01-19 11:07:33,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 4712 events. 1866/4712 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 40200 event pairs, 277 based on Foata normal form. 0/4593 useless extension candidates. Maximal degree in co-relation 7543. Up to 1023 conditions per place. [2022-01-19 11:07:33,511 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 32 selfloop transitions, 7 changer transitions 80/208 dead transitions. [2022-01-19 11:07:33,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 208 transitions, 646 flow [2022-01-19 11:07:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:07:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:07:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1487 transitions. [2022-01-19 11:07:33,515 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8472934472934472 [2022-01-19 11:07:33,515 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1487 transitions. [2022-01-19 11:07:33,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1487 transitions. [2022-01-19 11:07:33,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:33,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1487 transitions. [2022-01-19 11:07:33,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.38461538461539) internal successors, (1487), 13 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:33,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:33,523 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:33,523 INFO L186 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 13 states and 1487 transitions. [2022-01-19 11:07:33,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 208 transitions, 646 flow [2022-01-19 11:07:33,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 208 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:07:33,526 INFO L242 Difference]: Finished difference. Result has 160 places, 118 transitions, 334 flow [2022-01-19 11:07:33,526 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=334, PETRI_PLACES=160, PETRI_TRANSITIONS=118} [2022-01-19 11:07:33,527 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2022-01-19 11:07:33,527 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 118 transitions, 334 flow [2022-01-19 11:07:33,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:33,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:33,527 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:33,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:07:33,528 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1913398270, now seen corresponding path program 1 times [2022-01-19 11:07:33,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:33,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394525661] [2022-01-19 11:07:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:33,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:33,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:33,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394525661] [2022-01-19 11:07:33,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394525661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:33,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:33,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:33,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566653095] [2022-01-19 11:07:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:33,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:33,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:33,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:33,746 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 135 [2022-01-19 11:07:33,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 118 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:33,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:33,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 135 [2022-01-19 11:07:33,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:34,401 INFO L129 PetriNetUnfolder]: 1171/2596 cut-off events. [2022-01-19 11:07:34,401 INFO L130 PetriNetUnfolder]: For 6575/6591 co-relation queries the response was YES. [2022-01-19 11:07:34,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 2596 events. 1171/2596 cut-off events. For 6575/6591 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18028 event pairs, 379 based on Foata normal form. 53/2555 useless extension candidates. Maximal degree in co-relation 8697. Up to 906 conditions per place. [2022-01-19 11:07:34,419 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 38 selfloop transitions, 16 changer transitions 58/201 dead transitions. [2022-01-19 11:07:34,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 201 transitions, 1100 flow [2022-01-19 11:07:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:07:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:07:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1488 transitions. [2022-01-19 11:07:34,422 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8478632478632478 [2022-01-19 11:07:34,422 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1488 transitions. [2022-01-19 11:07:34,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1488 transitions. [2022-01-19 11:07:34,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:34,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1488 transitions. [2022-01-19 11:07:34,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.46153846153847) internal successors, (1488), 13 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:34,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:34,428 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:34,428 INFO L186 Difference]: Start difference. First operand has 160 places, 118 transitions, 334 flow. Second operand 13 states and 1488 transitions. [2022-01-19 11:07:34,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 201 transitions, 1100 flow [2022-01-19 11:07:34,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 201 transitions, 1048 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-01-19 11:07:34,447 INFO L242 Difference]: Finished difference. Result has 156 places, 125 transitions, 459 flow [2022-01-19 11:07:34,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=459, PETRI_PLACES=156, PETRI_TRANSITIONS=125} [2022-01-19 11:07:34,448 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 14 predicate places. [2022-01-19 11:07:34,449 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 125 transitions, 459 flow [2022-01-19 11:07:34,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:34,449 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:34,449 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:34,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:07:34,450 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1977425509, now seen corresponding path program 1 times [2022-01-19 11:07:34,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:34,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855719873] [2022-01-19 11:07:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:34,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:34,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:34,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855719873] [2022-01-19 11:07:34,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855719873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:34,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:34,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:07:34,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805947984] [2022-01-19 11:07:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:34,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:07:34,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:34,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:07:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:07:34,562 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-01-19 11:07:34,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 125 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:34,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:34,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-01-19 11:07:34,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:36,236 INFO L129 PetriNetUnfolder]: 7516/12876 cut-off events. [2022-01-19 11:07:36,236 INFO L130 PetriNetUnfolder]: For 30168/35293 co-relation queries the response was YES. [2022-01-19 11:07:36,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36864 conditions, 12876 events. 7516/12876 cut-off events. For 30168/35293 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 106092 event pairs, 674 based on Foata normal form. 91/11688 useless extension candidates. Maximal degree in co-relation 36783. Up to 4212 conditions per place. [2022-01-19 11:07:36,355 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 77 selfloop transitions, 18 changer transitions 18/214 dead transitions. [2022-01-19 11:07:36,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 214 transitions, 1142 flow [2022-01-19 11:07:36,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:07:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:07:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1191 transitions. [2022-01-19 11:07:36,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8822222222222222 [2022-01-19 11:07:36,358 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1191 transitions. [2022-01-19 11:07:36,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1191 transitions. [2022-01-19 11:07:36,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:36,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1191 transitions. [2022-01-19 11:07:36,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.1) internal successors, (1191), 10 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:36,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:36,362 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:36,362 INFO L186 Difference]: Start difference. First operand has 156 places, 125 transitions, 459 flow. Second operand 10 states and 1191 transitions. [2022-01-19 11:07:36,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 214 transitions, 1142 flow [2022-01-19 11:07:36,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 214 transitions, 1112 flow, removed 15 selfloop flow, removed 12 redundant places. [2022-01-19 11:07:36,397 INFO L242 Difference]: Finished difference. Result has 150 places, 141 transitions, 561 flow [2022-01-19 11:07:36,397 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=561, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2022-01-19 11:07:36,397 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 8 predicate places. [2022-01-19 11:07:36,398 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 561 flow [2022-01-19 11:07:36,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:36,398 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:36,398 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:36,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:07:36,398 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1598572690, now seen corresponding path program 1 times [2022-01-19 11:07:36,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:36,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902370736] [2022-01-19 11:07:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:36,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:36,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:36,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902370736] [2022-01-19 11:07:36,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902370736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:36,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:36,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:07:36,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934178449] [2022-01-19 11:07:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:36,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:07:36,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:07:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:07:36,472 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2022-01-19 11:07:36,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:36,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:36,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2022-01-19 11:07:36,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:37,274 INFO L129 PetriNetUnfolder]: 2058/6544 cut-off events. [2022-01-19 11:07:37,274 INFO L130 PetriNetUnfolder]: For 11619/13020 co-relation queries the response was YES. [2022-01-19 11:07:37,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19333 conditions, 6544 events. 2058/6544 cut-off events. For 11619/13020 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 70756 event pairs, 892 based on Foata normal form. 124/6126 useless extension candidates. Maximal degree in co-relation 19255. Up to 1622 conditions per place. [2022-01-19 11:07:37,346 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 46 selfloop transitions, 15 changer transitions 0/175 dead transitions. [2022-01-19 11:07:37,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 175 transitions, 882 flow [2022-01-19 11:07:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:07:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:07:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1063 transitions. [2022-01-19 11:07:37,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8748971193415638 [2022-01-19 11:07:37,348 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1063 transitions. [2022-01-19 11:07:37,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1063 transitions. [2022-01-19 11:07:37,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:37,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1063 transitions. [2022-01-19 11:07:37,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:37,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:37,352 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:37,352 INFO L186 Difference]: Start difference. First operand has 150 places, 141 transitions, 561 flow. Second operand 9 states and 1063 transitions. [2022-01-19 11:07:37,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 175 transitions, 882 flow [2022-01-19 11:07:37,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 880 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 11:07:37,374 INFO L242 Difference]: Finished difference. Result has 164 places, 149 transitions, 686 flow [2022-01-19 11:07:37,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=686, PETRI_PLACES=164, PETRI_TRANSITIONS=149} [2022-01-19 11:07:37,375 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 22 predicate places. [2022-01-19 11:07:37,375 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 149 transitions, 686 flow [2022-01-19 11:07:37,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:37,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:37,375 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:37,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:07:37,376 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -839566244, now seen corresponding path program 1 times [2022-01-19 11:07:37,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:37,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169464415] [2022-01-19 11:07:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:37,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:37,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:37,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169464415] [2022-01-19 11:07:37,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169464415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:37,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:37,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:37,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99918617] [2022-01-19 11:07:37,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:37,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:37,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:37,454 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-01-19 11:07:37,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 149 transitions, 686 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:37,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:37,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-01-19 11:07:37,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:39,957 INFO L129 PetriNetUnfolder]: 9450/16976 cut-off events. [2022-01-19 11:07:39,958 INFO L130 PetriNetUnfolder]: For 61830/70403 co-relation queries the response was YES. [2022-01-19 11:07:40,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65645 conditions, 16976 events. 9450/16976 cut-off events. For 61830/70403 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 154073 event pairs, 592 based on Foata normal form. 699/16549 useless extension candidates. Maximal degree in co-relation 65560. Up to 5075 conditions per place. [2022-01-19 11:07:40,069 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 95 selfloop transitions, 36 changer transitions 26/266 dead transitions. [2022-01-19 11:07:40,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 266 transitions, 1830 flow [2022-01-19 11:07:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:07:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:07:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1550 transitions. [2022-01-19 11:07:40,073 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8831908831908832 [2022-01-19 11:07:40,073 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1550 transitions. [2022-01-19 11:07:40,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1550 transitions. [2022-01-19 11:07:40,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:40,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1550 transitions. [2022-01-19 11:07:40,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.23076923076923) internal successors, (1550), 13 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:40,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:40,078 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:40,079 INFO L186 Difference]: Start difference. First operand has 164 places, 149 transitions, 686 flow. Second operand 13 states and 1550 transitions. [2022-01-19 11:07:40,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 266 transitions, 1830 flow [2022-01-19 11:07:40,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 266 transitions, 1815 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-01-19 11:07:40,183 INFO L242 Difference]: Finished difference. Result has 181 places, 170 transitions, 964 flow [2022-01-19 11:07:40,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=964, PETRI_PLACES=181, PETRI_TRANSITIONS=170} [2022-01-19 11:07:40,184 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 39 predicate places. [2022-01-19 11:07:40,184 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 170 transitions, 964 flow [2022-01-19 11:07:40,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:40,184 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:40,184 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:40,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:07:40,185 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash -573530045, now seen corresponding path program 1 times [2022-01-19 11:07:40,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:40,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121212930] [2022-01-19 11:07:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:40,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:40,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121212930] [2022-01-19 11:07:40,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121212930] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:40,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:40,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:07:40,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631219437] [2022-01-19 11:07:40,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:40,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:07:40,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:07:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:07:40,319 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-01-19 11:07:40,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 170 transitions, 964 flow. Second operand has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:40,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:40,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-01-19 11:07:40,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:42,756 INFO L129 PetriNetUnfolder]: 8677/16241 cut-off events. [2022-01-19 11:07:42,756 INFO L130 PetriNetUnfolder]: For 92828/103954 co-relation queries the response was YES. [2022-01-19 11:07:42,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74117 conditions, 16241 events. 8677/16241 cut-off events. For 92828/103954 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 154704 event pairs, 337 based on Foata normal form. 964/16166 useless extension candidates. Maximal degree in co-relation 74024. Up to 4516 conditions per place. [2022-01-19 11:07:42,874 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 100 selfloop transitions, 50 changer transitions 59/310 dead transitions. [2022-01-19 11:07:42,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 310 transitions, 2492 flow [2022-01-19 11:07:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:07:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:07:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1909 transitions. [2022-01-19 11:07:42,877 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8837962962962963 [2022-01-19 11:07:42,877 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1909 transitions. [2022-01-19 11:07:42,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1909 transitions. [2022-01-19 11:07:42,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:42,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1909 transitions. [2022-01-19 11:07:42,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.3125) internal successors, (1909), 16 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:42,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:42,884 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:42,884 INFO L186 Difference]: Start difference. First operand has 181 places, 170 transitions, 964 flow. Second operand 16 states and 1909 transitions. [2022-01-19 11:07:42,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 310 transitions, 2492 flow [2022-01-19 11:07:44,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 310 transitions, 2385 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-01-19 11:07:44,208 INFO L242 Difference]: Finished difference. Result has 197 places, 181 transitions, 1175 flow [2022-01-19 11:07:44,209 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1175, PETRI_PLACES=197, PETRI_TRANSITIONS=181} [2022-01-19 11:07:44,209 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 55 predicate places. [2022-01-19 11:07:44,209 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 181 transitions, 1175 flow [2022-01-19 11:07:44,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.125) internal successors, (897), 8 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:44,210 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:44,210 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:44,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:07:44,210 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:44,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash -444979847, now seen corresponding path program 1 times [2022-01-19 11:07:44,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:44,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127065081] [2022-01-19 11:07:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:44,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:44,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:44,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127065081] [2022-01-19 11:07:44,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127065081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:44,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:44,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:44,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119682517] [2022-01-19 11:07:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:44,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:44,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:44,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-01-19 11:07:44,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 181 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:44,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:44,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-01-19 11:07:44,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:45,477 INFO L129 PetriNetUnfolder]: 2575/9391 cut-off events. [2022-01-19 11:07:45,477 INFO L130 PetriNetUnfolder]: For 48420/49907 co-relation queries the response was YES. [2022-01-19 11:07:45,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37022 conditions, 9391 events. 2575/9391 cut-off events. For 48420/49907 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 122410 event pairs, 58 based on Foata normal form. 20/8823 useless extension candidates. Maximal degree in co-relation 36922. Up to 2165 conditions per place. [2022-01-19 11:07:45,567 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 42 selfloop transitions, 3 changer transitions 10/213 dead transitions. [2022-01-19 11:07:45,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 213 transitions, 1485 flow [2022-01-19 11:07:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:07:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:07:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2022-01-19 11:07:45,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2022-01-19 11:07:45,569 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2022-01-19 11:07:45,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2022-01-19 11:07:45,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:45,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2022-01-19 11:07:45,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:45,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:45,572 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:45,572 INFO L186 Difference]: Start difference. First operand has 197 places, 181 transitions, 1175 flow. Second operand 7 states and 828 transitions. [2022-01-19 11:07:45,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 213 transitions, 1485 flow [2022-01-19 11:07:47,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 213 transitions, 1232 flow, removed 94 selfloop flow, removed 15 redundant places. [2022-01-19 11:07:47,079 INFO L242 Difference]: Finished difference. Result has 187 places, 182 transitions, 985 flow [2022-01-19 11:07:47,080 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=985, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2022-01-19 11:07:47,080 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 45 predicate places. [2022-01-19 11:07:47,080 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 985 flow [2022-01-19 11:07:47,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:47,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:47,081 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:47,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:07:47,081 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -600729747, now seen corresponding path program 2 times [2022-01-19 11:07:47,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46318613] [2022-01-19 11:07:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:47,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:47,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:47,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46318613] [2022-01-19 11:07:47,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46318613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:47,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:47,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:07:47,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863531647] [2022-01-19 11:07:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:47,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:07:47,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:07:47,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:07:47,196 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-01-19 11:07:47,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 985 flow. Second operand has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:47,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:47,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-01-19 11:07:47,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:50,488 INFO L129 PetriNetUnfolder]: 11357/22964 cut-off events. [2022-01-19 11:07:50,488 INFO L130 PetriNetUnfolder]: For 78507/90166 co-relation queries the response was YES. [2022-01-19 11:07:50,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86436 conditions, 22964 events. 11357/22964 cut-off events. For 78507/90166 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 248647 event pairs, 445 based on Foata normal form. 1252/22777 useless extension candidates. Maximal degree in co-relation 86399. Up to 3559 conditions per place. [2022-01-19 11:07:50,836 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 64 selfloop transitions, 43 changer transitions 87/294 dead transitions. [2022-01-19 11:07:50,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 294 transitions, 2198 flow [2022-01-19 11:07:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 11:07:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 11:07:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2225 transitions. [2022-01-19 11:07:50,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2022-01-19 11:07:50,841 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2225 transitions. [2022-01-19 11:07:50,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2225 transitions. [2022-01-19 11:07:50,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:50,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2225 transitions. [2022-01-19 11:07:50,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 117.10526315789474) internal successors, (2225), 19 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:50,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 135.0) internal successors, (2700), 20 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:50,849 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 135.0) internal successors, (2700), 20 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:50,849 INFO L186 Difference]: Start difference. First operand has 187 places, 182 transitions, 985 flow. Second operand 19 states and 2225 transitions. [2022-01-19 11:07:50,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 294 transitions, 2198 flow [2022-01-19 11:07:53,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 294 transitions, 2092 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-01-19 11:07:53,123 INFO L242 Difference]: Finished difference. Result has 204 places, 165 transitions, 927 flow [2022-01-19 11:07:53,123 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=927, PETRI_PLACES=204, PETRI_TRANSITIONS=165} [2022-01-19 11:07:53,123 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 62 predicate places. [2022-01-19 11:07:53,123 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 165 transitions, 927 flow [2022-01-19 11:07:53,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:53,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:53,124 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:53,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:07:53,124 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1963832139, now seen corresponding path program 1 times [2022-01-19 11:07:53,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:53,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110870779] [2022-01-19 11:07:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:53,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:53,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110870779] [2022-01-19 11:07:53,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110870779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:53,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:53,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:53,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024671449] [2022-01-19 11:07:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:53,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:53,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:53,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:53,228 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-01-19 11:07:53,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 165 transitions, 927 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:53,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:53,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-01-19 11:07:53,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:54,185 INFO L129 PetriNetUnfolder]: 1927/8046 cut-off events. [2022-01-19 11:07:54,186 INFO L130 PetriNetUnfolder]: For 23300/24251 co-relation queries the response was YES. [2022-01-19 11:07:54,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27023 conditions, 8046 events. 1927/8046 cut-off events. For 23300/24251 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 106747 event pairs, 79 based on Foata normal form. 2/7529 useless extension candidates. Maximal degree in co-relation 26961. Up to 1050 conditions per place. [2022-01-19 11:07:54,335 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 19 selfloop transitions, 1 changer transitions 30/184 dead transitions. [2022-01-19 11:07:54,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 184 transitions, 1111 flow [2022-01-19 11:07:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:07:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:07:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2022-01-19 11:07:54,338 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2022-01-19 11:07:54,338 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2022-01-19 11:07:54,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2022-01-19 11:07:54,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:54,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2022-01-19 11:07:54,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:54,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:54,340 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:54,340 INFO L186 Difference]: Start difference. First operand has 204 places, 165 transitions, 927 flow. Second operand 7 states and 812 transitions. [2022-01-19 11:07:54,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 184 transitions, 1111 flow [2022-01-19 11:07:54,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 184 transitions, 920 flow, removed 49 selfloop flow, removed 23 redundant places. [2022-01-19 11:07:54,690 INFO L242 Difference]: Finished difference. Result has 182 places, 153 transitions, 666 flow [2022-01-19 11:07:54,690 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=666, PETRI_PLACES=182, PETRI_TRANSITIONS=153} [2022-01-19 11:07:54,691 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 40 predicate places. [2022-01-19 11:07:54,691 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 153 transitions, 666 flow [2022-01-19 11:07:54,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:54,691 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:54,691 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:54,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:07:54,692 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1761916705, now seen corresponding path program 2 times [2022-01-19 11:07:54,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:54,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480570250] [2022-01-19 11:07:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:54,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:54,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:54,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480570250] [2022-01-19 11:07:54,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480570250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:54,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:54,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 11:07:54,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982262977] [2022-01-19 11:07:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:54,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 11:07:54,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:54,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 11:07:54,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-19 11:07:54,892 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2022-01-19 11:07:54,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 153 transitions, 666 flow. Second operand has 11 states, 11 states have (on average 109.0909090909091) internal successors, (1200), 11 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:54,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:54,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2022-01-19 11:07:54,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:55,133 INFO L129 PetriNetUnfolder]: 345/1451 cut-off events. [2022-01-19 11:07:55,134 INFO L130 PetriNetUnfolder]: For 2004/2055 co-relation queries the response was YES. [2022-01-19 11:07:55,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1451 events. 345/1451 cut-off events. For 2004/2055 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 13603 event pairs, 2 based on Foata normal form. 1/1366 useless extension candidates. Maximal degree in co-relation 3914. Up to 176 conditions per place. [2022-01-19 11:07:55,140 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 17 selfloop transitions, 7 changer transitions 36/161 dead transitions. [2022-01-19 11:07:55,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 161 transitions, 766 flow [2022-01-19 11:07:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:07:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:07:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1316 transitions. [2022-01-19 11:07:55,142 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8123456790123457 [2022-01-19 11:07:55,142 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1316 transitions. [2022-01-19 11:07:55,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1316 transitions. [2022-01-19 11:07:55,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:55,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1316 transitions. [2022-01-19 11:07:55,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 109.66666666666667) internal successors, (1316), 12 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:55,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:55,146 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:55,146 INFO L186 Difference]: Start difference. First operand has 182 places, 153 transitions, 666 flow. Second operand 12 states and 1316 transitions. [2022-01-19 11:07:55,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 161 transitions, 766 flow [2022-01-19 11:07:55,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 161 transitions, 725 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-01-19 11:07:55,161 INFO L242 Difference]: Finished difference. Result has 183 places, 125 transitions, 436 flow [2022-01-19 11:07:55,162 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=436, PETRI_PLACES=183, PETRI_TRANSITIONS=125} [2022-01-19 11:07:55,162 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 41 predicate places. [2022-01-19 11:07:55,162 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 125 transitions, 436 flow [2022-01-19 11:07:55,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.0909090909091) internal successors, (1200), 11 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:55,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:55,163 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:55,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:07:55,163 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1822831729, now seen corresponding path program 3 times [2022-01-19 11:07:55,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941155506] [2022-01-19 11:07:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:55,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:07:55,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:07:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:07:55,301 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:07:55,301 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:07:55,302 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 11:07:55,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 11:07:55,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 11:07:55,303 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 11:07:55,305 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 11:07:55,305 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 11:07:55,305 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 11:07:55,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 11:07:55,308 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:55,312 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:07:55,312 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:07:55,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:07:55 BasicIcfg [2022-01-19 11:07:55,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:07:55,463 INFO L158 Benchmark]: Toolchain (without parser) took 25271.05ms. Allocated memory was 404.8MB in the beginning and 7.1GB in the end (delta: 6.7GB). Free memory was 347.4MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 935.6MB. Max. memory is 16.0GB. [2022-01-19 11:07:55,463 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 404.8MB. Free memory is still 365.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:07:55,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.82ms. Allocated memory was 404.8MB in the beginning and 557.8MB in the end (delta: 153.1MB). Free memory was 347.2MB in the beginning and 515.3MB in the end (delta: -168.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-19 11:07:55,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.04ms. Allocated memory is still 557.8MB. Free memory was 515.3MB in the beginning and 512.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:07:55,464 INFO L158 Benchmark]: Boogie Preprocessor took 27.51ms. Allocated memory is still 557.8MB. Free memory was 512.1MB in the beginning and 509.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 11:07:55,465 INFO L158 Benchmark]: RCFGBuilder took 953.60ms. Allocated memory is still 557.8MB. Free memory was 509.0MB in the beginning and 403.1MB in the end (delta: 105.9MB). Peak memory consumption was 104.9MB. Max. memory is 16.0GB. [2022-01-19 11:07:55,466 INFO L158 Benchmark]: TraceAbstraction took 23723.12ms. Allocated memory was 557.8MB in the beginning and 7.1GB in the end (delta: 6.6GB). Free memory was 403.1MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 836.9MB. Max. memory is 16.0GB. [2022-01-19 11:07:55,467 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.09ms. Allocated memory is still 404.8MB. Free memory is still 365.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 509.82ms. Allocated memory was 404.8MB in the beginning and 557.8MB in the end (delta: 153.1MB). Free memory was 347.2MB in the beginning and 515.3MB in the end (delta: -168.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.04ms. Allocated memory is still 557.8MB. Free memory was 515.3MB in the beginning and 512.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.51ms. Allocated memory is still 557.8MB. Free memory was 512.1MB in the beginning and 509.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 953.60ms. Allocated memory is still 557.8MB. Free memory was 509.0MB in the beginning and 403.1MB in the end (delta: 105.9MB). Peak memory consumption was 104.9MB. Max. memory is 16.0GB. * TraceAbstraction took 23723.12ms. Allocated memory was 557.8MB in the beginning and 7.1GB in the end (delta: 6.6GB). Free memory was 403.1MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 836.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=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] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L864] 0 pthread_t t469; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-3, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L866] 0 pthread_t t470; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-2, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L868] 0 pthread_t t471; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L870] 0 pthread_t t472; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] EXPR 4 !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) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L827] EXPR 4 !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) [L827] 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) [L828] EXPR 4 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)) [L828] 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)) [L829] EXPR 4 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)) [L829] 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)) [L830] EXPR 4 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)) [L830] 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)) [L831] EXPR 4 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)) [L831] 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)) [L832] EXPR 4 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)) [L832] 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)) [L833] EXPR 4 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)) [L833] 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)) [L834] 4 __unbuffered_p3_EAX = z [L835] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L842] 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) [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L844] 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 [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L846] 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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] 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) [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L879] 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 [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L881] 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 [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 867]: 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, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 532 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1466 IncrementalHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 120 mSDtfsCounter, 1466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1175occurred in iteration=7, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1016 ConstructedInterpolants, 0 QuantifiedInterpolants, 4464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 11:07:55,502 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...