/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:52:25,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:52:25,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:52:25,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:52:25,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:52:25,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:52:25,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:52:25,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:52:25,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:52:25,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:52:25,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:52:25,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:52:25,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:52:25,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:52:25,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:52:25,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:52:25,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:52:25,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:52:25,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:52:25,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:52:25,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:52:25,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:52:25,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:52:25,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:52:25,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:52:25,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:52:25,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:52:25,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:52:25,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:52:25,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:52:25,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:52:25,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:52:25,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:52:25,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:52:25,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:52:25,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:52:25,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:52:25,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:52:25,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:52:25,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:52:25,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:52:25,237 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-Before.epf [2022-01-19 04:52:25,267 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:52:25,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:52:25,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:52:25,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:52:25,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:52:25,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:52:25,269 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:52:25,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:52:25,269 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:52:25,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:52:25,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:52:25,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:52:25,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:52:25,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:52:25,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:52:25,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:52:25,272 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:52:25,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:52:25,272 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:52:25,272 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 04:52:25,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:52:25,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:52:25,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:52:25,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:52:25,514 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:52:25,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2022-01-19 04:52:25,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12112bfbf/c0eff4001728468da95bd7d7affa2b56/FLAGb1bd1c4f2 [2022-01-19 04:52:25,987 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:52:25,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2022-01-19 04:52:26,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12112bfbf/c0eff4001728468da95bd7d7affa2b56/FLAGb1bd1c4f2 [2022-01-19 04:52:26,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12112bfbf/c0eff4001728468da95bd7d7affa2b56 [2022-01-19 04:52:26,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:52:26,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:52:26,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:52:26,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:52:26,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:52:26,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50498754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26, skipping insertion in model container [2022-01-19 04:52:26,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:52:26,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:52:26,285 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/mix044_tso.oepc.i[949,962] [2022-01-19 04:52:26,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:52:26,424 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:52:26,436 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/mix044_tso.oepc.i[949,962] [2022-01-19 04:52:26,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:52:26,544 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:52:26,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26 WrapperNode [2022-01-19 04:52:26,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:52:26,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:52:26,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:52:26,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:52:26,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,594 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292 [2022-01-19 04:52:26,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:52:26,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:52:26,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:52:26,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:52:26,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:52:26,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:52:26,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:52:26,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:52:26,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (1/1) ... [2022-01-19 04:52:26,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:52:26,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:52:26,680 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 04:52:26,691 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 04:52:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:52:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:52:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:52:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:52:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:52:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:52:26,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:52:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:52:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:52:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:52:26,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:52:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 04:52:26,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 04:52:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:52:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:52:26,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:52:26,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:52:26,719 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 04:52:26,822 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:52:26,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:52:27,349 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:52:27,698 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:52:27,698 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:52:27,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:52:27 BoogieIcfgContainer [2022-01-19 04:52:27,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:52:27,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:52:27,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:52:27,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:52:27,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:52:26" (1/3) ... [2022-01-19 04:52:27,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e58cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:52:27, skipping insertion in model container [2022-01-19 04:52:27,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:52:26" (2/3) ... [2022-01-19 04:52:27,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e58cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:52:27, skipping insertion in model container [2022-01-19 04:52:27,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:52:27" (3/3) ... [2022-01-19 04:52:27,708 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-01-19 04:52:27,712 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:52:27,713 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:52:27,713 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:52:27,769 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,770 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,771 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,771 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,772 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,772 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,772 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,772 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,772 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,773 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,774 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,774 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,774 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,774 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,774 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,775 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,775 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,776 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,776 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,776 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,778 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,782 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,783 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,784 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,790 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,790 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,791 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,793 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,797 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,797 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,797 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,797 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,798 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,798 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,798 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,798 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,798 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,798 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,805 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,806 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,807 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,807 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,807 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,807 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,807 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,808 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,809 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,809 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,809 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,809 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,809 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,809 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,810 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,810 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,810 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,811 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,812 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,813 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,813 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:52:27,814 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:52:27,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:52:27,880 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 04:52:27,880 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 04:52:27,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-01-19 04:52:27,955 INFO L129 PetriNetUnfolder]: 2/135 cut-off events. [2022-01-19 04:52:27,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:52:27,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-01-19 04:52:27,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-01-19 04:52:27,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-01-19 04:52:27,978 INFO L129 PetriNetUnfolder]: 0/64 cut-off events. [2022-01-19 04:52:27,978 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:52:27,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:27,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] [2022-01-19 04:52:27,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1560958310, now seen corresponding path program 1 times [2022-01-19 04:52:27,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:27,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585301884] [2022-01-19 04:52:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:27,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:28,220 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 04:52:28,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:28,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585301884] [2022-01-19 04:52:28,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585301884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:28,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:28,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:52:28,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763999675] [2022-01-19 04:52:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:28,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:52:28,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:52:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:52:28,260 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 139 [2022-01-19 04:52:28,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 04:52:28,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:28,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 139 [2022-01-19 04:52:28,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:28,565 INFO L129 PetriNetUnfolder]: 161/1035 cut-off events. [2022-01-19 04:52:28,565 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 04:52:28,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1035 events. 161/1035 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7023 event pairs, 103 based on Foata normal form. 34/1008 useless extension candidates. Maximal degree in co-relation 1279. Up to 187 conditions per place. [2022-01-19 04:52:28,580 INFO L132 encePairwiseOnDemand]: 134/139 looper letters, 17 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2022-01-19 04:52:28,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 332 flow [2022-01-19 04:52:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:52:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:52:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2022-01-19 04:52:28,598 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9424460431654677 [2022-01-19 04:52:28,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2022-01-19 04:52:28,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2022-01-19 04:52:28,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:28,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2022-01-19 04:52:28,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 04:52:28,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 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 04:52:28,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 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 04:52:28,617 INFO L186 Difference]: Start difference. First operand has 146 places, 135 transitions, 282 flow. Second operand 3 states and 393 transitions. [2022-01-19 04:52:28,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 332 flow [2022-01-19 04:52:28,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 138 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 04:52:28,626 INFO L242 Difference]: Finished difference. Result has 142 places, 131 transitions, 274 flow [2022-01-19 04:52:28,628 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2022-01-19 04:52:28,632 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, -4 predicate places. [2022-01-19 04:52:28,633 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 274 flow [2022-01-19 04:52:28,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 04:52:28,637 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:28,637 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 04:52:28,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:52:28,638 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1687705602, now seen corresponding path program 1 times [2022-01-19 04:52:28,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:28,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681781309] [2022-01-19 04:52:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:28,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:28,990 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 04:52:28,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681781309] [2022-01-19 04:52:28,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681781309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:28,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:28,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:52:28,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41691464] [2022-01-19 04:52:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:28,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:52:28,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:28,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:52:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:52:28,997 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 139 [2022-01-19 04:52:28,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:52:28,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:28,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 139 [2022-01-19 04:52:28,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:29,698 INFO L129 PetriNetUnfolder]: 869/2441 cut-off events. [2022-01-19 04:52:29,699 INFO L130 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-01-19 04:52:29,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2441 events. 869/2441 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18950 event pairs, 141 based on Foata normal form. 0/2388 useless extension candidates. Maximal degree in co-relation 3855. Up to 609 conditions per place. [2022-01-19 04:52:29,714 INFO L132 encePairwiseOnDemand]: 133/139 looper letters, 21 selfloop transitions, 2 changer transitions 53/175 dead transitions. [2022-01-19 04:52:29,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 175 transitions, 502 flow [2022-01-19 04:52:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:52:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:52:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1109 transitions. [2022-01-19 04:52:29,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8864908073541167 [2022-01-19 04:52:29,717 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1109 transitions. [2022-01-19 04:52:29,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1109 transitions. [2022-01-19 04:52:29,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:29,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1109 transitions. [2022-01-19 04:52:29,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.22222222222223) internal successors, (1109), 9 states have internal predecessors, (1109), 0 states have call successors, (0), 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 04:52:29,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 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 04:52:29,723 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 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 04:52:29,723 INFO L186 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 9 states and 1109 transitions. [2022-01-19 04:52:29,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 175 transitions, 502 flow [2022-01-19 04:52:29,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 175 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:52:29,727 INFO L242 Difference]: Finished difference. Result has 155 places, 117 transitions, 262 flow [2022-01-19 04:52:29,727 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=155, PETRI_TRANSITIONS=117} [2022-01-19 04:52:29,728 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 9 predicate places. [2022-01-19 04:52:29,728 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 117 transitions, 262 flow [2022-01-19 04:52:29,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:52:29,729 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:29,729 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] [2022-01-19 04:52:29,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:52:29,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1897318208, now seen corresponding path program 1 times [2022-01-19 04:52:29,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:29,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604107242] [2022-01-19 04:52:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:29,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:30,095 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 04:52:30,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:30,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604107242] [2022-01-19 04:52:30,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604107242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:30,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:30,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:52:30,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430191760] [2022-01-19 04:52:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:30,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:52:30,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:30,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:52:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:52:30,098 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:30,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 117 transitions, 262 flow. Second operand has 11 states, 11 states have (on average 113.45454545454545) internal successors, (1248), 11 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:52:30,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:30,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:30,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:30,744 INFO L129 PetriNetUnfolder]: 872/1830 cut-off events. [2022-01-19 04:52:30,744 INFO L130 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-01-19 04:52:30,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3592 conditions, 1830 events. 872/1830 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11614 event pairs, 413 based on Foata normal form. 39/1813 useless extension candidates. Maximal degree in co-relation 3524. Up to 765 conditions per place. [2022-01-19 04:52:30,756 INFO L132 encePairwiseOnDemand]: 125/139 looper letters, 26 selfloop transitions, 11 changer transitions 53/185 dead transitions. [2022-01-19 04:52:30,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 185 transitions, 616 flow [2022-01-19 04:52:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:52:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:52:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1885 transitions. [2022-01-19 04:52:30,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8475719424460432 [2022-01-19 04:52:30,760 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1885 transitions. [2022-01-19 04:52:30,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1885 transitions. [2022-01-19 04:52:30,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:30,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1885 transitions. [2022-01-19 04:52:30,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.8125) internal successors, (1885), 16 states have internal predecessors, (1885), 0 states have call successors, (0), 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 04:52:30,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 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 04:52:30,770 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 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 04:52:30,770 INFO L186 Difference]: Start difference. First operand has 155 places, 117 transitions, 262 flow. Second operand 16 states and 1885 transitions. [2022-01-19 04:52:30,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 185 transitions, 616 flow [2022-01-19 04:52:30,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 185 transitions, 576 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-01-19 04:52:30,781 INFO L242 Difference]: Finished difference. Result has 153 places, 123 transitions, 346 flow [2022-01-19 04:52:30,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=346, PETRI_PLACES=153, PETRI_TRANSITIONS=123} [2022-01-19 04:52:30,782 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 7 predicate places. [2022-01-19 04:52:30,782 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 123 transitions, 346 flow [2022-01-19 04:52:30,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.45454545454545) internal successors, (1248), 11 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:52:30,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:30,783 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 04:52:30,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:52:30,783 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:30,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1534605524, now seen corresponding path program 1 times [2022-01-19 04:52:30,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:30,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819852293] [2022-01-19 04:52:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:30,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:31,026 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 04:52:31,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819852293] [2022-01-19 04:52:31,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819852293] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:31,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:31,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:52:31,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562108801] [2022-01-19 04:52:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:31,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:52:31,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:31,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:52:31,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:52:31,034 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:31,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 123 transitions, 346 flow. Second operand has 11 states, 11 states have (on average 113.54545454545455) internal successors, (1249), 11 states have internal predecessors, (1249), 0 states have call successors, (0), 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 04:52:31,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:31,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:31,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:31,665 INFO L129 PetriNetUnfolder]: 747/1619 cut-off events. [2022-01-19 04:52:31,666 INFO L130 PetriNetUnfolder]: For 4643/4687 co-relation queries the response was YES. [2022-01-19 04:52:31,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 1619 events. 747/1619 cut-off events. For 4643/4687 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10264 event pairs, 74 based on Foata normal form. 32/1616 useless extension candidates. Maximal degree in co-relation 5643. Up to 626 conditions per place. [2022-01-19 04:52:31,685 INFO L132 encePairwiseOnDemand]: 126/139 looper letters, 36 selfloop transitions, 11 changer transitions 46/188 dead transitions. [2022-01-19 04:52:31,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 188 transitions, 994 flow [2022-01-19 04:52:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:52:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:52:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1883 transitions. [2022-01-19 04:52:31,690 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8466726618705036 [2022-01-19 04:52:31,690 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1883 transitions. [2022-01-19 04:52:31,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1883 transitions. [2022-01-19 04:52:31,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:31,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1883 transitions. [2022-01-19 04:52:31,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.6875) internal successors, (1883), 16 states have internal predecessors, (1883), 0 states have call successors, (0), 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 04:52:31,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 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 04:52:31,699 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 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 04:52:31,699 INFO L186 Difference]: Start difference. First operand has 153 places, 123 transitions, 346 flow. Second operand 16 states and 1883 transitions. [2022-01-19 04:52:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 188 transitions, 994 flow [2022-01-19 04:52:31,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 188 transitions, 964 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-01-19 04:52:31,709 INFO L242 Difference]: Finished difference. Result has 163 places, 127 transitions, 437 flow [2022-01-19 04:52:31,710 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=437, PETRI_PLACES=163, PETRI_TRANSITIONS=127} [2022-01-19 04:52:31,710 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 17 predicate places. [2022-01-19 04:52:31,710 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 127 transitions, 437 flow [2022-01-19 04:52:31,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.54545454545455) internal successors, (1249), 11 states have internal predecessors, (1249), 0 states have call successors, (0), 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 04:52:31,711 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:31,711 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] [2022-01-19 04:52:31,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:52:31,712 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2137062790, now seen corresponding path program 1 times [2022-01-19 04:52:31,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441052644] [2022-01-19 04:52:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:31,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:31,896 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 04:52:31,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:31,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441052644] [2022-01-19 04:52:31,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441052644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:31,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:31,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:52:31,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476910099] [2022-01-19 04:52:31,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:31,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:52:31,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:31,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:52:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:52:31,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-01-19 04:52:31,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 127 transitions, 437 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 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 04:52:31,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:31,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-01-19 04:52:31,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:32,495 INFO L129 PetriNetUnfolder]: 637/1501 cut-off events. [2022-01-19 04:52:32,495 INFO L130 PetriNetUnfolder]: For 10580/10722 co-relation queries the response was YES. [2022-01-19 04:52:32,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 1501 events. 637/1501 cut-off events. For 10580/10722 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9313 event pairs, 245 based on Foata normal form. 18/1466 useless extension candidates. Maximal degree in co-relation 6983. Up to 640 conditions per place. [2022-01-19 04:52:32,519 INFO L132 encePairwiseOnDemand]: 128/139 looper letters, 39 selfloop transitions, 13 changer transitions 37/186 dead transitions. [2022-01-19 04:52:32,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 186 transitions, 1339 flow [2022-01-19 04:52:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:52:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:52:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1676 transitions. [2022-01-19 04:52:32,523 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8612538540596094 [2022-01-19 04:52:32,523 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1676 transitions. [2022-01-19 04:52:32,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1676 transitions. [2022-01-19 04:52:32,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:32,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1676 transitions. [2022-01-19 04:52:32,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 119.71428571428571) internal successors, (1676), 14 states have internal predecessors, (1676), 0 states have call successors, (0), 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 04:52:32,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 139.0) internal successors, (2085), 15 states have internal predecessors, (2085), 0 states have call successors, (0), 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 04:52:32,532 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 139.0) internal successors, (2085), 15 states have internal predecessors, (2085), 0 states have call successors, (0), 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 04:52:32,532 INFO L186 Difference]: Start difference. First operand has 163 places, 127 transitions, 437 flow. Second operand 14 states and 1676 transitions. [2022-01-19 04:52:32,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 186 transitions, 1339 flow [2022-01-19 04:52:32,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 186 transitions, 1225 flow, removed 48 selfloop flow, removed 10 redundant places. [2022-01-19 04:52:32,546 INFO L242 Difference]: Finished difference. Result has 167 places, 134 transitions, 530 flow [2022-01-19 04:52:32,547 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=530, PETRI_PLACES=167, PETRI_TRANSITIONS=134} [2022-01-19 04:52:32,547 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 21 predicate places. [2022-01-19 04:52:32,548 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 134 transitions, 530 flow [2022-01-19 04:52:32,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 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 04:52:32,548 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:32,548 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] [2022-01-19 04:52:32,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:52:32,549 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash 294517498, now seen corresponding path program 2 times [2022-01-19 04:52:32,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:32,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843103792] [2022-01-19 04:52:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:32,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:32,846 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 04:52:32,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843103792] [2022-01-19 04:52:32,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843103792] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:32,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:32,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:52:32,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645096938] [2022-01-19 04:52:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:32,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:52:32,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:52:32,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:52:32,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 139 [2022-01-19 04:52:32,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 134 transitions, 530 flow. Second operand has 13 states, 13 states have (on average 112.46153846153847) internal successors, (1462), 13 states have internal predecessors, (1462), 0 states have call successors, (0), 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 04:52:32,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:32,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 139 [2022-01-19 04:52:32,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:33,550 INFO L129 PetriNetUnfolder]: 624/1514 cut-off events. [2022-01-19 04:52:33,550 INFO L130 PetriNetUnfolder]: For 18791/19056 co-relation queries the response was YES. [2022-01-19 04:52:33,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8169 conditions, 1514 events. 624/1514 cut-off events. For 18791/19056 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9570 event pairs, 191 based on Foata normal form. 23/1484 useless extension candidates. Maximal degree in co-relation 8078. Up to 636 conditions per place. [2022-01-19 04:52:33,574 INFO L132 encePairwiseOnDemand]: 126/139 looper letters, 37 selfloop transitions, 20 changer transitions 37/188 dead transitions. [2022-01-19 04:52:33,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 188 transitions, 1603 flow [2022-01-19 04:52:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:52:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:52:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1970 transitions. [2022-01-19 04:52:33,580 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8336859923825646 [2022-01-19 04:52:33,580 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1970 transitions. [2022-01-19 04:52:33,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1970 transitions. [2022-01-19 04:52:33,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:33,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1970 transitions. [2022-01-19 04:52:33,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 115.88235294117646) internal successors, (1970), 17 states have internal predecessors, (1970), 0 states have call successors, (0), 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 04:52:33,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 139.0) internal successors, (2502), 18 states have internal predecessors, (2502), 0 states have call successors, (0), 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 04:52:33,590 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 139.0) internal successors, (2502), 18 states have internal predecessors, (2502), 0 states have call successors, (0), 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 04:52:33,590 INFO L186 Difference]: Start difference. First operand has 167 places, 134 transitions, 530 flow. Second operand 17 states and 1970 transitions. [2022-01-19 04:52:33,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 188 transitions, 1603 flow [2022-01-19 04:52:33,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 188 transitions, 1336 flow, removed 126 selfloop flow, removed 11 redundant places. [2022-01-19 04:52:33,606 INFO L242 Difference]: Finished difference. Result has 173 places, 137 transitions, 597 flow [2022-01-19 04:52:33,607 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=597, PETRI_PLACES=173, PETRI_TRANSITIONS=137} [2022-01-19 04:52:33,607 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 27 predicate places. [2022-01-19 04:52:33,607 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 137 transitions, 597 flow [2022-01-19 04:52:33,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 112.46153846153847) internal successors, (1462), 13 states have internal predecessors, (1462), 0 states have call successors, (0), 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 04:52:33,608 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:33,608 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] [2022-01-19 04:52:33,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:52:33,609 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1526528571, now seen corresponding path program 1 times [2022-01-19 04:52:33,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:33,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017326864] [2022-01-19 04:52:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:33,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:33,708 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 04:52:33,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:33,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017326864] [2022-01-19 04:52:33,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017326864] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:33,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:33,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:52:33,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525582229] [2022-01-19 04:52:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:33,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:52:33,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:52:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:52:33,711 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:33,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 137 transitions, 597 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 04:52:33,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:33,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:33,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:35,136 INFO L129 PetriNetUnfolder]: 5253/9099 cut-off events. [2022-01-19 04:52:35,137 INFO L130 PetriNetUnfolder]: For 127097/127821 co-relation queries the response was YES. [2022-01-19 04:52:35,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43045 conditions, 9099 events. 5253/9099 cut-off events. For 127097/127821 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 69866 event pairs, 160 based on Foata normal form. 411/9343 useless extension candidates. Maximal degree in co-relation 42954. Up to 3253 conditions per place. [2022-01-19 04:52:35,242 INFO L132 encePairwiseOnDemand]: 128/139 looper letters, 125 selfloop transitions, 18 changer transitions 50/289 dead transitions. [2022-01-19 04:52:35,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 289 transitions, 2322 flow [2022-01-19 04:52:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:52:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:52:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1220 transitions. [2022-01-19 04:52:35,246 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8776978417266187 [2022-01-19 04:52:35,246 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1220 transitions. [2022-01-19 04:52:35,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1220 transitions. [2022-01-19 04:52:35,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:35,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1220 transitions. [2022-01-19 04:52:35,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 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 04:52:35,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 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 04:52:35,252 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 0 states have call successors, (0), 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 04:52:35,252 INFO L186 Difference]: Start difference. First operand has 173 places, 137 transitions, 597 flow. Second operand 10 states and 1220 transitions. [2022-01-19 04:52:35,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 289 transitions, 2322 flow [2022-01-19 04:52:35,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 289 transitions, 2129 flow, removed 75 selfloop flow, removed 14 redundant places. [2022-01-19 04:52:35,318 INFO L242 Difference]: Finished difference. Result has 165 places, 153 transitions, 648 flow [2022-01-19 04:52:35,318 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=648, PETRI_PLACES=165, PETRI_TRANSITIONS=153} [2022-01-19 04:52:35,318 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 19 predicate places. [2022-01-19 04:52:35,319 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 153 transitions, 648 flow [2022-01-19 04:52:35,319 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 04:52:35,319 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:35,319 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] [2022-01-19 04:52:35,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:52:35,320 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:35,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1995604840, now seen corresponding path program 1 times [2022-01-19 04:52:35,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:35,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260388707] [2022-01-19 04:52:35,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:35,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:35,422 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 04:52:35,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:35,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260388707] [2022-01-19 04:52:35,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260388707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:35,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:35,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:52:35,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593667608] [2022-01-19 04:52:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:35,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:52:35,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:35,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:52:35,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:52:35,425 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:35,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 153 transitions, 648 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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 04:52:35,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:35,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:35,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:36,781 INFO L129 PetriNetUnfolder]: 4762/8767 cut-off events. [2022-01-19 04:52:36,781 INFO L130 PetriNetUnfolder]: For 86929/87728 co-relation queries the response was YES. [2022-01-19 04:52:36,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41587 conditions, 8767 events. 4762/8767 cut-off events. For 86929/87728 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 72021 event pairs, 122 based on Foata normal form. 653/9384 useless extension candidates. Maximal degree in co-relation 41501. Up to 1885 conditions per place. [2022-01-19 04:52:36,851 INFO L132 encePairwiseOnDemand]: 128/139 looper letters, 146 selfloop transitions, 34 changer transitions 62/338 dead transitions. [2022-01-19 04:52:36,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 338 transitions, 2882 flow [2022-01-19 04:52:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:52:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:52:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1588 transitions. [2022-01-19 04:52:36,859 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8788046485888212 [2022-01-19 04:52:36,859 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1588 transitions. [2022-01-19 04:52:36,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1588 transitions. [2022-01-19 04:52:36,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:36,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1588 transitions. [2022-01-19 04:52:36,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.15384615384616) internal successors, (1588), 13 states have internal predecessors, (1588), 0 states have call successors, (0), 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 04:52:36,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 0 states have call successors, (0), 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 04:52:36,870 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 0 states have call successors, (0), 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 04:52:36,870 INFO L186 Difference]: Start difference. First operand has 165 places, 153 transitions, 648 flow. Second operand 13 states and 1588 transitions. [2022-01-19 04:52:36,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 338 transitions, 2882 flow [2022-01-19 04:52:36,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 338 transitions, 2880 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 04:52:36,938 INFO L242 Difference]: Finished difference. Result has 182 places, 169 transitions, 890 flow [2022-01-19 04:52:36,938 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=890, PETRI_PLACES=182, PETRI_TRANSITIONS=169} [2022-01-19 04:52:36,941 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 36 predicate places. [2022-01-19 04:52:36,941 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 169 transitions, 890 flow [2022-01-19 04:52:36,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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 04:52:36,942 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:36,942 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] [2022-01-19 04:52:36,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:52:36,942 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash -738737275, now seen corresponding path program 1 times [2022-01-19 04:52:36,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:36,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925320341] [2022-01-19 04:52:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:36,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:37,418 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 04:52:37,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:37,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925320341] [2022-01-19 04:52:37,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925320341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:37,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:37,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 04:52:37,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642915338] [2022-01-19 04:52:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:37,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 04:52:37,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 04:52:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-01-19 04:52:37,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 139 [2022-01-19 04:52:37,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 169 transitions, 890 flow. Second operand has 17 states, 17 states have (on average 109.3529411764706) internal successors, (1859), 17 states have internal predecessors, (1859), 0 states have call successors, (0), 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 04:52:37,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:37,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 139 [2022-01-19 04:52:37,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:38,318 INFO L129 PetriNetUnfolder]: 905/3045 cut-off events. [2022-01-19 04:52:38,319 INFO L130 PetriNetUnfolder]: For 16406/18919 co-relation queries the response was YES. [2022-01-19 04:52:38,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12371 conditions, 3045 events. 905/3045 cut-off events. For 16406/18919 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29670 event pairs, 59 based on Foata normal form. 90/2954 useless extension candidates. Maximal degree in co-relation 12269. Up to 667 conditions per place. [2022-01-19 04:52:38,355 INFO L132 encePairwiseOnDemand]: 124/139 looper letters, 58 selfloop transitions, 37 changer transitions 6/226 dead transitions. [2022-01-19 04:52:38,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 226 transitions, 1793 flow [2022-01-19 04:52:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 04:52:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 04:52:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2357 transitions. [2022-01-19 04:52:38,360 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8074683110654334 [2022-01-19 04:52:38,360 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2357 transitions. [2022-01-19 04:52:38,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2357 transitions. [2022-01-19 04:52:38,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:38,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2357 transitions. [2022-01-19 04:52:38,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 112.23809523809524) internal successors, (2357), 21 states have internal predecessors, (2357), 0 states have call successors, (0), 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 04:52:38,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 139.0) internal successors, (3058), 22 states have internal predecessors, (3058), 0 states have call successors, (0), 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 04:52:38,371 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 139.0) internal successors, (3058), 22 states have internal predecessors, (3058), 0 states have call successors, (0), 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 04:52:38,371 INFO L186 Difference]: Start difference. First operand has 182 places, 169 transitions, 890 flow. Second operand 21 states and 2357 transitions. [2022-01-19 04:52:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 226 transitions, 1793 flow [2022-01-19 04:52:38,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 226 transitions, 1696 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-01-19 04:52:38,451 INFO L242 Difference]: Finished difference. Result has 204 places, 188 transitions, 1170 flow [2022-01-19 04:52:38,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1170, PETRI_PLACES=204, PETRI_TRANSITIONS=188} [2022-01-19 04:52:38,452 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 58 predicate places. [2022-01-19 04:52:38,452 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 188 transitions, 1170 flow [2022-01-19 04:52:38,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 109.3529411764706) internal successors, (1859), 17 states have internal predecessors, (1859), 0 states have call successors, (0), 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 04:52:38,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:38,453 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] [2022-01-19 04:52:38,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:52:38,454 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1633843666, now seen corresponding path program 1 times [2022-01-19 04:52:38,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:38,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820751241] [2022-01-19 04:52:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:38,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:38,562 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 04:52:38,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:38,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820751241] [2022-01-19 04:52:38,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820751241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:38,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:38,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:52:38,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963928061] [2022-01-19 04:52:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:38,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:52:38,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:52:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:52:38,565 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:38,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 188 transitions, 1170 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:52:38,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:38,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:38,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:40,058 INFO L129 PetriNetUnfolder]: 4622/8866 cut-off events. [2022-01-19 04:52:40,058 INFO L130 PetriNetUnfolder]: For 115720/116458 co-relation queries the response was YES. [2022-01-19 04:52:40,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46411 conditions, 8866 events. 4622/8866 cut-off events. For 115720/116458 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 76640 event pairs, 139 based on Foata normal form. 511/9335 useless extension candidates. Maximal degree in co-relation 46304. Up to 1742 conditions per place. [2022-01-19 04:52:40,136 INFO L132 encePairwiseOnDemand]: 128/139 looper letters, 144 selfloop transitions, 52 changer transitions 111/403 dead transitions. [2022-01-19 04:52:40,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 403 transitions, 4419 flow [2022-01-19 04:52:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:52:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:52:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1955 transitions. [2022-01-19 04:52:40,140 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8790467625899281 [2022-01-19 04:52:40,140 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1955 transitions. [2022-01-19 04:52:40,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1955 transitions. [2022-01-19 04:52:40,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:40,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1955 transitions. [2022-01-19 04:52:40,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 122.1875) internal successors, (1955), 16 states have internal predecessors, (1955), 0 states have call successors, (0), 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 04:52:40,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 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 04:52:40,146 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 0 states have call successors, (0), 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 04:52:40,146 INFO L186 Difference]: Start difference. First operand has 204 places, 188 transitions, 1170 flow. Second operand 16 states and 1955 transitions. [2022-01-19 04:52:40,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 403 transitions, 4419 flow [2022-01-19 04:52:40,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 403 transitions, 4000 flow, removed 189 selfloop flow, removed 14 redundant places. [2022-01-19 04:52:40,442 INFO L242 Difference]: Finished difference. Result has 211 places, 191 transitions, 1257 flow [2022-01-19 04:52:40,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1257, PETRI_PLACES=211, PETRI_TRANSITIONS=191} [2022-01-19 04:52:40,443 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 65 predicate places. [2022-01-19 04:52:40,443 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 191 transitions, 1257 flow [2022-01-19 04:52:40,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:52:40,444 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:40,444 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] [2022-01-19 04:52:40,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:52:40,444 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1970036951, now seen corresponding path program 1 times [2022-01-19 04:52:40,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:40,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296020834] [2022-01-19 04:52:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:40,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:40,581 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 04:52:40,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:40,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296020834] [2022-01-19 04:52:40,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296020834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:40,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:40,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:52:40,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846447054] [2022-01-19 04:52:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:40,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:52:40,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:40,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:52:40,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:52:40,584 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:40,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 191 transitions, 1257 flow. Second operand has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 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 04:52:40,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:40,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:40,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:41,953 INFO L129 PetriNetUnfolder]: 4426/8563 cut-off events. [2022-01-19 04:52:41,953 INFO L130 PetriNetUnfolder]: For 99984/100632 co-relation queries the response was YES. [2022-01-19 04:52:42,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45494 conditions, 8563 events. 4426/8563 cut-off events. For 99984/100632 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 75086 event pairs, 138 based on Foata normal form. 372/8893 useless extension candidates. Maximal degree in co-relation 45451. Up to 1713 conditions per place. [2022-01-19 04:52:42,037 INFO L132 encePairwiseOnDemand]: 128/139 looper letters, 129 selfloop transitions, 57 changer transitions 101/383 dead transitions. [2022-01-19 04:52:42,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 383 transitions, 3918 flow [2022-01-19 04:52:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 04:52:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 04:52:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2276 transitions. [2022-01-19 04:52:42,041 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8617947747065505 [2022-01-19 04:52:42,041 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2276 transitions. [2022-01-19 04:52:42,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2276 transitions. [2022-01-19 04:52:42,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:42,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2276 transitions. [2022-01-19 04:52:42,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.78947368421052) internal successors, (2276), 19 states have internal predecessors, (2276), 0 states have call successors, (0), 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 04:52:42,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 139.0) internal successors, (2780), 20 states have internal predecessors, (2780), 0 states have call successors, (0), 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 04:52:42,050 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 139.0) internal successors, (2780), 20 states have internal predecessors, (2780), 0 states have call successors, (0), 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 04:52:42,050 INFO L186 Difference]: Start difference. First operand has 211 places, 191 transitions, 1257 flow. Second operand 19 states and 2276 transitions. [2022-01-19 04:52:42,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 383 transitions, 3918 flow [2022-01-19 04:52:42,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 383 transitions, 3388 flow, removed 129 selfloop flow, removed 15 redundant places. [2022-01-19 04:52:42,795 INFO L242 Difference]: Finished difference. Result has 212 places, 189 transitions, 1139 flow [2022-01-19 04:52:42,796 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1139, PETRI_PLACES=212, PETRI_TRANSITIONS=189} [2022-01-19 04:52:42,796 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 66 predicate places. [2022-01-19 04:52:42,796 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 189 transitions, 1139 flow [2022-01-19 04:52:42,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 0 states have call successors, (0), 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 04:52:42,797 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:42,797 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, 1, 1, 1, 1] [2022-01-19 04:52:42,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:52:42,799 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:42,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1697019, now seen corresponding path program 1 times [2022-01-19 04:52:42,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:42,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474574468] [2022-01-19 04:52:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:42,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:42,931 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 04:52:42,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:42,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474574468] [2022-01-19 04:52:42,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474574468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:42,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:42,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:52:42,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587359168] [2022-01-19 04:52:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:42,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:52:42,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:52:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:52:42,934 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 139 [2022-01-19 04:52:42,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 189 transitions, 1139 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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 04:52:42,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:42,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 139 [2022-01-19 04:52:42,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:43,758 INFO L129 PetriNetUnfolder]: 1659/6219 cut-off events. [2022-01-19 04:52:43,758 INFO L130 PetriNetUnfolder]: For 20117/21288 co-relation queries the response was YES. [2022-01-19 04:52:43,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22608 conditions, 6219 events. 1659/6219 cut-off events. For 20117/21288 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 77032 event pairs, 67 based on Foata normal form. 38/5895 useless extension candidates. Maximal degree in co-relation 22525. Up to 687 conditions per place. [2022-01-19 04:52:43,823 INFO L132 encePairwiseOnDemand]: 133/139 looper letters, 50 selfloop transitions, 2 changer transitions 5/214 dead transitions. [2022-01-19 04:52:43,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 214 transitions, 1435 flow [2022-01-19 04:52:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 04:52:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 04:52:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 722 transitions. [2022-01-19 04:52:43,824 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8657074340527577 [2022-01-19 04:52:43,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 722 transitions. [2022-01-19 04:52:43,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 722 transitions. [2022-01-19 04:52:43,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:43,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 722 transitions. [2022-01-19 04:52:43,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 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 04:52:43,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 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 04:52:43,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 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 04:52:43,827 INFO L186 Difference]: Start difference. First operand has 212 places, 189 transitions, 1139 flow. Second operand 6 states and 722 transitions. [2022-01-19 04:52:43,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 214 transitions, 1435 flow [2022-01-19 04:52:44,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 214 transitions, 1152 flow, removed 72 selfloop flow, removed 26 redundant places. [2022-01-19 04:52:44,178 INFO L242 Difference]: Finished difference. Result has 192 places, 190 transitions, 916 flow [2022-01-19 04:52:44,178 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=192, PETRI_TRANSITIONS=190} [2022-01-19 04:52:44,179 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 46 predicate places. [2022-01-19 04:52:44,179 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 190 transitions, 916 flow [2022-01-19 04:52:44,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 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 04:52:44,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:44,180 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, 1, 1, 1, 1] [2022-01-19 04:52:44,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:52:44,180 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -390377597, now seen corresponding path program 2 times [2022-01-19 04:52:44,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:44,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180013528] [2022-01-19 04:52:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:44,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:44,313 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 04:52:44,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180013528] [2022-01-19 04:52:44,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180013528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:44,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:44,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:52:44,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473272610] [2022-01-19 04:52:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:44,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:52:44,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:44,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:52:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:52:44,315 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-01-19 04:52:44,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 190 transitions, 916 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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 04:52:44,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:44,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-01-19 04:52:44,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:45,436 INFO L129 PetriNetUnfolder]: 2604/9531 cut-off events. [2022-01-19 04:52:45,436 INFO L130 PetriNetUnfolder]: For 15026/15754 co-relation queries the response was YES. [2022-01-19 04:52:45,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26720 conditions, 9531 events. 2604/9531 cut-off events. For 15026/15754 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 125788 event pairs, 61 based on Foata normal form. 27/8981 useless extension candidates. Maximal degree in co-relation 26689. Up to 1003 conditions per place. [2022-01-19 04:52:45,515 INFO L132 encePairwiseOnDemand]: 133/139 looper letters, 52 selfloop transitions, 2 changer transitions 6/217 dead transitions. [2022-01-19 04:52:45,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 217 transitions, 1177 flow [2022-01-19 04:52:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:52:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:52:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2022-01-19 04:52:45,517 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8581706063720452 [2022-01-19 04:52:45,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2022-01-19 04:52:45,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2022-01-19 04:52:45,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:45,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2022-01-19 04:52:45,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 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 04:52:45,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 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 04:52:45,521 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 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 04:52:45,521 INFO L186 Difference]: Start difference. First operand has 192 places, 190 transitions, 916 flow. Second operand 7 states and 835 transitions. [2022-01-19 04:52:45,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 217 transitions, 1177 flow [2022-01-19 04:52:46,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 217 transitions, 1165 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 04:52:46,026 INFO L242 Difference]: Finished difference. Result has 196 places, 191 transitions, 927 flow [2022-01-19 04:52:46,026 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=927, PETRI_PLACES=196, PETRI_TRANSITIONS=191} [2022-01-19 04:52:46,027 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 50 predicate places. [2022-01-19 04:52:46,027 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 191 transitions, 927 flow [2022-01-19 04:52:46,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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 04:52:46,027 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:46,027 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, 1, 1, 1, 1] [2022-01-19 04:52:46,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:52:46,027 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash -503237739, now seen corresponding path program 3 times [2022-01-19 04:52:46,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:46,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40254721] [2022-01-19 04:52:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:46,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:46,159 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 04:52:46,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:46,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40254721] [2022-01-19 04:52:46,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40254721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:46,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:46,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:52:46,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883569660] [2022-01-19 04:52:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:46,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:52:46,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:52:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:52:46,161 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2022-01-19 04:52:46,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 191 transitions, 927 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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 04:52:46,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:46,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2022-01-19 04:52:46,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:48,043 INFO L129 PetriNetUnfolder]: 4669/16357 cut-off events. [2022-01-19 04:52:48,044 INFO L130 PetriNetUnfolder]: For 26326/27506 co-relation queries the response was YES. [2022-01-19 04:52:48,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46550 conditions, 16357 events. 4669/16357 cut-off events. For 26326/27506 co-relation queries the response was YES. Maximal size of possible extension queue 2309. Compared 236187 event pairs, 63 based on Foata normal form. 31/15266 useless extension candidates. Maximal degree in co-relation 46517. Up to 1969 conditions per place. [2022-01-19 04:52:48,304 INFO L132 encePairwiseOnDemand]: 133/139 looper letters, 48 selfloop transitions, 2 changer transitions 17/225 dead transitions. [2022-01-19 04:52:48,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 225 transitions, 1261 flow [2022-01-19 04:52:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:52:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:52:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2022-01-19 04:52:48,306 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8602261048304214 [2022-01-19 04:52:48,306 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2022-01-19 04:52:48,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2022-01-19 04:52:48,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:48,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2022-01-19 04:52:48,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 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 04:52:48,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 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 04:52:48,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 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 04:52:48,309 INFO L186 Difference]: Start difference. First operand has 196 places, 191 transitions, 927 flow. Second operand 7 states and 837 transitions. [2022-01-19 04:52:48,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 225 transitions, 1261 flow [2022-01-19 04:52:49,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 225 transitions, 1250 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 04:52:49,415 INFO L242 Difference]: Finished difference. Result has 200 places, 190 transitions, 927 flow [2022-01-19 04:52:49,416 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=927, PETRI_PLACES=200, PETRI_TRANSITIONS=190} [2022-01-19 04:52:49,416 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 54 predicate places. [2022-01-19 04:52:49,416 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 190 transitions, 927 flow [2022-01-19 04:52:49,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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 04:52:49,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:49,417 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, 1, 1, 1, 1] [2022-01-19 04:52:49,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:52:49,417 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash -327152871, now seen corresponding path program 4 times [2022-01-19 04:52:49,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:49,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494033360] [2022-01-19 04:52:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:49,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:52:49,699 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 04:52:49,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:52:49,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494033360] [2022-01-19 04:52:49,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494033360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:52:49,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:52:49,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:52:49,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54008330] [2022-01-19 04:52:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:52:49,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:52:49,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:52:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:52:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:52:49,702 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-01-19 04:52:49,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 190 transitions, 927 flow. Second operand has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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 04:52:49,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:52:49,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-01-19 04:52:49,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:52:52,191 INFO L129 PetriNetUnfolder]: 6155/22509 cut-off events. [2022-01-19 04:52:52,192 INFO L130 PetriNetUnfolder]: For 38090/40313 co-relation queries the response was YES. [2022-01-19 04:52:52,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62830 conditions, 22509 events. 6155/22509 cut-off events. For 38090/40313 co-relation queries the response was YES. Maximal size of possible extension queue 2661. Compared 344221 event pairs, 51 based on Foata normal form. 53/21193 useless extension candidates. Maximal degree in co-relation 62795. Up to 2198 conditions per place. [2022-01-19 04:52:52,373 INFO L132 encePairwiseOnDemand]: 128/139 looper letters, 26 selfloop transitions, 8 changer transitions 17/206 dead transitions. [2022-01-19 04:52:52,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 206 transitions, 1113 flow [2022-01-19 04:52:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:52:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:52:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1048 transitions. [2022-01-19 04:52:52,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8377298161470823 [2022-01-19 04:52:52,375 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1048 transitions. [2022-01-19 04:52:52,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1048 transitions. [2022-01-19 04:52:52,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:52:52,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1048 transitions. [2022-01-19 04:52:52,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.44444444444444) internal successors, (1048), 9 states have internal predecessors, (1048), 0 states have call successors, (0), 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 04:52:52,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 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 04:52:52,378 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 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 04:52:52,378 INFO L186 Difference]: Start difference. First operand has 200 places, 190 transitions, 927 flow. Second operand 9 states and 1048 transitions. [2022-01-19 04:52:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 206 transitions, 1113 flow [2022-01-19 04:52:54,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 206 transitions, 1102 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 04:52:54,926 INFO L242 Difference]: Finished difference. Result has 205 places, 184 transitions, 901 flow [2022-01-19 04:52:54,927 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=901, PETRI_PLACES=205, PETRI_TRANSITIONS=184} [2022-01-19 04:52:54,927 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 59 predicate places. [2022-01-19 04:52:54,927 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 184 transitions, 901 flow [2022-01-19 04:52:54,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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 04:52:54,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:52:54,928 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, 1, 1, 1, 1] [2022-01-19 04:52:54,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 04:52:54,928 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:52:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:52:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1952248589, now seen corresponding path program 5 times [2022-01-19 04:52:54,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:52:54,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128548648] [2022-01-19 04:52:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:52:54,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:52:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:52:54,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:52:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:52:55,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:52:55,069 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:52:55,070 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 04:52:55,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 04:52:55,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 04:52:55,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 04:52:55,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 04:52:55,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 04:52:55,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 04:52:55,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 04:52:55,080 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:52:55,085 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:52:55,085 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:52:55,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:52:55 BasicIcfg [2022-01-19 04:52:55,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:52:55,245 INFO L158 Benchmark]: Toolchain (without parser) took 29217.38ms. Allocated memory was 369.1MB in the beginning and 9.4GB in the end (delta: 9.1GB). Free memory was 314.0MB in the beginning and 8.3GB in the end (delta: -7.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2022-01-19 04:52:55,245 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory is still 332.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:52:55,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.61ms. Allocated memory was 369.1MB in the beginning and 536.9MB in the end (delta: 167.8MB). Free memory was 313.8MB in the beginning and 497.6MB in the end (delta: -183.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.0GB. [2022-01-19 04:52:55,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.83ms. Allocated memory is still 536.9MB. Free memory was 497.6MB in the beginning and 493.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:52:55,246 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 536.9MB. Free memory was 493.8MB in the beginning and 491.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:52:55,246 INFO L158 Benchmark]: RCFGBuilder took 1074.75ms. Allocated memory is still 536.9MB. Free memory was 491.3MB in the beginning and 401.1MB in the end (delta: 90.2MB). Peak memory consumption was 90.2MB. Max. memory is 16.0GB. [2022-01-19 04:52:55,246 INFO L158 Benchmark]: TraceAbstraction took 27542.58ms. Allocated memory was 536.9MB in the beginning and 9.4GB in the end (delta: 8.9GB). Free memory was 401.1MB in the beginning and 8.3GB in the end (delta: -7.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2022-01-19 04:52:55,248 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.13ms. Allocated memory is still 369.1MB. Free memory is still 332.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 513.61ms. Allocated memory was 369.1MB in the beginning and 536.9MB in the end (delta: 167.8MB). Free memory was 313.8MB in the beginning and 497.6MB in the end (delta: -183.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.83ms. Allocated memory is still 536.9MB. Free memory was 497.6MB in the beginning and 493.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 536.9MB. Free memory was 493.8MB in the beginning and 491.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1074.75ms. Allocated memory is still 536.9MB. Free memory was 491.3MB in the beginning and 401.1MB in the end (delta: 90.2MB). Peak memory consumption was 90.2MB. Max. memory is 16.0GB. * TraceAbstraction took 27542.58ms. Allocated memory was 536.9MB in the beginning and 9.4GB in the end (delta: 8.9GB). Free memory was 401.1MB in the beginning and 8.3GB in the end (delta: -7.9GB). Peak memory consumption was 1.0GB. 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_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L726] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L727] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L729] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L730] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L731] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L737] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L738] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L739] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L740] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L741] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L742] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] 0 pthread_t t1185; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-3, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-2, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=-1, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t1188; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L867] 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_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}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L891] 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_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}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_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}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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: 857]: 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, 177 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: 27.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1088 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1088 mSDsluCounter, 646 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1424 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2432 IncrementalHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 117 mSDtfsCounter, 2432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1257occurred in iteration=10, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1542 NumberOfCodeBlocks, 1542 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1419 ConstructedInterpolants, 0 QuantifiedInterpolants, 8003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 04:52:55,294 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...