/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:07:17,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:07:17,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:07:17,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:07:17,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:07:17,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:07:17,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:07:17,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:07:17,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:07:17,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:07:17,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:07:17,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:07:17,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:07:17,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:07:17,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:07:17,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:07:17,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:07:17,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:07:17,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:07:17,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:07:17,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:07:17,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:07:17,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:07:17,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:07:17,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:07:17,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:07:17,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:07:17,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:07:17,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:07:17,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:07:17,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:07:17,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:07:17,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:07:17,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:07:17,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:07:17,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:07:17,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:07:17,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:07:17,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:07:17,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:07:17,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:07:17,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 11:07:18,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:07:18,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:07:18,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:07:18,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:07:18,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:07:18,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:07:18,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:07:18,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:07:18,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:07:18,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:07:18,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 11:07:18,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:07:18,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:07:18,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:07:18,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:07:18,259 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:07:18,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-01-19 11:07:18,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89011ec98/e5c8001c7bc24baeb50077f5284c8fa1/FLAGe37cf9846 [2022-01-19 11:07:18,760 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:07:18,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-01-19 11:07:18,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89011ec98/e5c8001c7bc24baeb50077f5284c8fa1/FLAGe37cf9846 [2022-01-19 11:07:19,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89011ec98/e5c8001c7bc24baeb50077f5284c8fa1 [2022-01-19 11:07:19,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:07:19,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:07:19,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:07:19,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:07:19,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:07:19,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8f9616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19, skipping insertion in model container [2022-01-19 11:07:19,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:07:19,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:07:19,290 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/mix017_pso.opt_tso.opt.i[956,969] [2022-01-19 11:07:19,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:07:19,381 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:07:19,388 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/mix017_pso.opt_tso.opt.i[956,969] [2022-01-19 11:07:19,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:07:19,440 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:07:19,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19 WrapperNode [2022-01-19 11:07:19,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:07:19,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:07:19,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:07:19,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:07:19,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,511 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 296 [2022-01-19 11:07:19,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:07:19,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:07:19,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:07:19,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:07:19,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:07:19,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:07:19,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:07:19,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:07:19,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (1/1) ... [2022-01-19 11:07:19,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:07:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:07:19,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 11:07:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 11:07:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:07:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:07:19,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:07:19,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:07:19,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 11:07:19,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:07:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:07:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:07:19,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:07:19,620 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:07:19,701 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:07:19,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:07:20,076 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:07:20,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:07:20,322 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:07:20,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:07:20 BoogieIcfgContainer [2022-01-19 11:07:20,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:07:20,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:07:20,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:07:20,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:07:20,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:07:19" (1/3) ... [2022-01-19 11:07:20,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b4a6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:07:20, skipping insertion in model container [2022-01-19 11:07:20,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:07:19" (2/3) ... [2022-01-19 11:07:20,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b4a6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:07:20, skipping insertion in model container [2022-01-19 11:07:20,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:07:20" (3/3) ... [2022-01-19 11:07:20,343 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-01-19 11:07:20,346 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:07:20,346 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:07:20,346 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:07:20,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,401 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,403 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,403 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,403 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,404 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,404 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,404 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,404 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,404 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,405 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,405 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,405 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,405 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,405 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,405 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,406 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,406 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,406 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,406 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,406 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,407 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,408 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,409 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,410 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,410 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,410 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,410 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,410 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,410 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,411 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,411 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,411 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,411 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,411 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,413 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,413 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,413 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,413 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,413 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,414 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,415 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,415 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,415 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,416 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,416 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,421 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,424 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,425 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,425 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,425 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,425 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,426 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,427 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,428 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,429 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,430 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,432 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,432 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,432 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,432 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,433 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,434 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,435 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,436 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,436 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,436 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,436 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,436 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,437 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,437 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,437 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,437 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,437 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,437 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,438 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,440 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,440 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,442 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,442 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,442 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,442 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,445 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,446 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,447 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,447 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,451 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,451 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,451 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,453 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,453 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,453 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,454 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,455 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,456 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,457 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,457 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,457 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:07:20,457 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:07:20,501 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:07:20,505 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 11:07:20,506 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:07:20,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-01-19 11:07:20,563 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2022-01-19 11:07:20,563 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:07:20,566 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 64 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-01-19 11:07:20,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-01-19 11:07:20,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-01-19 11:07:20,590 INFO L129 PetriNetUnfolder]: 0/92 cut-off events. [2022-01-19 11:07:20,590 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:07:20,590 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:20,591 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] [2022-01-19 11:07:20,593 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -915314893, now seen corresponding path program 1 times [2022-01-19 11:07:20,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714065063] [2022-01-19 11:07:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:20,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:20,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:20,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714065063] [2022-01-19 11:07:20,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714065063] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:20,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:20,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:07:20,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250854292] [2022-01-19 11:07:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:20,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:07:20,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:07:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:07:20,918 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 136 [2022-01-19 11:07:20,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:20,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:20,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 136 [2022-01-19 11:07:20,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:21,005 INFO L129 PetriNetUnfolder]: 14/171 cut-off events. [2022-01-19 11:07:21,005 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 11:07:21,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 171 events. 14/171 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 267 event pairs, 2 based on Foata normal form. 5/167 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2022-01-19 11:07:21,008 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 10 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2022-01-19 11:07:21,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 296 flow [2022-01-19 11:07:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:07:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:07:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-01-19 11:07:21,059 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9387254901960784 [2022-01-19 11:07:21,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-01-19 11:07:21,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-01-19 11:07:21,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:21,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-01-19 11:07:21,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:21,083 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-19 11:07:21,083 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-19 11:07:21,085 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 383 transitions. [2022-01-19 11:07:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 296 flow [2022-01-19 11:07:21,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 130 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 11:07:21,093 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-01-19 11:07:21,095 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-19 11:07:21,098 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-01-19 11:07:21,098 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-01-19 11:07:21,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:21,099 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:21,099 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-19 11:07:21,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:07:21,099 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1357870858, now seen corresponding path program 1 times [2022-01-19 11:07:21,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:21,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815864717] [2022-01-19 11:07:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:21,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:21,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:21,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815864717] [2022-01-19 11:07:21,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815864717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:21,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:21,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:21,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713153415] [2022-01-19 11:07:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:21,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:21,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:21,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:21,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:21,401 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2022-01-19 11:07:21,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:21,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:21,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2022-01-19 11:07:21,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:21,956 INFO L129 PetriNetUnfolder]: 910/2279 cut-off events. [2022-01-19 11:07:21,956 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-01-19 11:07:21,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3723 conditions, 2279 events. 910/2279 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16214 event pairs, 178 based on Foata normal form. 0/2216 useless extension candidates. Maximal degree in co-relation 3661. Up to 604 conditions per place. [2022-01-19 11:07:21,974 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 25 selfloop transitions, 2 changer transitions 53/171 dead transitions. [2022-01-19 11:07:21,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 171 transitions, 494 flow [2022-01-19 11:07:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:07:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:07:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1041 transitions. [2022-01-19 11:07:21,977 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2022-01-19 11:07:21,977 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1041 transitions. [2022-01-19 11:07:21,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1041 transitions. [2022-01-19 11:07:21,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:21,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1041 transitions. [2022-01-19 11:07:21,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:21,982 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-19 11:07:21,982 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-19 11:07:21,982 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1041 transitions. [2022-01-19 11:07:21,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 171 transitions, 494 flow [2022-01-19 11:07:21,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 171 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:07:21,987 INFO L242 Difference]: Finished difference. Result has 152 places, 114 transitions, 256 flow [2022-01-19 11:07:21,987 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=9, PETRI_FLOW=256, PETRI_PLACES=152, PETRI_TRANSITIONS=114} [2022-01-19 11:07:21,987 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-01-19 11:07:21,988 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 114 transitions, 256 flow [2022-01-19 11:07:21,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:21,988 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:21,988 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:21,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:07:21,988 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash -732845957, now seen corresponding path program 1 times [2022-01-19 11:07:21,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:21,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944605682] [2022-01-19 11:07:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:21,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:22,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:22,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944605682] [2022-01-19 11:07:22,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944605682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:22,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:22,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:07:22,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087285389] [2022-01-19 11:07:22,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:22,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:07:22,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:07:22,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:07:22,162 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-19 11:07:22,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 114 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:22,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:22,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-19 11:07:22,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:22,714 INFO L129 PetriNetUnfolder]: 1614/2988 cut-off events. [2022-01-19 11:07:22,714 INFO L130 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-01-19 11:07:22,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2988 events. 1614/2988 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 20493 event pairs, 72 based on Foata normal form. 0/2929 useless extension candidates. Maximal degree in co-relation 5838. Up to 1009 conditions per place. [2022-01-19 11:07:22,731 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 32 selfloop transitions, 7 changer transitions 50/182 dead transitions. [2022-01-19 11:07:22,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 182 transitions, 597 flow [2022-01-19 11:07:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:07:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:07:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1201 transitions. [2022-01-19 11:07:22,734 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8830882352941176 [2022-01-19 11:07:22,734 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1201 transitions. [2022-01-19 11:07:22,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1201 transitions. [2022-01-19 11:07:22,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:22,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1201 transitions. [2022-01-19 11:07:22,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.1) internal successors, (1201), 10 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:22,738 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-19 11:07:22,739 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-19 11:07:22,739 INFO L186 Difference]: Start difference. First operand has 152 places, 114 transitions, 256 flow. Second operand 10 states and 1201 transitions. [2022-01-19 11:07:22,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 182 transitions, 597 flow [2022-01-19 11:07:22,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 182 transitions, 567 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-01-19 11:07:22,746 INFO L242 Difference]: Finished difference. Result has 139 places, 117 transitions, 306 flow [2022-01-19 11:07:22,746 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=306, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2022-01-19 11:07:22,746 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-01-19 11:07:22,746 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 306 flow [2022-01-19 11:07:22,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:22,747 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:22,747 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:22,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:07:22,747 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:22,748 INFO L85 PathProgramCache]: Analyzing trace with hash 689030598, now seen corresponding path program 1 times [2022-01-19 11:07:22,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:22,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187467619] [2022-01-19 11:07:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:22,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:22,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187467619] [2022-01-19 11:07:22,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187467619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:22,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:22,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:22,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443428676] [2022-01-19 11:07:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:22,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:22,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:22,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:22,869 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-19 11:07:22,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:22,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:22,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-19 11:07:22,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:23,247 INFO L129 PetriNetUnfolder]: 848/1837 cut-off events. [2022-01-19 11:07:23,248 INFO L130 PetriNetUnfolder]: For 2388/2404 co-relation queries the response was YES. [2022-01-19 11:07:23,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 1837 events. 848/1837 cut-off events. For 2388/2404 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12070 event pairs, 6 based on Foata normal form. 52/1885 useless extension candidates. Maximal degree in co-relation 5384. Up to 644 conditions per place. [2022-01-19 11:07:23,260 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 38 selfloop transitions, 11 changer transitions 39/181 dead transitions. [2022-01-19 11:07:23,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 181 transitions, 790 flow [2022-01-19 11:07:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:07:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:07:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1200 transitions. [2022-01-19 11:07:23,262 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-01-19 11:07:23,262 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1200 transitions. [2022-01-19 11:07:23,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1200 transitions. [2022-01-19 11:07:23,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:23,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1200 transitions. [2022-01-19 11:07:23,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,266 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-19 11:07:23,267 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-19 11:07:23,267 INFO L186 Difference]: Start difference. First operand has 139 places, 117 transitions, 306 flow. Second operand 10 states and 1200 transitions. [2022-01-19 11:07:23,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 181 transitions, 790 flow [2022-01-19 11:07:23,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 181 transitions, 765 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 11:07:23,273 INFO L242 Difference]: Finished difference. Result has 143 places, 121 transitions, 394 flow [2022-01-19 11:07:23,274 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=394, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2022-01-19 11:07:23,274 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-01-19 11:07:23,274 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 121 transitions, 394 flow [2022-01-19 11:07:23,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:23,275 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:23,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:07:23,275 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash 121143560, now seen corresponding path program 1 times [2022-01-19 11:07:23,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:23,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702682980] [2022-01-19 11:07:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:23,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:23,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:23,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702682980] [2022-01-19 11:07:23,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702682980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:23,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:23,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:07:23,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119305210] [2022-01-19 11:07:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:23,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:07:23,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:07:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:07:23,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-19 11:07:23,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 121 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:23,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-19 11:07:23,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:23,663 INFO L129 PetriNetUnfolder]: 353/935 cut-off events. [2022-01-19 11:07:23,663 INFO L130 PetriNetUnfolder]: For 3279/3295 co-relation queries the response was YES. [2022-01-19 11:07:23,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 935 events. 353/935 cut-off events. For 3279/3295 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5212 event pairs, 12 based on Foata normal form. 30/961 useless extension candidates. Maximal degree in co-relation 3244. Up to 289 conditions per place. [2022-01-19 11:07:23,670 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 43 selfloop transitions, 15 changer transitions 39/190 dead transitions. [2022-01-19 11:07:23,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 190 transitions, 1062 flow [2022-01-19 11:07:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 11:07:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 11:07:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1320 transitions. [2022-01-19 11:07:23,672 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-01-19 11:07:23,673 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1320 transitions. [2022-01-19 11:07:23,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1320 transitions. [2022-01-19 11:07:23,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:23,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1320 transitions. [2022-01-19 11:07:23,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,677 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,677 INFO L186 Difference]: Start difference. First operand has 143 places, 121 transitions, 394 flow. Second operand 11 states and 1320 transitions. [2022-01-19 11:07:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 190 transitions, 1062 flow [2022-01-19 11:07:23,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 190 transitions, 882 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-01-19 11:07:23,685 INFO L242 Difference]: Finished difference. Result has 146 places, 125 transitions, 444 flow [2022-01-19 11:07:23,685 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=444, PETRI_PLACES=146, PETRI_TRANSITIONS=125} [2022-01-19 11:07:23,686 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 3 predicate places. [2022-01-19 11:07:23,686 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 125 transitions, 444 flow [2022-01-19 11:07:23,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,687 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:23,687 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] [2022-01-19 11:07:23,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:07:23,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1932445942, now seen corresponding path program 1 times [2022-01-19 11:07:23,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:23,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216170069] [2022-01-19 11:07:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:23,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:23,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:23,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216170069] [2022-01-19 11:07:23,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216170069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:23,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:23,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:23,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379266900] [2022-01-19 11:07:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:23,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:23,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:23,784 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-01-19 11:07:23,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 125 transitions, 444 flow. Second operand has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:23,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:23,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-01-19 11:07:23,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:24,005 INFO L129 PetriNetUnfolder]: 153/729 cut-off events. [2022-01-19 11:07:24,005 INFO L130 PetriNetUnfolder]: For 1833/1918 co-relation queries the response was YES. [2022-01-19 11:07:24,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 729 events. 153/729 cut-off events. For 1833/1918 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4210 event pairs, 11 based on Foata normal form. 25/732 useless extension candidates. Maximal degree in co-relation 1858. Up to 160 conditions per place. [2022-01-19 11:07:24,010 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 37 selfloop transitions, 2 changer transitions 11/156 dead transitions. [2022-01-19 11:07:24,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 156 transitions, 617 flow [2022-01-19 11:07:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:07:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:07:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2022-01-19 11:07:24,012 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8771008403361344 [2022-01-19 11:07:24,012 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2022-01-19 11:07:24,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2022-01-19 11:07:24,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:24,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2022-01-19 11:07:24,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,015 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-19 11:07:24,015 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-19 11:07:24,015 INFO L186 Difference]: Start difference. First operand has 146 places, 125 transitions, 444 flow. Second operand 7 states and 835 transitions. [2022-01-19 11:07:24,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 156 transitions, 617 flow [2022-01-19 11:07:24,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 156 transitions, 532 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-01-19 11:07:24,022 INFO L242 Difference]: Finished difference. Result has 143 places, 126 transitions, 378 flow [2022-01-19 11:07:24,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=378, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2022-01-19 11:07:24,023 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2022-01-19 11:07:24,023 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 378 flow [2022-01-19 11:07:24,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,024 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:24,025 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] [2022-01-19 11:07:24,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:07:24,025 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1399280646, now seen corresponding path program 2 times [2022-01-19 11:07:24,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:24,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131553281] [2022-01-19 11:07:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:24,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:24,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:24,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131553281] [2022-01-19 11:07:24,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131553281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:24,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:24,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:24,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119544081] [2022-01-19 11:07:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:24,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:24,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:24,158 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-01-19 11:07:24,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 378 flow. Second operand has 7 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:24,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-01-19 11:07:24,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:24,509 INFO L129 PetriNetUnfolder]: 473/1839 cut-off events. [2022-01-19 11:07:24,509 INFO L130 PetriNetUnfolder]: For 1907/2125 co-relation queries the response was YES. [2022-01-19 11:07:24,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3995 conditions, 1839 events. 473/1839 cut-off events. For 1907/2125 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14601 event pairs, 56 based on Foata normal form. 74/1856 useless extension candidates. Maximal degree in co-relation 3921. Up to 323 conditions per place. [2022-01-19 11:07:24,522 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 46 selfloop transitions, 8 changer transitions 22/176 dead transitions. [2022-01-19 11:07:24,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 176 transitions, 690 flow [2022-01-19 11:07:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 11:07:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 11:07:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1242 transitions. [2022-01-19 11:07:24,525 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8302139037433155 [2022-01-19 11:07:24,525 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1242 transitions. [2022-01-19 11:07:24,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1242 transitions. [2022-01-19 11:07:24,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:24,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1242 transitions. [2022-01-19 11:07:24,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.9090909090909) internal successors, (1242), 11 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,529 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,529 INFO L186 Difference]: Start difference. First operand has 143 places, 126 transitions, 378 flow. Second operand 11 states and 1242 transitions. [2022-01-19 11:07:24,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 176 transitions, 690 flow [2022-01-19 11:07:24,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 176 transitions, 663 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-01-19 11:07:24,537 INFO L242 Difference]: Finished difference. Result has 154 places, 131 transitions, 455 flow [2022-01-19 11:07:24,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=154, PETRI_TRANSITIONS=131} [2022-01-19 11:07:24,538 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places. [2022-01-19 11:07:24,538 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 131 transitions, 455 flow [2022-01-19 11:07:24,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:24,538 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] [2022-01-19 11:07:24,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:07:24,539 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2085924550, now seen corresponding path program 3 times [2022-01-19 11:07:24,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:24,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023636012] [2022-01-19 11:07:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:24,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:24,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:24,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023636012] [2022-01-19 11:07:24,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023636012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:24,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:24,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:07:24,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400720023] [2022-01-19 11:07:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:24,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:07:24,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:07:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:07:24,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-01-19 11:07:24,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 131 transitions, 455 flow. Second operand has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:24,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:24,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-01-19 11:07:24,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:25,077 INFO L129 PetriNetUnfolder]: 673/1965 cut-off events. [2022-01-19 11:07:25,077 INFO L130 PetriNetUnfolder]: For 3820/4621 co-relation queries the response was YES. [2022-01-19 11:07:25,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5723 conditions, 1965 events. 673/1965 cut-off events. For 3820/4621 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15702 event pairs, 36 based on Foata normal form. 220/2083 useless extension candidates. Maximal degree in co-relation 5700. Up to 373 conditions per place. [2022-01-19 11:07:25,090 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 31 selfloop transitions, 21 changer transitions 35/182 dead transitions. [2022-01-19 11:07:25,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 182 transitions, 936 flow [2022-01-19 11:07:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:07:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:07:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1407 transitions. [2022-01-19 11:07:25,093 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8621323529411765 [2022-01-19 11:07:25,093 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1407 transitions. [2022-01-19 11:07:25,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1407 transitions. [2022-01-19 11:07:25,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:25,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1407 transitions. [2022-01-19 11:07:25,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.25) internal successors, (1407), 12 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,098 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,098 INFO L186 Difference]: Start difference. First operand has 154 places, 131 transitions, 455 flow. Second operand 12 states and 1407 transitions. [2022-01-19 11:07:25,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 182 transitions, 936 flow [2022-01-19 11:07:25,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 182 transitions, 880 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-01-19 11:07:25,113 INFO L242 Difference]: Finished difference. Result has 159 places, 131 transitions, 483 flow [2022-01-19 11:07:25,113 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=483, PETRI_PLACES=159, PETRI_TRANSITIONS=131} [2022-01-19 11:07:25,113 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 16 predicate places. [2022-01-19 11:07:25,113 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 131 transitions, 483 flow [2022-01-19 11:07:25,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,114 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:25,114 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-19 11:07:25,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:07:25,114 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 246318382, now seen corresponding path program 1 times [2022-01-19 11:07:25,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:25,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081592845] [2022-01-19 11:07:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:25,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:25,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:25,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081592845] [2022-01-19 11:07:25,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081592845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:25,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:25,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:07:25,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067493577] [2022-01-19 11:07:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:25,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:07:25,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:07:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:07:25,212 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-01-19 11:07:25,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 131 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:25,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-01-19 11:07:25,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:25,442 INFO L129 PetriNetUnfolder]: 292/1342 cut-off events. [2022-01-19 11:07:25,442 INFO L130 PetriNetUnfolder]: For 2228/2454 co-relation queries the response was YES. [2022-01-19 11:07:25,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 1342 events. 292/1342 cut-off events. For 2228/2454 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10853 event pairs, 10 based on Foata normal form. 8/1281 useless extension candidates. Maximal degree in co-relation 3639. Up to 262 conditions per place. [2022-01-19 11:07:25,453 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 30 selfloop transitions, 3 changer transitions 5/148 dead transitions. [2022-01-19 11:07:25,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 148 transitions, 629 flow [2022-01-19 11:07:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:07:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:07:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2022-01-19 11:07:25,455 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8602941176470589 [2022-01-19 11:07:25,455 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2022-01-19 11:07:25,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2022-01-19 11:07:25,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:25,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2022-01-19 11:07:25,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,458 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-19 11:07:25,458 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-19 11:07:25,458 INFO L186 Difference]: Start difference. First operand has 159 places, 131 transitions, 483 flow. Second operand 7 states and 819 transitions. [2022-01-19 11:07:25,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 148 transitions, 629 flow [2022-01-19 11:07:25,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 148 transitions, 528 flow, removed 38 selfloop flow, removed 13 redundant places. [2022-01-19 11:07:25,470 INFO L242 Difference]: Finished difference. Result has 154 places, 133 transitions, 429 flow [2022-01-19 11:07:25,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=154, PETRI_TRANSITIONS=133} [2022-01-19 11:07:25,470 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places. [2022-01-19 11:07:25,470 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 133 transitions, 429 flow [2022-01-19 11:07:25,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:25,471 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-19 11:07:25,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:07:25,471 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash 343198304, now seen corresponding path program 2 times [2022-01-19 11:07:25,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:25,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255012034] [2022-01-19 11:07:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:25,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:07:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 11:07:25,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:07:25,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255012034] [2022-01-19 11:07:25,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255012034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:07:25,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:07:25,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 11:07:25,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499705764] [2022-01-19 11:07:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:07:25,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 11:07:25,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:07:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 11:07:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-19 11:07:25,701 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2022-01-19 11:07:25,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 133 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 110.0909090909091) internal successors, (1211), 11 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:07:25,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2022-01-19 11:07:25,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:07:25,950 INFO L129 PetriNetUnfolder]: 310/1498 cut-off events. [2022-01-19 11:07:25,951 INFO L130 PetriNetUnfolder]: For 903/999 co-relation queries the response was YES. [2022-01-19 11:07:25,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3324 conditions, 1498 events. 310/1498 cut-off events. For 903/999 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12984 event pairs, 16 based on Foata normal form. 3/1418 useless extension candidates. Maximal degree in co-relation 3302. Up to 215 conditions per place. [2022-01-19 11:07:25,959 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 18 selfloop transitions, 8 changer transitions 9/144 dead transitions. [2022-01-19 11:07:25,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 144 transitions, 547 flow [2022-01-19 11:07:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:07:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:07:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1328 transitions. [2022-01-19 11:07:25,961 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8137254901960784 [2022-01-19 11:07:25,961 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1328 transitions. [2022-01-19 11:07:25,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1328 transitions. [2022-01-19 11:07:25,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:07:25,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1328 transitions. [2022-01-19 11:07:25,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.66666666666667) internal successors, (1328), 12 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,966 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,966 INFO L186 Difference]: Start difference. First operand has 154 places, 133 transitions, 429 flow. Second operand 12 states and 1328 transitions. [2022-01-19 11:07:25,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 144 transitions, 547 flow [2022-01-19 11:07:25,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 144 transitions, 509 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-01-19 11:07:25,977 INFO L242 Difference]: Finished difference. Result has 160 places, 135 transitions, 437 flow [2022-01-19 11:07:25,978 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=437, PETRI_PLACES=160, PETRI_TRANSITIONS=135} [2022-01-19 11:07:25,978 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 17 predicate places. [2022-01-19 11:07:25,978 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 135 transitions, 437 flow [2022-01-19 11:07:25,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.0909090909091) internal successors, (1211), 11 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:07:25,979 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:07:25,979 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:07:25,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:07:25,979 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:07:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:07:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1281448638, now seen corresponding path program 3 times [2022-01-19 11:07:25,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:07:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18874404] [2022-01-19 11:07:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:07:25,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:07:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:07:26,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:07:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:07:26,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:07:26,180 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:07:26,204 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 11:07:26,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 11:07:26,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 11:07:26,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 11:07:26,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 11:07:26,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 11:07:26,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 11:07:26,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:07:26,210 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-01-19 11:07:26,214 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:07:26,214 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:07:26,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:07:26 BasicIcfg [2022-01-19 11:07:26,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:07:26,364 INFO L158 Benchmark]: Toolchain (without parser) took 7248.44ms. Allocated memory was 392.2MB in the beginning and 834.7MB in the end (delta: 442.5MB). Free memory was 337.4MB in the beginning and 706.1MB in the end (delta: -368.7MB). Peak memory consumption was 75.2MB. Max. memory is 16.0GB. [2022-01-19 11:07:26,364 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 392.2MB. Free memory is still 356.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:07:26,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.00ms. Allocated memory is still 392.2MB. Free memory was 337.2MB in the beginning and 347.2MB in the end (delta: -10.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.0GB. [2022-01-19 11:07:26,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.66ms. Allocated memory is still 392.2MB. Free memory was 347.2MB in the beginning and 344.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:07:26,365 INFO L158 Benchmark]: Boogie Preprocessor took 51.09ms. Allocated memory is still 392.2MB. Free memory was 344.0MB in the beginning and 340.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 11:07:26,365 INFO L158 Benchmark]: RCFGBuilder took 760.50ms. Allocated memory is still 392.2MB. Free memory was 340.9MB in the beginning and 242.3MB in the end (delta: 98.6MB). Peak memory consumption was 98.6MB. Max. memory is 16.0GB. [2022-01-19 11:07:26,365 INFO L158 Benchmark]: TraceAbstraction took 6038.50ms. Allocated memory was 392.2MB in the beginning and 834.7MB in the end (delta: 442.5MB). Free memory was 241.3MB in the beginning and 706.1MB in the end (delta: -464.8MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:07:26,366 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 392.2MB. Free memory is still 356.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 324.00ms. Allocated memory is still 392.2MB. Free memory was 337.2MB in the beginning and 347.2MB in the end (delta: -10.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.66ms. Allocated memory is still 392.2MB. Free memory was 347.2MB in the beginning and 344.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.09ms. Allocated memory is still 392.2MB. Free memory was 344.0MB in the beginning and 340.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 760.50ms. Allocated memory is still 392.2MB. Free memory was 340.9MB in the beginning and 242.3MB in the end (delta: 98.6MB). Peak memory consumption was 98.6MB. Max. memory is 16.0GB. * TraceAbstraction took 6038.50ms. Allocated memory was 392.2MB in the beginning and 834.7MB in the end (delta: 442.5MB). Free memory was 241.3MB in the beginning and 706.1MB in the end (delta: -464.8MB). There was no memory consumed. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t445; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t446; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t447; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] 0 pthread_t t448; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L829] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L879] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: 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, 170 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: 5.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 957 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 102 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=8, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 942 ConstructedInterpolants, 0 QuantifiedInterpolants, 4398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 11:07:26,395 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...