/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/mix053.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:15:58,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:15:58,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:15:58,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:15:58,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:15:58,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:15:58,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:15:58,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:15:58,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:15:58,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:15:58,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:15:58,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:15:58,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:15:58,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:15:58,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:15:58,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:15:58,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:15:58,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:15:58,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:15:58,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:15:58,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:15:58,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:15:58,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:15:58,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:15:58,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:15:58,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:15:58,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:15:58,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:15:58,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:15:58,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:15:58,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:15:58,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:15:58,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:15:58,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:15:58,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:15:58,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:15:58,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:15:58,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:15:58,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:15:58,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:15:58,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:15:58,818 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:15:58,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:15:58,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:15:58,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:15:58,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:15:58,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:15:58,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:15:58,871 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:15:58,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:15:58,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:15:58,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:15:58,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:15:58,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:15:58,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:15:58,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:15:58,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:15:58,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:15:58,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:15:58,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:15:58,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:15:58,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:15:58,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:15:58,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:15:58,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:15:58,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:15:58,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:15:58,875 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:15:58,875 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:15:59,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:15:59,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:15:59,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:15:59,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:15:59,072 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:15:59,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2022-01-19 11:15:59,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3dc75e0/d5851d298c1343cc8074be00e49a245a/FLAGfa1d78d94 [2022-01-19 11:15:59,619 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:15:59,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2022-01-19 11:15:59,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3dc75e0/d5851d298c1343cc8074be00e49a245a/FLAGfa1d78d94 [2022-01-19 11:15:59,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3dc75e0/d5851d298c1343cc8074be00e49a245a [2022-01-19 11:15:59,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:15:59,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:15:59,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:15:59,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:15:59,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:15:59,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:15:59,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6222c072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:15:59, skipping insertion in model container [2022-01-19 11:15:59,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:15:59" (1/1) ... [2022-01-19 11:15:59,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:15:59,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:16:00,144 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/mix053.opt.i[944,957] [2022-01-19 11:16:00,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:16:00,310 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:16:00,320 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/mix053.opt.i[944,957] [2022-01-19 11:16:00,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:16:00,434 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:16:00,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00 WrapperNode [2022-01-19 11:16:00,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:16:00,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:16:00,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:16:00,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:16:00,442 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:16:00" (1/1) ... [2022-01-19 11:16:00,462 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:16:00" (1/1) ... [2022-01-19 11:16:00,491 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 191 [2022-01-19 11:16:00,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:16:00,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:16:00,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:16:00,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:16:00,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:16:00,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:16:00,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:16:00,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:16:00,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (1/1) ... [2022-01-19 11:16:00,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:16:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:16:00,580 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:16:00,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:16:00,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:16:00,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:16:00,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:16:00,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:16:00,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:16:00,622 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 11:16:00,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 11:16:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:16:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:16:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:16:00,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:16:00,624 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:16:00,611 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:16:00,764 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:16:00,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:16:01,130 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:16:01,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:16:01,499 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:16:01,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:16:01 BoogieIcfgContainer [2022-01-19 11:16:01,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:16:01,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:16:01,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:16:01,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:16:01,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:15:59" (1/3) ... [2022-01-19 11:16:01,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c78c5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:16:01, skipping insertion in model container [2022-01-19 11:16:01,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:16:00" (2/3) ... [2022-01-19 11:16:01,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c78c5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:16:01, skipping insertion in model container [2022-01-19 11:16:01,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:16:01" (3/3) ... [2022-01-19 11:16:01,509 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2022-01-19 11:16:01,513 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:16:01,514 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:16:01,514 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:16:01,564 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,564 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,564 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,566 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,566 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,567 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,568 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,568 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,568 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,569 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,569 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,570 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,570 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,570 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,570 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,570 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,570 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,577 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,578 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,579 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,579 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,579 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,581 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,586 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,587 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,587 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,588 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,592 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,592 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,592 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,592 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,593 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:16:01,594 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,594 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:16:01,594 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,594 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:16:01,594 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,594 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:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,603 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,604 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,605 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,606 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,607 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,608 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,608 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,608 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,608 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,608 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:16:01,608 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,608 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,609 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,609 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,609 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:16:01,609 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:16:01,662 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:16:01,672 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:16:01,673 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:16:01,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-01-19 11:16:01,739 INFO L129 PetriNetUnfolder]: 2/128 cut-off events. [2022-01-19 11:16:01,739 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:16:01,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-01-19 11:16:01,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-01-19 11:16:01,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-01-19 11:16:01,766 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2022-01-19 11:16:01,767 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:16:01,767 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:01,768 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] [2022-01-19 11:16:01,768 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:16:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2068016088, now seen corresponding path program 1 times [2022-01-19 11:16:01,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:01,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832204925] [2022-01-19 11:16:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:01,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:02,114 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:16:02,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:02,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832204925] [2022-01-19 11:16:02,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832204925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:02,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:02,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:16:02,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801853096] [2022-01-19 11:16:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:02,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:16:02,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:16:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:16:02,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2022-01-19 11:16:02,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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:16:02,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:02,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2022-01-19 11:16:02,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:02,234 INFO L129 PetriNetUnfolder]: 10/200 cut-off events. [2022-01-19 11:16:02,235 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 11:16:02,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 200 events. 10/200 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 361 event pairs, 4 based on Foata normal form. 5/196 useless extension candidates. Maximal degree in co-relation 187. Up to 17 conditions per place. [2022-01-19 11:16:02,238 INFO L132 encePairwiseOnDemand]: 127/132 looper letters, 9 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2022-01-19 11:16:02,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 126 transitions, 286 flow [2022-01-19 11:16:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:16:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:16:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-01-19 11:16:02,250 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9419191919191919 [2022-01-19 11:16:02,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2022-01-19 11:16:02,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2022-01-19 11:16:02,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:02,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2022-01-19 11:16:02,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:02,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:16:02,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:16:02,264 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 3 states and 373 transitions. [2022-01-19 11:16:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 126 transitions, 286 flow [2022-01-19 11:16:02,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 126 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 11:16:02,271 INFO L242 Difference]: Finished difference. Result has 135 places, 124 transitions, 260 flow [2022-01-19 11:16:02,273 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2022-01-19 11:16:02,275 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, -4 predicate places. [2022-01-19 11:16:02,276 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 260 flow [2022-01-19 11:16:02,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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:16:02,276 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:02,276 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] [2022-01-19 11:16:02,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:16:02,277 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:16:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1944507167, now seen corresponding path program 1 times [2022-01-19 11:16:02,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:02,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092469051] [2022-01-19 11:16:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:02,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:02,609 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:16:02,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:02,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092469051] [2022-01-19 11:16:02,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092469051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:02,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:02,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:02,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51107513] [2022-01-19 11:16:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:02,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:02,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:02,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:02,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2022-01-19 11:16:02,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 106.14285714285714) internal successors, (743), 7 states have internal predecessors, (743), 0 states have call successors, (0), 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:16:02,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:02,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2022-01-19 11:16:02,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:04,183 INFO L129 PetriNetUnfolder]: 2993/7898 cut-off events. [2022-01-19 11:16:04,183 INFO L130 PetriNetUnfolder]: For 315/315 co-relation queries the response was YES. [2022-01-19 11:16:04,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12663 conditions, 7898 events. 2993/7898 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 75002 event pairs, 380 based on Foata normal form. 0/7686 useless extension candidates. Maximal degree in co-relation 12605. Up to 1419 conditions per place. [2022-01-19 11:16:04,230 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 40 selfloop transitions, 9 changer transitions 98/234 dead transitions. [2022-01-19 11:16:04,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 234 transitions, 780 flow [2022-01-19 11:16:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1489 transitions. [2022-01-19 11:16:04,237 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8677156177156177 [2022-01-19 11:16:04,237 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1489 transitions. [2022-01-19 11:16:04,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1489 transitions. [2022-01-19 11:16:04,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:04,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1489 transitions. [2022-01-19 11:16:04,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.53846153846153) internal successors, (1489), 13 states have internal predecessors, (1489), 0 states have call successors, (0), 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:16:04,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:04,248 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:04,248 INFO L186 Difference]: Start difference. First operand has 135 places, 124 transitions, 260 flow. Second operand 13 states and 1489 transitions. [2022-01-19 11:16:04,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 234 transitions, 780 flow [2022-01-19 11:16:04,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 234 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:16:04,255 INFO L242 Difference]: Finished difference. Result has 157 places, 118 transitions, 338 flow [2022-01-19 11:16:04,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=338, PETRI_PLACES=157, PETRI_TRANSITIONS=118} [2022-01-19 11:16:04,256 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2022-01-19 11:16:04,256 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 118 transitions, 338 flow [2022-01-19 11:16:04,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.14285714285714) internal successors, (743), 7 states have internal predecessors, (743), 0 states have call successors, (0), 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:16:04,257 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:04,257 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:04,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:16:04,258 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:16:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 326052604, now seen corresponding path program 1 times [2022-01-19 11:16:04,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:04,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297529546] [2022-01-19 11:16:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:04,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:04,438 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:16:04,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297529546] [2022-01-19 11:16:04,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297529546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:04,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:04,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:04,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090347057] [2022-01-19 11:16:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:04,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:04,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:04,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:04,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:04,442 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2022-01-19 11:16:04,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 118 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 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:16:04,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:04,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2022-01-19 11:16:04,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:05,345 INFO L129 PetriNetUnfolder]: 1898/3883 cut-off events. [2022-01-19 11:16:05,346 INFO L130 PetriNetUnfolder]: For 7871/7871 co-relation queries the response was YES. [2022-01-19 11:16:05,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12344 conditions, 3883 events. 1898/3883 cut-off events. For 7871/7871 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27971 event pairs, 362 based on Foata normal form. 86/3840 useless extension candidates. Maximal degree in co-relation 12274. Up to 1023 conditions per place. [2022-01-19 11:16:05,384 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 42 selfloop transitions, 13 changer transitions 85/227 dead transitions. [2022-01-19 11:16:05,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 227 transitions, 1248 flow [2022-01-19 11:16:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1478 transitions. [2022-01-19 11:16:05,388 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8613053613053613 [2022-01-19 11:16:05,388 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1478 transitions. [2022-01-19 11:16:05,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1478 transitions. [2022-01-19 11:16:05,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:05,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1478 transitions. [2022-01-19 11:16:05,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.6923076923077) internal successors, (1478), 13 states have internal predecessors, (1478), 0 states have call successors, (0), 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:16:05,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:05,398 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:05,398 INFO L186 Difference]: Start difference. First operand has 157 places, 118 transitions, 338 flow. Second operand 13 states and 1478 transitions. [2022-01-19 11:16:05,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 227 transitions, 1248 flow [2022-01-19 11:16:05,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 227 transitions, 1224 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-01-19 11:16:05,424 INFO L242 Difference]: Finished difference. Result has 155 places, 126 transitions, 496 flow [2022-01-19 11:16:05,424 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=496, PETRI_PLACES=155, PETRI_TRANSITIONS=126} [2022-01-19 11:16:05,427 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 16 predicate places. [2022-01-19 11:16:05,427 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 126 transitions, 496 flow [2022-01-19 11:16:05,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 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:16:05,428 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:05,428 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:05,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:16:05,430 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:16:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash -646361823, now seen corresponding path program 1 times [2022-01-19 11:16:05,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:05,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819498883] [2022-01-19 11:16:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:05,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:05,612 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:16:05,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:05,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819498883] [2022-01-19 11:16:05,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819498883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:05,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:05,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:16:05,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534986327] [2022-01-19 11:16:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:05,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:16:05,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:16:05,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:16:05,620 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-01-19 11:16:05,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 126 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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:16:05,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:05,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-01-19 11:16:05,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:07,611 INFO L129 PetriNetUnfolder]: 6461/12138 cut-off events. [2022-01-19 11:16:07,611 INFO L130 PetriNetUnfolder]: For 23843/31273 co-relation queries the response was YES. [2022-01-19 11:16:07,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32303 conditions, 12138 events. 6461/12138 cut-off events. For 23843/31273 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 106515 event pairs, 351 based on Foata normal form. 334/11231 useless extension candidates. Maximal degree in co-relation 32223. Up to 4152 conditions per place. [2022-01-19 11:16:07,764 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 69 selfloop transitions, 20 changer transitions 0/194 dead transitions. [2022-01-19 11:16:07,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 194 transitions, 928 flow [2022-01-19 11:16:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:16:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:16:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1163 transitions. [2022-01-19 11:16:07,768 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810606060606061 [2022-01-19 11:16:07,768 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1163 transitions. [2022-01-19 11:16:07,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1163 transitions. [2022-01-19 11:16:07,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:07,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1163 transitions. [2022-01-19 11:16:07,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.3) internal successors, (1163), 10 states have internal predecessors, (1163), 0 states have call successors, (0), 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:16:07,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 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:16:07,773 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 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:16:07,773 INFO L186 Difference]: Start difference. First operand has 155 places, 126 transitions, 496 flow. Second operand 10 states and 1163 transitions. [2022-01-19 11:16:07,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 194 transitions, 928 flow [2022-01-19 11:16:07,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 194 transitions, 910 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-01-19 11:16:07,835 INFO L242 Difference]: Finished difference. Result has 161 places, 144 transitions, 621 flow [2022-01-19 11:16:07,835 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=621, PETRI_PLACES=161, PETRI_TRANSITIONS=144} [2022-01-19 11:16:07,836 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 22 predicate places. [2022-01-19 11:16:07,836 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 144 transitions, 621 flow [2022-01-19 11:16:07,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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:16:07,836 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:07,836 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:16:07,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:16:07,837 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:16:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash 714313472, now seen corresponding path program 1 times [2022-01-19 11:16:07,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:07,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615836041] [2022-01-19 11:16:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:07,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:07,986 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:16:07,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:07,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615836041] [2022-01-19 11:16:07,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615836041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:07,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:07,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:07,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28553864] [2022-01-19 11:16:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:07,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:07,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:07,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2022-01-19 11:16:07,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 144 transitions, 621 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 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:16:07,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:07,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2022-01-19 11:16:07,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:09,457 INFO L129 PetriNetUnfolder]: 3432/10168 cut-off events. [2022-01-19 11:16:09,457 INFO L130 PetriNetUnfolder]: For 21238/23314 co-relation queries the response was YES. [2022-01-19 11:16:09,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31336 conditions, 10168 events. 3432/10168 cut-off events. For 21238/23314 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 115174 event pairs, 880 based on Foata normal form. 181/9547 useless extension candidates. Maximal degree in co-relation 31244. Up to 2418 conditions per place. [2022-01-19 11:16:09,561 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 98 selfloop transitions, 37 changer transitions 0/240 dead transitions. [2022-01-19 11:16:09,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 240 transitions, 1579 flow [2022-01-19 11:16:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1465 transitions. [2022-01-19 11:16:09,565 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8537296037296037 [2022-01-19 11:16:09,565 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1465 transitions. [2022-01-19 11:16:09,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1465 transitions. [2022-01-19 11:16:09,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:09,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1465 transitions. [2022-01-19 11:16:09,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.6923076923077) internal successors, (1465), 13 states have internal predecessors, (1465), 0 states have call successors, (0), 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:16:09,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:09,571 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:09,572 INFO L186 Difference]: Start difference. First operand has 161 places, 144 transitions, 621 flow. Second operand 13 states and 1465 transitions. [2022-01-19 11:16:09,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 240 transitions, 1579 flow [2022-01-19 11:16:09,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 240 transitions, 1529 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-01-19 11:16:09,652 INFO L242 Difference]: Finished difference. Result has 175 places, 172 transitions, 1031 flow [2022-01-19 11:16:09,652 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1031, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2022-01-19 11:16:09,654 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 36 predicate places. [2022-01-19 11:16:09,655 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 1031 flow [2022-01-19 11:16:09,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 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:16:09,655 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:09,655 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:16:09,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:16:09,655 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:16:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash 302255904, now seen corresponding path program 1 times [2022-01-19 11:16:09,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:09,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372399840] [2022-01-19 11:16:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:09,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:09,768 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:16:09,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372399840] [2022-01-19 11:16:09,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372399840] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:09,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:09,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:09,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789193009] [2022-01-19 11:16:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:09,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:09,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:09,771 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-01-19 11:16:09,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 1031 flow. Second operand has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 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:16:09,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:09,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-01-19 11:16:09,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:12,448 INFO L129 PetriNetUnfolder]: 9358/18439 cut-off events. [2022-01-19 11:16:12,448 INFO L130 PetriNetUnfolder]: For 71207/87542 co-relation queries the response was YES. [2022-01-19 11:16:12,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69166 conditions, 18439 events. 9358/18439 cut-off events. For 71207/87542 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 181726 event pairs, 191 based on Foata normal form. 1275/18779 useless extension candidates. Maximal degree in co-relation 69073. Up to 5754 conditions per place. [2022-01-19 11:16:12,670 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 97 selfloop transitions, 38 changer transitions 8/269 dead transitions. [2022-01-19 11:16:12,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 269 transitions, 2071 flow [2022-01-19 11:16:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:16:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:16:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1515 transitions. [2022-01-19 11:16:12,674 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8828671328671329 [2022-01-19 11:16:12,674 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1515 transitions. [2022-01-19 11:16:12,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1515 transitions. [2022-01-19 11:16:12,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:12,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1515 transitions. [2022-01-19 11:16:12,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.53846153846153) internal successors, (1515), 13 states have internal predecessors, (1515), 0 states have call successors, (0), 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:16:12,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:12,681 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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:16:12,681 INFO L186 Difference]: Start difference. First operand has 175 places, 172 transitions, 1031 flow. Second operand 13 states and 1515 transitions. [2022-01-19 11:16:12,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 269 transitions, 2071 flow [2022-01-19 11:16:13,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 269 transitions, 2055 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-01-19 11:16:13,031 INFO L242 Difference]: Finished difference. Result has 193 places, 186 transitions, 1224 flow [2022-01-19 11:16:13,031 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1224, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2022-01-19 11:16:13,032 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 54 predicate places. [2022-01-19 11:16:13,032 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 1224 flow [2022-01-19 11:16:13,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 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:16:13,033 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:13,033 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] [2022-01-19 11:16:13,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:16:13,033 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:16:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 850054997, now seen corresponding path program 1 times [2022-01-19 11:16:13,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:13,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933904775] [2022-01-19 11:16:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:13,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:13,177 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:16:13,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:13,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933904775] [2022-01-19 11:16:13,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933904775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:13,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:13,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:16:13,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570273163] [2022-01-19 11:16:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:13,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:16:13,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:16:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:16:13,184 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-01-19 11:16:13,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 1224 flow. Second operand has 8 states, 8 states have (on average 109.875) internal successors, (879), 8 states have internal predecessors, (879), 0 states have call successors, (0), 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:16:13,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:13,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-01-19 11:16:13,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:16,238 INFO L129 PetriNetUnfolder]: 9301/18237 cut-off events. [2022-01-19 11:16:16,238 INFO L130 PetriNetUnfolder]: For 115797/132405 co-relation queries the response was YES. [2022-01-19 11:16:16,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85081 conditions, 18237 events. 9301/18237 cut-off events. For 115797/132405 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 181168 event pairs, 252 based on Foata normal form. 1251/18513 useless extension candidates. Maximal degree in co-relation 84979. Up to 5520 conditions per place. [2022-01-19 11:16:16,380 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 91 selfloop transitions, 58 changer transitions 43/305 dead transitions. [2022-01-19 11:16:16,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 305 transitions, 2710 flow [2022-01-19 11:16:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:16:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:16:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1866 transitions. [2022-01-19 11:16:16,385 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8835227272727273 [2022-01-19 11:16:16,385 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1866 transitions. [2022-01-19 11:16:16,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1866 transitions. [2022-01-19 11:16:16,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:16,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1866 transitions. [2022-01-19 11:16:16,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.625) internal successors, (1866), 16 states have internal predecessors, (1866), 0 states have call successors, (0), 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:16:16,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 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:16:16,393 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 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:16:16,394 INFO L186 Difference]: Start difference. First operand has 193 places, 186 transitions, 1224 flow. Second operand 16 states and 1866 transitions. [2022-01-19 11:16:16,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 305 transitions, 2710 flow [2022-01-19 11:16:17,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 305 transitions, 2595 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-01-19 11:16:17,991 INFO L242 Difference]: Finished difference. Result has 207 places, 199 transitions, 1458 flow [2022-01-19 11:16:17,991 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1458, PETRI_PLACES=207, PETRI_TRANSITIONS=199} [2022-01-19 11:16:17,991 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 68 predicate places. [2022-01-19 11:16:17,992 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 199 transitions, 1458 flow [2022-01-19 11:16:17,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.875) internal successors, (879), 8 states have internal predecessors, (879), 0 states have call successors, (0), 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:16:17,992 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:17,992 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:17,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:16:17,992 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:16:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 886843295, now seen corresponding path program 1 times [2022-01-19 11:16:17,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965892657] [2022-01-19 11:16:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:17,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:18,130 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:16:18,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:18,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965892657] [2022-01-19 11:16:18,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965892657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:18,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:18,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:16:18,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181759698] [2022-01-19 11:16:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:18,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:16:18,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:16:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:16:18,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-01-19 11:16:18,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 199 transitions, 1458 flow. Second operand has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 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:16:18,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:18,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-01-19 11:16:18,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:20,811 INFO L129 PetriNetUnfolder]: 8545/17158 cut-off events. [2022-01-19 11:16:20,811 INFO L130 PetriNetUnfolder]: For 111963/128082 co-relation queries the response was YES. [2022-01-19 11:16:20,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78396 conditions, 17158 events. 8545/17158 cut-off events. For 111963/128082 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 175015 event pairs, 109 based on Foata normal form. 1057/17315 useless extension candidates. Maximal degree in co-relation 78348. Up to 3318 conditions per place. [2022-01-19 11:16:20,926 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 82 selfloop transitions, 63 changer transitions 37/295 dead transitions. [2022-01-19 11:16:20,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 295 transitions, 2663 flow [2022-01-19 11:16:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 11:16:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 11:16:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2181 transitions. [2022-01-19 11:16:20,931 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8696172248803827 [2022-01-19 11:16:20,931 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2181 transitions. [2022-01-19 11:16:20,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2181 transitions. [2022-01-19 11:16:20,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:20,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2181 transitions. [2022-01-19 11:16:20,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 114.78947368421052) internal successors, (2181), 19 states have internal predecessors, (2181), 0 states have call successors, (0), 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:16:20,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 0 states have call successors, (0), 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:16:20,942 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 0 states have call successors, (0), 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:16:20,942 INFO L186 Difference]: Start difference. First operand has 207 places, 199 transitions, 1458 flow. Second operand 19 states and 2181 transitions. [2022-01-19 11:16:20,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 295 transitions, 2663 flow [2022-01-19 11:16:23,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 295 transitions, 2138 flow, removed 220 selfloop flow, removed 23 redundant places. [2022-01-19 11:16:23,437 INFO L242 Difference]: Finished difference. Result has 200 places, 198 transitions, 1242 flow [2022-01-19 11:16:23,437 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1242, PETRI_PLACES=200, PETRI_TRANSITIONS=198} [2022-01-19 11:16:23,437 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 61 predicate places. [2022-01-19 11:16:23,438 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 198 transitions, 1242 flow [2022-01-19 11:16:23,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 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:16:23,438 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:23,438 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:16:23,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:16:23,438 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:16:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1812794821, now seen corresponding path program 1 times [2022-01-19 11:16:23,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424914382] [2022-01-19 11:16:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:23,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:23,580 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:16:23,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:23,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424914382] [2022-01-19 11:16:23,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424914382] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:23,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:23,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:16:23,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383319064] [2022-01-19 11:16:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:23,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:16:23,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:16:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:16:23,582 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 132 [2022-01-19 11:16:23,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 198 transitions, 1242 flow. Second operand has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 0 states have call successors, (0), 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:16:23,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:23,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 132 [2022-01-19 11:16:23,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:24,837 INFO L129 PetriNetUnfolder]: 4475/13829 cut-off events. [2022-01-19 11:16:24,838 INFO L130 PetriNetUnfolder]: For 36028/37222 co-relation queries the response was YES. [2022-01-19 11:16:24,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46434 conditions, 13829 events. 4475/13829 cut-off events. For 36028/37222 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 185863 event pairs, 32 based on Foata normal form. 1/12918 useless extension candidates. Maximal degree in co-relation 46332. Up to 1566 conditions per place. [2022-01-19 11:16:24,975 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 29 selfloop transitions, 14 changer transitions 63/254 dead transitions. [2022-01-19 11:16:24,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 254 transitions, 1923 flow [2022-01-19 11:16:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:16:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:16:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2022-01-19 11:16:24,978 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291245791245792 [2022-01-19 11:16:24,978 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 985 transitions. [2022-01-19 11:16:24,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 985 transitions. [2022-01-19 11:16:24,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:24,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 985 transitions. [2022-01-19 11:16:24,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 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:16:24,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 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:16:24,984 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 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:16:24,984 INFO L186 Difference]: Start difference. First operand has 200 places, 198 transitions, 1242 flow. Second operand 9 states and 985 transitions. [2022-01-19 11:16:24,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 254 transitions, 1923 flow [2022-01-19 11:16:26,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 254 transitions, 1753 flow, removed 37 selfloop flow, removed 17 redundant places. [2022-01-19 11:16:26,314 INFO L242 Difference]: Finished difference. Result has 193 places, 184 transitions, 1021 flow [2022-01-19 11:16:26,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1021, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2022-01-19 11:16:26,314 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 54 predicate places. [2022-01-19 11:16:26,314 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 1021 flow [2022-01-19 11:16:26,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 0 states have call successors, (0), 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:16:26,315 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:26,315 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:16:26,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:16:26,315 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:16:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1330859257, now seen corresponding path program 2 times [2022-01-19 11:16:26,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:26,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654455631] [2022-01-19 11:16:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:26,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:26,481 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:16:26,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:26,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654455631] [2022-01-19 11:16:26,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654455631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:26,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:26,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:16:26,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968668226] [2022-01-19 11:16:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:26,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:16:26,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:16:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:16:26,483 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-01-19 11:16:26,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 1021 flow. Second operand has 8 states, 8 states have (on average 110.375) internal successors, (883), 8 states have internal predecessors, (883), 0 states have call successors, (0), 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:16:26,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:26,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-01-19 11:16:26,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:27,152 INFO L129 PetriNetUnfolder]: 1892/5750 cut-off events. [2022-01-19 11:16:27,153 INFO L130 PetriNetUnfolder]: For 11199/11425 co-relation queries the response was YES. [2022-01-19 11:16:27,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17281 conditions, 5750 events. 1892/5750 cut-off events. For 11199/11425 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 66723 event pairs, 14 based on Foata normal form. 1/5369 useless extension candidates. Maximal degree in co-relation 17246. Up to 702 conditions per place. [2022-01-19 11:16:27,205 INFO L132 encePairwiseOnDemand]: 124/132 looper letters, 17 selfloop transitions, 6 changer transitions 17/197 dead transitions. [2022-01-19 11:16:27,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 197 transitions, 1185 flow [2022-01-19 11:16:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:16:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:16:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1001 transitions. [2022-01-19 11:16:27,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2022-01-19 11:16:27,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1001 transitions. [2022-01-19 11:16:27,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1001 transitions. [2022-01-19 11:16:27,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:27,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1001 transitions. [2022-01-19 11:16:27,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:27,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 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:16:27,213 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 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:16:27,213 INFO L186 Difference]: Start difference. First operand has 193 places, 184 transitions, 1021 flow. Second operand 9 states and 1001 transitions. [2022-01-19 11:16:27,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 197 transitions, 1185 flow [2022-01-19 11:16:27,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 197 transitions, 1111 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-01-19 11:16:27,530 INFO L242 Difference]: Finished difference. Result has 195 places, 180 transitions, 968 flow [2022-01-19 11:16:27,530 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=968, PETRI_PLACES=195, PETRI_TRANSITIONS=180} [2022-01-19 11:16:27,531 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 56 predicate places. [2022-01-19 11:16:27,531 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 180 transitions, 968 flow [2022-01-19 11:16:27,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.375) internal successors, (883), 8 states have internal predecessors, (883), 0 states have call successors, (0), 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:16:27,532 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:27,532 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:16:27,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:16:27,532 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:16:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash 933560375, now seen corresponding path program 3 times [2022-01-19 11:16:27,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:27,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146789700] [2022-01-19 11:16:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:27,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:16:27,643 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:16:27,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:16:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146789700] [2022-01-19 11:16:27,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146789700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:16:27,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:16:27,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:16:27,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605224928] [2022-01-19 11:16:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:16:27,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:16:27,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:16:27,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:16:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:16:27,646 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2022-01-19 11:16:27,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 180 transitions, 968 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:27,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:16:27,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2022-01-19 11:16:27,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:16:28,291 INFO L129 PetriNetUnfolder]: 1681/5957 cut-off events. [2022-01-19 11:16:28,291 INFO L130 PetriNetUnfolder]: For 11768/11815 co-relation queries the response was YES. [2022-01-19 11:16:28,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 5957 events. 1681/5957 cut-off events. For 11768/11815 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 74047 event pairs, 20 based on Foata normal form. 1/5703 useless extension candidates. Maximal degree in co-relation 17690. Up to 657 conditions per place. [2022-01-19 11:16:28,320 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 19 selfloop transitions, 6 changer transitions 70/193 dead transitions. [2022-01-19 11:16:28,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 193 transitions, 1126 flow [2022-01-19 11:16:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:16:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:16:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 768 transitions. [2022-01-19 11:16:28,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8311688311688312 [2022-01-19 11:16:28,322 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 768 transitions. [2022-01-19 11:16:28,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 768 transitions. [2022-01-19 11:16:28,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:16:28,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 768 transitions. [2022-01-19 11:16:28,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 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:16:28,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 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:16:28,326 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 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:16:28,326 INFO L186 Difference]: Start difference. First operand has 195 places, 180 transitions, 968 flow. Second operand 7 states and 768 transitions. [2022-01-19 11:16:28,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 193 transitions, 1126 flow [2022-01-19 11:16:28,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 1098 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 11:16:28,597 INFO L242 Difference]: Finished difference. Result has 195 places, 122 transitions, 471 flow [2022-01-19 11:16:28,597 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=195, PETRI_TRANSITIONS=122} [2022-01-19 11:16:28,598 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 56 predicate places. [2022-01-19 11:16:28,598 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 122 transitions, 471 flow [2022-01-19 11:16:28,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 11:16:28,598 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:16:28,598 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:16:28,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:16:28,598 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:16:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:16:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash -329800189, now seen corresponding path program 4 times [2022-01-19 11:16:28,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:16:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974385670] [2022-01-19 11:16:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:16:28,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:16:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:16:28,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:16:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:16:28,708 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:16:28,709 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:16:28,709 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 11:16:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 11:16:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 11:16:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 11:16:28,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 11:16:28,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 11:16:28,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 11:16:28,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 11:16:28,715 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:16:28,719 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:16:28,719 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:16:28,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:16:28 BasicIcfg [2022-01-19 11:16:28,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:16:28,886 INFO L158 Benchmark]: Toolchain (without parser) took 28944.34ms. Allocated memory was 360.7MB in the beginning and 9.4GB in the end (delta: 9.0GB). Free memory was 310.2MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2022-01-19 11:16:28,887 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 328.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:16:28,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.54ms. Allocated memory is still 360.7MB. Free memory was 310.0MB in the beginning and 321.5MB in the end (delta: -11.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. [2022-01-19 11:16:28,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.98ms. Allocated memory is still 360.7MB. Free memory was 321.5MB in the beginning and 318.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:16:28,890 INFO L158 Benchmark]: Boogie Preprocessor took 35.27ms. Allocated memory is still 360.7MB. Free memory was 318.8MB in the beginning and 316.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:16:28,890 INFO L158 Benchmark]: RCFGBuilder took 972.24ms. Allocated memory is still 360.7MB. Free memory was 316.7MB in the beginning and 321.7MB in the end (delta: -5.0MB). Peak memory consumption was 60.7MB. Max. memory is 16.0GB. [2022-01-19 11:16:28,890 INFO L158 Benchmark]: TraceAbstraction took 27382.18ms. Allocated memory was 360.7MB in the beginning and 9.4GB in the end (delta: 9.0GB). Free memory was 321.7MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2022-01-19 11:16:28,891 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 360.7MB. Free memory is still 328.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 489.54ms. Allocated memory is still 360.7MB. Free memory was 310.0MB in the beginning and 321.5MB in the end (delta: -11.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.98ms. Allocated memory is still 360.7MB. Free memory was 321.5MB in the beginning and 318.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.27ms. Allocated memory is still 360.7MB. Free memory was 318.8MB in the beginning and 316.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 972.24ms. Allocated memory is still 360.7MB. Free memory was 316.7MB in the beginning and 321.7MB in the end (delta: -5.0MB). Peak memory consumption was 60.7MB. Max. memory is 16.0GB. * TraceAbstraction took 27382.18ms. Allocated memory was 360.7MB in the beginning and 9.4GB in the end (delta: 9.0GB). Free memory was 321.7MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 1.3GB. 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L725] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L728] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L729] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L736] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}] [L739] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L741] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L844] 0 pthread_t t1413; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1413={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] [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-3, t1413={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] [L846] 0 pthread_t t1414; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={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] [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-2, t1413={5:0}, t1414={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] [L848] 0 pthread_t t1415; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={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] [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, t1415={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] [L850] 0 pthread_t t1416; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={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] [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={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] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 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) [L785] 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) [L786] 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)) [L786] 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)) [L787] 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)) [L787] 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)) [L788] 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)) [L788] 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)) [L789] 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)) [L789] 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)) [L790] 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)) [L790] 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)) [L791] 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)) [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z [L793] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L822] 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) [L822] 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) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 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 [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 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 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] 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) [L857] 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) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 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 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 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 [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, 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: 845]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 765 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 765 mSDsluCounter, 706 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1157 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1390 IncrementalHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 158 mSDtfsCounter, 1390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1458occurred in iteration=7, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 3936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 11:16:28,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...