/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:46:40,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:46:40,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:46:41,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:46:41,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:46:41,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:46:41,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:46:41,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:46:41,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:46:41,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:46:41,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:46:41,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:46:41,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:46:41,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:46:41,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:46:41,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:46:41,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:46:41,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:46:41,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:46:41,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:46:41,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:46:41,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:46:41,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:46:41,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:46:41,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:46:41,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:46:41,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:46:41,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:46:41,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:46:41,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:46:41,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:46:41,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:46:41,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:46:41,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:46:41,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:46:41,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:46:41,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:46:41,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:46:41,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:46:41,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:46:41,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:46:41,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:46:41,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:46:41,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:46:41,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:46:41,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:46:41,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:46:41,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:46:41,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:46:41,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:46:41,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:46:41,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:46:41,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 22:46:41,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:46:41,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:46:41,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:46:41,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:46:41,293 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:46:41,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-01-18 22:46:41,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6e8599b/99767b257d764783b9c46d828fedb81f/FLAGa4fa6d076 [2022-01-18 22:46:41,721 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:46:41,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-01-18 22:46:41,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6e8599b/99767b257d764783b9c46d828fedb81f/FLAGa4fa6d076 [2022-01-18 22:46:42,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6e8599b/99767b257d764783b9c46d828fedb81f [2022-01-18 22:46:42,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:46:42,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:46:42,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:46:42,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:46:42,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:46:42,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65aaaa9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42, skipping insertion in model container [2022-01-18 22:46:42,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:46:42,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:46:42,266 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/mix051_tso.oepc.i[949,962] [2022-01-18 22:46:42,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:46:42,452 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:46:42,459 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/mix051_tso.oepc.i[949,962] [2022-01-18 22:46:42,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:46:42,542 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:46:42,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42 WrapperNode [2022-01-18 22:46:42,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:46:42,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:46:42,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:46:42,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:46:42,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,610 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-01-18 22:46:42,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:46:42,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:46:42,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:46:42,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:46:42,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:46:42,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:46:42,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:46:42,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:46:42,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (1/1) ... [2022-01-18 22:46:42,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:46:42,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:46:42,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 22:46:42,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-18 22:46:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:46:42,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:46:42,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:46:42,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:46:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-18 22:46:42,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-18 22:46:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:46:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:46:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:46:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:46:42,714 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:46:42,837 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:46:42,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:46:43,178 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:46:43,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:46:43,435 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:46:43,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:46:43 BoogieIcfgContainer [2022-01-18 22:46:43,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:46:43,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:46:43,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:46:43,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:46:43,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:46:42" (1/3) ... [2022-01-18 22:46:43,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46824241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:46:43, skipping insertion in model container [2022-01-18 22:46:43,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:42" (2/3) ... [2022-01-18 22:46:43,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46824241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:46:43, skipping insertion in model container [2022-01-18 22:46:43,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:46:43" (3/3) ... [2022-01-18 22:46:43,444 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-01-18 22:46:43,447 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:46:43,447 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:46:43,447 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:46:43,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,488 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,488 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,492 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,492 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,492 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,492 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,498 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,499 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,500 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,501 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,501 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,501 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,502 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,502 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,503 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,503 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,505 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,509 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,509 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,510 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,511 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,512 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,513 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,513 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,516 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,517 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,517 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,518 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,520 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,521 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:43,522 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:46:43,563 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:46:43,573 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:46:43,573 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-18 22:46:43,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-01-18 22:46:43,633 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2022-01-18 22:46:43,633 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:46:43,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-01-18 22:46:43,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-01-18 22:46:43,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-01-18 22:46:43,656 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2022-01-18 22:46:43,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:46:43,656 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:43,657 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:43,657 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash 622711834, now seen corresponding path program 1 times [2022-01-18 22:46:43,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:43,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325083243] [2022-01-18 22:46:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:43,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:43,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325083243] [2022-01-18 22:46:43,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325083243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:43,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:43,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:46:43,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388130938] [2022-01-18 22:46:43,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:43,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:46:43,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:46:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:46:43,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2022-01-18 22:46:43,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:43,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:43,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2022-01-18 22:46:43,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:44,089 INFO L129 PetriNetUnfolder]: 161/674 cut-off events. [2022-01-18 22:46:44,090 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-18 22:46:44,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 674 events. 161/674 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3711 event pairs, 35 based on Foata normal form. 27/670 useless extension candidates. Maximal degree in co-relation 919. Up to 187 conditions per place. [2022-01-18 22:46:44,098 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 17 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-01-18 22:46:44,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 326 flow [2022-01-18 22:46:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:46:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:46:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-01-18 22:46:44,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-01-18 22:46:44,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-01-18 22:46:44,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-01-18 22:46:44,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:44,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-01-18 22:46:44,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:44,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:44,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:44,130 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-01-18 22:46:44,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 326 flow [2022-01-18 22:46:44,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:44,136 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-01-18 22:46:44,137 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-01-18 22:46:44,142 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-01-18 22:46:44,142 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-01-18 22:46:44,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:44,145 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:44,146 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] [2022-01-18 22:46:44,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:46:44,147 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-18 22:46:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1216340586, now seen corresponding path program 1 times [2022-01-18 22:46:44,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:44,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774103453] [2022-01-18 22:46:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:44,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:44,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-18 22:46:44,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774103453] [2022-01-18 22:46:44,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774103453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:44,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:44,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:46:44,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924661383] [2022-01-18 22:46:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:44,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:46:44,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:46:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:46:44,424 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:44,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:44,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:44,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:44,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:45,041 INFO L129 PetriNetUnfolder]: 1059/3132 cut-off events. [2022-01-18 22:46:45,041 INFO L130 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-01-18 22:46:45,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4901 conditions, 3132 events. 1059/3132 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 25993 event pairs, 476 based on Foata normal form. 0/3044 useless extension candidates. Maximal degree in co-relation 4843. Up to 906 conditions per place. [2022-01-18 22:46:45,058 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 25 selfloop transitions, 11 changer transitions 69/199 dead transitions. [2022-01-18 22:46:45,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 199 transitions, 618 flow [2022-01-18 22:46:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 22:46:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 22:46:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1649 transitions. [2022-01-18 22:46:45,061 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2022-01-18 22:46:45,061 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1649 transitions. [2022-01-18 22:46:45,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1649 transitions. [2022-01-18 22:46:45,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:45,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1649 transitions. [2022-01-18 22:46:45,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.78571428571429) internal successors, (1649), 14 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,069 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,069 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 14 states and 1649 transitions. [2022-01-18 22:46:45,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 199 transitions, 618 flow [2022-01-18 22:46:45,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 199 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:46:45,074 INFO L242 Difference]: Finished difference. Result has 161 places, 122 transitions, 344 flow [2022-01-18 22:46:45,074 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=344, PETRI_PLACES=161, PETRI_TRANSITIONS=122} [2022-01-18 22:46:45,074 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 18 predicate places. [2022-01-18 22:46:45,074 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 122 transitions, 344 flow [2022-01-18 22:46:45,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,075 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:45,075 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] [2022-01-18 22:46:45,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:46:45,075 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-18 22:46:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1246524072, now seen corresponding path program 1 times [2022-01-18 22:46:45,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:45,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126214878] [2022-01-18 22:46:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:45,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:45,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126214878] [2022-01-18 22:46:45,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126214878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:45,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:45,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:46:45,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547245059] [2022-01-18 22:46:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:45,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:46:45,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:46:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:46:45,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:45,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 122 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:45,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:45,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:45,725 INFO L129 PetriNetUnfolder]: 764/1556 cut-off events. [2022-01-18 22:46:45,725 INFO L130 PetriNetUnfolder]: For 4593/4911 co-relation queries the response was YES. [2022-01-18 22:46:45,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 1556 events. 764/1556 cut-off events. For 4593/4911 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9742 event pairs, 172 based on Foata normal form. 36/1558 useless extension candidates. Maximal degree in co-relation 5657. Up to 777 conditions per place. [2022-01-18 22:46:45,736 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 27 selfloop transitions, 14 changer transitions 35/168 dead transitions. [2022-01-18 22:46:45,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 168 transitions, 826 flow [2022-01-18 22:46:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:46:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:46:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1490 transitions. [2022-01-18 22:46:45,739 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8427601809954751 [2022-01-18 22:46:45,739 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1490 transitions. [2022-01-18 22:46:45,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1490 transitions. [2022-01-18 22:46:45,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:45,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1490 transitions. [2022-01-18 22:46:45,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.61538461538461) internal successors, (1490), 13 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,744 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,744 INFO L186 Difference]: Start difference. First operand has 161 places, 122 transitions, 344 flow. Second operand 13 states and 1490 transitions. [2022-01-18 22:46:45,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 168 transitions, 826 flow [2022-01-18 22:46:45,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 168 transitions, 810 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:45,752 INFO L242 Difference]: Finished difference. Result has 153 places, 125 transitions, 448 flow [2022-01-18 22:46:45,752 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=448, PETRI_PLACES=153, PETRI_TRANSITIONS=125} [2022-01-18 22:46:45,752 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 10 predicate places. [2022-01-18 22:46:45,752 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 125 transitions, 448 flow [2022-01-18 22:46:45,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,753 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:45,753 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:45,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:46:45,753 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-18 22:46:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1106792230, now seen corresponding path program 1 times [2022-01-18 22:46:45,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:45,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974427043] [2022-01-18 22:46:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:45,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:45,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:45,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974427043] [2022-01-18 22:46:45,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974427043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:45,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:45,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:46:45,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803007098] [2022-01-18 22:46:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:45,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:46:45,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:46:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:46:45,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:45,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 125 transitions, 448 flow. Second operand has 9 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:45,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:45,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:45,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:46,463 INFO L129 PetriNetUnfolder]: 755/1704 cut-off events. [2022-01-18 22:46:46,463 INFO L130 PetriNetUnfolder]: For 12923/13107 co-relation queries the response was YES. [2022-01-18 22:46:46,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8127 conditions, 1704 events. 755/1704 cut-off events. For 12923/13107 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10842 event pairs, 188 based on Foata normal form. 35/1687 useless extension candidates. Maximal degree in co-relation 8047. Up to 638 conditions per place. [2022-01-18 22:46:46,479 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 41 selfloop transitions, 9 changer transitions 46/190 dead transitions. [2022-01-18 22:46:46,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 190 transitions, 1324 flow [2022-01-18 22:46:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 22:46:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 22:46:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1643 transitions. [2022-01-18 22:46:46,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629201680672269 [2022-01-18 22:46:46,482 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1643 transitions. [2022-01-18 22:46:46,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1643 transitions. [2022-01-18 22:46:46,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:46,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1643 transitions. [2022-01-18 22:46:46,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.35714285714286) internal successors, (1643), 14 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:46,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:46,487 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:46,488 INFO L186 Difference]: Start difference. First operand has 153 places, 125 transitions, 448 flow. Second operand 14 states and 1643 transitions. [2022-01-18 22:46:46,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 190 transitions, 1324 flow [2022-01-18 22:46:46,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 190 transitions, 1263 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-01-18 22:46:46,496 INFO L242 Difference]: Finished difference. Result has 162 places, 129 transitions, 520 flow [2022-01-18 22:46:46,496 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=520, PETRI_PLACES=162, PETRI_TRANSITIONS=129} [2022-01-18 22:46:46,497 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 19 predicate places. [2022-01-18 22:46:46,497 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 129 transitions, 520 flow [2022-01-18 22:46:46,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:46,498 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:46,498 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:46,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:46:46,498 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-18 22:46:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash 577898102, now seen corresponding path program 1 times [2022-01-18 22:46:46,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:46,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880622417] [2022-01-18 22:46:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:46,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:46,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880622417] [2022-01-18 22:46:46,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880622417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:46,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:46,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 22:46:46,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259267462] [2022-01-18 22:46:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:46,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 22:46:46,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 22:46:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-18 22:46:46,721 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:46,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 129 transitions, 520 flow. Second operand has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:46,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:46,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:46,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:47,129 INFO L129 PetriNetUnfolder]: 608/1322 cut-off events. [2022-01-18 22:46:47,130 INFO L130 PetriNetUnfolder]: For 20485/20893 co-relation queries the response was YES. [2022-01-18 22:46:47,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8408 conditions, 1322 events. 608/1322 cut-off events. For 20485/20893 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8124 event pairs, 46 based on Foata normal form. 41/1328 useless extension candidates. Maximal degree in co-relation 8321. Up to 603 conditions per place. [2022-01-18 22:46:47,145 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 41 selfloop transitions, 8 changer transitions 31/172 dead transitions. [2022-01-18 22:46:47,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 172 transitions, 1354 flow [2022-01-18 22:46:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:46:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:46:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1486 transitions. [2022-01-18 22:46:47,149 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8404977375565611 [2022-01-18 22:46:47,149 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1486 transitions. [2022-01-18 22:46:47,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1486 transitions. [2022-01-18 22:46:47,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:47,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1486 transitions. [2022-01-18 22:46:47,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.3076923076923) internal successors, (1486), 13 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:47,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:47,154 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:47,154 INFO L186 Difference]: Start difference. First operand has 162 places, 129 transitions, 520 flow. Second operand 13 states and 1486 transitions. [2022-01-18 22:46:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 172 transitions, 1354 flow [2022-01-18 22:46:47,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 172 transitions, 1127 flow, removed 109 selfloop flow, removed 11 redundant places. [2022-01-18 22:46:47,168 INFO L242 Difference]: Finished difference. Result has 161 places, 129 transitions, 473 flow [2022-01-18 22:46:47,169 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=473, PETRI_PLACES=161, PETRI_TRANSITIONS=129} [2022-01-18 22:46:47,169 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 18 predicate places. [2022-01-18 22:46:47,169 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 473 flow [2022-01-18 22:46:47,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:47,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:47,170 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:47,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:46:47,170 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-18 22:46:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash -184029273, now seen corresponding path program 1 times [2022-01-18 22:46:47,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:47,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827709744] [2022-01-18 22:46:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:47,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:47,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:47,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827709744] [2022-01-18 22:46:47,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827709744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:47,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:47,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:46:47,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043372335] [2022-01-18 22:46:47,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:47,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:46:47,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:46:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:46:47,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:47,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 129 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:47,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:47,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:47,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:48,305 INFO L129 PetriNetUnfolder]: 4715/8118 cut-off events. [2022-01-18 22:46:48,306 INFO L130 PetriNetUnfolder]: For 71709/71886 co-relation queries the response was YES. [2022-01-18 22:46:48,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34926 conditions, 8118 events. 4715/8118 cut-off events. For 71709/71886 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 61062 event pairs, 147 based on Foata normal form. 167/8141 useless extension candidates. Maximal degree in co-relation 34842. Up to 2793 conditions per place. [2022-01-18 22:46:48,370 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 113 selfloop transitions, 18 changer transitions 35/260 dead transitions. [2022-01-18 22:46:48,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 260 transitions, 1815 flow [2022-01-18 22:46:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:46:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:46:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1190 transitions. [2022-01-18 22:46:48,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-01-18 22:46:48,372 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1190 transitions. [2022-01-18 22:46:48,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1190 transitions. [2022-01-18 22:46:48,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:48,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1190 transitions. [2022-01-18 22:46:48,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:48,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:48,376 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:48,376 INFO L186 Difference]: Start difference. First operand has 161 places, 129 transitions, 473 flow. Second operand 10 states and 1190 transitions. [2022-01-18 22:46:48,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 260 transitions, 1815 flow [2022-01-18 22:46:48,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 260 transitions, 1708 flow, removed 33 selfloop flow, removed 14 redundant places. [2022-01-18 22:46:48,396 INFO L242 Difference]: Finished difference. Result has 156 places, 145 transitions, 568 flow [2022-01-18 22:46:48,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=568, PETRI_PLACES=156, PETRI_TRANSITIONS=145} [2022-01-18 22:46:48,397 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2022-01-18 22:46:48,397 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 568 flow [2022-01-18 22:46:48,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:48,397 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:48,397 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-18 22:46:48,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:46:48,398 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-18 22:46:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1305713050, now seen corresponding path program 1 times [2022-01-18 22:46:48,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:48,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807265054] [2022-01-18 22:46:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:48,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:48,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:48,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807265054] [2022-01-18 22:46:48,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807265054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:48,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:48,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:48,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547314693] [2022-01-18 22:46:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:48,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:48,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:48,469 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:48,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 145 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:48,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:48,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:48,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:49,557 INFO L129 PetriNetUnfolder]: 4289/7879 cut-off events. [2022-01-18 22:46:49,557 INFO L130 PetriNetUnfolder]: For 68379/68604 co-relation queries the response was YES. [2022-01-18 22:46:49,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36720 conditions, 7879 events. 4289/7879 cut-off events. For 68379/68604 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 63680 event pairs, 125 based on Foata normal form. 298/8146 useless extension candidates. Maximal degree in co-relation 36641. Up to 1774 conditions per place. [2022-01-18 22:46:49,602 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 131 selfloop transitions, 34 changer transitions 41/300 dead transitions. [2022-01-18 22:46:49,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 300 transitions, 2348 flow [2022-01-18 22:46:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:46:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:46:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1549 transitions. [2022-01-18 22:46:49,605 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.876131221719457 [2022-01-18 22:46:49,605 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1549 transitions. [2022-01-18 22:46:49,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1549 transitions. [2022-01-18 22:46:49,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:49,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1549 transitions. [2022-01-18 22:46:49,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.15384615384616) internal successors, (1549), 13 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:49,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:49,610 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:49,610 INFO L186 Difference]: Start difference. First operand has 156 places, 145 transitions, 568 flow. Second operand 13 states and 1549 transitions. [2022-01-18 22:46:49,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 300 transitions, 2348 flow [2022-01-18 22:46:49,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 300 transitions, 2346 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 22:46:49,697 INFO L242 Difference]: Finished difference. Result has 173 places, 161 transitions, 818 flow [2022-01-18 22:46:49,698 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=818, PETRI_PLACES=173, PETRI_TRANSITIONS=161} [2022-01-18 22:46:49,698 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 30 predicate places. [2022-01-18 22:46:49,698 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 161 transitions, 818 flow [2022-01-18 22:46:49,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:49,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:49,699 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-18 22:46:49,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:46:49,699 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-18 22:46:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash -632054995, now seen corresponding path program 1 times [2022-01-18 22:46:49,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:49,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132837509] [2022-01-18 22:46:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:49,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:49,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:49,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132837509] [2022-01-18 22:46:49,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132837509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:49,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:49,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:46:49,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174712209] [2022-01-18 22:46:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:49,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:46:49,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:46:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:46:49,789 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:49,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 161 transitions, 818 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:49,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:49,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:49,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:51,022 INFO L129 PetriNetUnfolder]: 3894/7427 cut-off events. [2022-01-18 22:46:51,023 INFO L130 PetriNetUnfolder]: For 75063/75330 co-relation queries the response was YES. [2022-01-18 22:46:51,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38669 conditions, 7427 events. 3894/7427 cut-off events. For 75063/75330 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 62103 event pairs, 122 based on Foata normal form. 255/7651 useless extension candidates. Maximal degree in co-relation 38582. Up to 1608 conditions per place. [2022-01-18 22:46:51,070 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 123 selfloop transitions, 52 changer transitions 61/329 dead transitions. [2022-01-18 22:46:51,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 329 transitions, 3030 flow [2022-01-18 22:46:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 22:46:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 22:46:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1907 transitions. [2022-01-18 22:46:51,074 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8763786764705882 [2022-01-18 22:46:51,074 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1907 transitions. [2022-01-18 22:46:51,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1907 transitions. [2022-01-18 22:46:51,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:51,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1907 transitions. [2022-01-18 22:46:51,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.1875) internal successors, (1907), 16 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:51,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:51,081 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:51,081 INFO L186 Difference]: Start difference. First operand has 173 places, 161 transitions, 818 flow. Second operand 16 states and 1907 transitions. [2022-01-18 22:46:51,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 329 transitions, 3030 flow [2022-01-18 22:46:51,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 329 transitions, 2871 flow, removed 49 selfloop flow, removed 6 redundant places. [2022-01-18 22:46:51,284 INFO L242 Difference]: Finished difference. Result has 188 places, 181 transitions, 1133 flow [2022-01-18 22:46:51,285 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1133, PETRI_PLACES=188, PETRI_TRANSITIONS=181} [2022-01-18 22:46:51,285 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 45 predicate places. [2022-01-18 22:46:51,285 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 1133 flow [2022-01-18 22:46:51,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:51,286 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:51,286 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:51,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:46:51,286 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-18 22:46:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1456126625, now seen corresponding path program 1 times [2022-01-18 22:46:51,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:51,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438286314] [2022-01-18 22:46:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:51,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:51,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438286314] [2022-01-18 22:46:51,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438286314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:51,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:51,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:51,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131532242] [2022-01-18 22:46:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:51,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:51,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:51,369 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:51,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 1133 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:51,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:51,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:51,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:51,973 INFO L129 PetriNetUnfolder]: 1335/4563 cut-off events. [2022-01-18 22:46:51,973 INFO L130 PetriNetUnfolder]: For 25490/27168 co-relation queries the response was YES. [2022-01-18 22:46:52,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18140 conditions, 4563 events. 1335/4563 cut-off events. For 25490/27168 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 50384 event pairs, 36 based on Foata normal form. 22/4296 useless extension candidates. Maximal degree in co-relation 18047. Up to 938 conditions per place. [2022-01-18 22:46:52,021 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 57 selfloop transitions, 2 changer transitions 16/228 dead transitions. [2022-01-18 22:46:52,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 228 transitions, 1723 flow [2022-01-18 22:46:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:46:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:46:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2022-01-18 22:46:52,023 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8781512605042017 [2022-01-18 22:46:52,023 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2022-01-18 22:46:52,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2022-01-18 22:46:52,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:52,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2022-01-18 22:46:52,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:52,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:52,026 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:52,026 INFO L186 Difference]: Start difference. First operand has 188 places, 181 transitions, 1133 flow. Second operand 7 states and 836 transitions. [2022-01-18 22:46:52,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 228 transitions, 1723 flow [2022-01-18 22:46:52,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 228 transitions, 1554 flow, removed 62 selfloop flow, removed 7 redundant places. [2022-01-18 22:46:52,317 INFO L242 Difference]: Finished difference. Result has 192 places, 182 transitions, 983 flow [2022-01-18 22:46:52,317 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=983, PETRI_PLACES=192, PETRI_TRANSITIONS=182} [2022-01-18 22:46:52,318 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 49 predicate places. [2022-01-18 22:46:52,318 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 182 transitions, 983 flow [2022-01-18 22:46:52,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:52,318 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:52,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, 1, 1, 1, 1, 1] [2022-01-18 22:46:52,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:46:52,319 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-18 22:46:52,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1129684613, now seen corresponding path program 2 times [2022-01-18 22:46:52,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:52,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542177735] [2022-01-18 22:46:52,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:52,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:52,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:52,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542177735] [2022-01-18 22:46:52,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542177735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:52,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:52,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:46:52,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495873828] [2022-01-18 22:46:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:52,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:46:52,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:46:52,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:46:52,408 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:52,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 182 transitions, 983 flow. Second operand has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:52,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:52,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:52,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:54,223 INFO L129 PetriNetUnfolder]: 6168/11937 cut-off events. [2022-01-18 22:46:54,223 INFO L130 PetriNetUnfolder]: For 110170/110835 co-relation queries the response was YES. [2022-01-18 22:46:54,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58828 conditions, 11937 events. 6168/11937 cut-off events. For 110170/110835 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 110600 event pairs, 175 based on Foata normal form. 269/11931 useless extension candidates. Maximal degree in co-relation 58786. Up to 2702 conditions per place. [2022-01-18 22:46:54,295 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 97 selfloop transitions, 57 changer transitions 82/330 dead transitions. [2022-01-18 22:46:54,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 330 transitions, 2829 flow [2022-01-18 22:46:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 22:46:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-18 22:46:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2219 transitions. [2022-01-18 22:46:54,300 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8587461300309598 [2022-01-18 22:46:54,300 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2219 transitions. [2022-01-18 22:46:54,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2219 transitions. [2022-01-18 22:46:54,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:54,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2219 transitions. [2022-01-18 22:46:54,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 116.78947368421052) internal successors, (2219), 19 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:54,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:54,307 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:54,307 INFO L186 Difference]: Start difference. First operand has 192 places, 182 transitions, 983 flow. Second operand 19 states and 2219 transitions. [2022-01-18 22:46:54,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 330 transitions, 2829 flow [2022-01-18 22:46:54,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 330 transitions, 2778 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-01-18 22:46:54,715 INFO L242 Difference]: Finished difference. Result has 209 places, 181 transitions, 1087 flow [2022-01-18 22:46:54,715 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1087, PETRI_PLACES=209, PETRI_TRANSITIONS=181} [2022-01-18 22:46:54,716 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 66 predicate places. [2022-01-18 22:46:54,716 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 181 transitions, 1087 flow [2022-01-18 22:46:54,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:54,717 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:54,717 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] [2022-01-18 22:46:54,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:46:54,717 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-18 22:46:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash 402067060, now seen corresponding path program 1 times [2022-01-18 22:46:54,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:54,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355129166] [2022-01-18 22:46:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:54,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:54,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:54,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355129166] [2022-01-18 22:46:54,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355129166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:54,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:54,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:54,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109918449] [2022-01-18 22:46:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:54,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:54,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:54,807 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:54,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 181 transitions, 1087 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:54,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:54,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:54,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:55,659 INFO L129 PetriNetUnfolder]: 2317/7808 cut-off events. [2022-01-18 22:46:55,660 INFO L130 PetriNetUnfolder]: For 30294/31993 co-relation queries the response was YES. [2022-01-18 22:46:55,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29812 conditions, 7808 events. 2317/7808 cut-off events. For 30294/31993 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 98617 event pairs, 83 based on Foata normal form. 19/7280 useless extension candidates. Maximal degree in co-relation 29710. Up to 898 conditions per place. [2022-01-18 22:46:55,751 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 47 selfloop transitions, 2 changer transitions 5/208 dead transitions. [2022-01-18 22:46:55,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 208 transitions, 1390 flow [2022-01-18 22:46:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:46:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:46:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2022-01-18 22:46:55,753 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8539915966386554 [2022-01-18 22:46:55,753 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2022-01-18 22:46:55,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2022-01-18 22:46:55,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:55,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2022-01-18 22:46:55,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:55,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:55,756 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:55,756 INFO L186 Difference]: Start difference. First operand has 209 places, 181 transitions, 1087 flow. Second operand 7 states and 813 transitions. [2022-01-18 22:46:55,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 208 transitions, 1390 flow [2022-01-18 22:46:56,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 208 transitions, 1089 flow, removed 81 selfloop flow, removed 26 redundant places. [2022-01-18 22:46:56,513 INFO L242 Difference]: Finished difference. Result has 191 places, 182 transitions, 865 flow [2022-01-18 22:46:56,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=865, PETRI_PLACES=191, PETRI_TRANSITIONS=182} [2022-01-18 22:46:56,514 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 48 predicate places. [2022-01-18 22:46:56,514 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 182 transitions, 865 flow [2022-01-18 22:46:56,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:56,514 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:56,514 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:56,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 22:46:56,514 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-18 22:46:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1217025216, now seen corresponding path program 2 times [2022-01-18 22:46:56,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:56,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347158589] [2022-01-18 22:46:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:56,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:56,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:56,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347158589] [2022-01-18 22:46:56,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347158589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:56,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:56,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:56,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695117363] [2022-01-18 22:46:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:56,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:56,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:56,607 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-18 22:46:56,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 182 transitions, 865 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:56,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:56,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-18 22:46:56,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:58,070 INFO L129 PetriNetUnfolder]: 4193/14064 cut-off events. [2022-01-18 22:46:58,070 INFO L130 PetriNetUnfolder]: For 24000/24904 co-relation queries the response was YES. [2022-01-18 22:46:58,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40906 conditions, 14064 events. 4193/14064 cut-off events. For 24000/24904 co-relation queries the response was YES. Maximal size of possible extension queue 1974. Compared 196216 event pairs, 62 based on Foata normal form. 11/13096 useless extension candidates. Maximal degree in co-relation 40873. Up to 1705 conditions per place. [2022-01-18 22:46:58,144 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 41 selfloop transitions, 2 changer transitions 12/210 dead transitions. [2022-01-18 22:46:58,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 210 transitions, 1124 flow [2022-01-18 22:46:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:46:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:46:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 816 transitions. [2022-01-18 22:46:58,148 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-01-18 22:46:58,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 816 transitions. [2022-01-18 22:46:58,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 816 transitions. [2022-01-18 22:46:58,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:58,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 816 transitions. [2022-01-18 22:46:58,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:58,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:58,150 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:58,150 INFO L186 Difference]: Start difference. First operand has 191 places, 182 transitions, 865 flow. Second operand 7 states and 816 transitions. [2022-01-18 22:46:58,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 210 transitions, 1124 flow [2022-01-18 22:46:59,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 210 transitions, 1113 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:59,359 INFO L242 Difference]: Finished difference. Result has 195 places, 181 transitions, 868 flow [2022-01-18 22:46:59,359 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=868, PETRI_PLACES=195, PETRI_TRANSITIONS=181} [2022-01-18 22:46:59,359 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 52 predicate places. [2022-01-18 22:46:59,359 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 181 transitions, 868 flow [2022-01-18 22:46:59,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:59,360 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:59,360 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] [2022-01-18 22:46:59,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 22:46:59,360 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-18 22:46:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 115412118, now seen corresponding path program 3 times [2022-01-18 22:46:59,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579579519] [2022-01-18 22:46:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:59,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:59,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:59,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579579519] [2022-01-18 22:46:59,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579579519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:59,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:59,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:46:59,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235634719] [2022-01-18 22:46:59,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:59,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:46:59,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:59,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:46:59,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:46:59,524 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-01-18 22:46:59,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 181 transitions, 868 flow. Second operand has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:59,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:59,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-01-18 22:46:59,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:47:01,600 INFO L129 PetriNetUnfolder]: 5827/20600 cut-off events. [2022-01-18 22:47:01,600 INFO L130 PetriNetUnfolder]: For 37409/39134 co-relation queries the response was YES. [2022-01-18 22:47:01,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60316 conditions, 20600 events. 5827/20600 cut-off events. For 37409/39134 co-relation queries the response was YES. Maximal size of possible extension queue 2371. Compared 304782 event pairs, 161 based on Foata normal form. 29/19350 useless extension candidates. Maximal degree in co-relation 60281. Up to 2120 conditions per place. [2022-01-18 22:47:01,779 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 30 selfloop transitions, 9 changer transitions 5/196 dead transitions. [2022-01-18 22:47:01,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 196 transitions, 1034 flow [2022-01-18 22:47:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:47:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:47:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1021 transitions. [2022-01-18 22:47:01,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8341503267973857 [2022-01-18 22:47:01,780 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1021 transitions. [2022-01-18 22:47:01,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1021 transitions. [2022-01-18 22:47:01,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:47:01,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1021 transitions. [2022-01-18 22:47:01,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.44444444444444) internal successors, (1021), 9 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:47:01,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:47:01,783 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:47:01,783 INFO L186 Difference]: Start difference. First operand has 195 places, 181 transitions, 868 flow. Second operand 9 states and 1021 transitions. [2022-01-18 22:47:01,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 196 transitions, 1034 flow [2022-01-18 22:47:04,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 196 transitions, 1017 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-01-18 22:47:04,544 INFO L242 Difference]: Finished difference. Result has 198 places, 184 transitions, 914 flow [2022-01-18 22:47:04,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=198, PETRI_TRANSITIONS=184} [2022-01-18 22:47:04,545 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 55 predicate places. [2022-01-18 22:47:04,545 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 184 transitions, 914 flow [2022-01-18 22:47:04,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:47:04,545 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:47:04,545 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] [2022-01-18 22:47:04,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 22:47:04,546 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-18 22:47:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:47:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -967758314, now seen corresponding path program 4 times [2022-01-18 22:47:04,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:47:04,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449601394] [2022-01-18 22:47:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:47:04,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:47:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:47:04,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:47:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:47:04,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:47:04,656 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:47:04,657 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-18 22:47:04,658 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-18 22:47:04,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-18 22:47:04,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-18 22:47:04,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-18 22:47:04,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-18 22:47:04,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-18 22:47:04,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 22:47:04,662 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:47:04,666 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:47:04,666 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:47:04,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:47:04 BasicIcfg [2022-01-18 22:47:04,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:47:04,818 INFO L158 Benchmark]: Toolchain (without parser) took 22732.61ms. Allocated memory was 390.1MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 334.3MB in the beginning and 6.6GB in the end (delta: -6.2GB). Peak memory consumption was 969.2MB. Max. memory is 16.0GB. [2022-01-18 22:47:04,818 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 390.1MB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:47:04,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.74ms. Allocated memory was 390.1MB in the beginning and 539.0MB in the end (delta: 148.9MB). Free memory was 334.1MB in the beginning and 498.0MB in the end (delta: -163.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.0GB. [2022-01-18 22:47:04,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.58ms. Allocated memory is still 539.0MB. Free memory was 498.0MB in the beginning and 494.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:47:04,819 INFO L158 Benchmark]: Boogie Preprocessor took 34.74ms. Allocated memory is still 539.0MB. Free memory was 494.9MB in the beginning and 492.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:47:04,820 INFO L158 Benchmark]: RCFGBuilder took 789.66ms. Allocated memory is still 539.0MB. Free memory was 491.8MB in the beginning and 404.7MB in the end (delta: 87.0MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. [2022-01-18 22:47:04,820 INFO L158 Benchmark]: TraceAbstraction took 21378.91ms. Allocated memory was 539.0MB in the beginning and 7.6GB in the end (delta: 7.0GB). Free memory was 403.7MB in the beginning and 6.6GB in the end (delta: -6.1GB). Peak memory consumption was 889.9MB. Max. memory is 16.0GB. [2022-01-18 22:47:04,821 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.11ms. Allocated memory is still 390.1MB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 455.74ms. Allocated memory was 390.1MB in the beginning and 539.0MB in the end (delta: 148.9MB). Free memory was 334.1MB in the beginning and 498.0MB in the end (delta: -163.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.58ms. Allocated memory is still 539.0MB. Free memory was 498.0MB in the beginning and 494.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.74ms. Allocated memory is still 539.0MB. Free memory was 494.9MB in the beginning and 492.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 789.66ms. Allocated memory is still 539.0MB. Free memory was 491.8MB in the beginning and 404.7MB in the end (delta: 87.0MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. * TraceAbstraction took 21378.91ms. Allocated memory was 539.0MB in the beginning and 7.6GB in the end (delta: 7.0GB). Free memory was 403.7MB in the beginning and 6.6GB in the end (delta: -6.1GB). Peak memory consumption was 889.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L848] 0 pthread_t t1377; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377={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] [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-3, t1377={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] [L850] 0 pthread_t t1378; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={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] [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-2, t1377={5:0}, t1378={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] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L852] 0 pthread_t t1379; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={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=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] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, t1379={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=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] [L854] 0 pthread_t t1380; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={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=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] [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={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=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] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1] [L786] 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) [L786] 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) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 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 [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 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 [L756] 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) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] 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) [L756] 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) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 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 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1] [L806] 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) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] 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) [L806] 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) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 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 [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 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 [L826] 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) [L826] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L826] 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) [L826] 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) [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] 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 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L830] 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 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={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=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] 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) [L861] 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) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 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 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 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 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 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) [L872] 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) [L873] 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)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L874] 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)) [L874] 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)) [L875] 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)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] 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)) [L876] 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)) [L877] 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)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L877] 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)) [L877] 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)) [L878] 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)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 855]: 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: 853]: 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, 172 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: 21.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 503 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1202 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2036 IncrementalHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 97 mSDtfsCounter, 2036 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1133occurred in iteration=8, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1299 NumberOfCodeBlocks, 1299 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1181 ConstructedInterpolants, 0 QuantifiedInterpolants, 5229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-18 22:47:04,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...