/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:58:38,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:58:38,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:58:38,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:58:38,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:58:38,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:58:38,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:58:38,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:58:38,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:58:38,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:58:38,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:58:38,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:58:38,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:58:38,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:58:38,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:58:38,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:58:38,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:58:38,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:58:38,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:58:38,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:58:38,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:58:38,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:58:38,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:58:38,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:58:38,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:58:38,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:58:38,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:58:38,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:58:38,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:58:38,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:58:38,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:58:38,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:58:38,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:58:38,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:58:38,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:58:38,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:58:38,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:58:38,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:58:38,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:58:38,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:58:38,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:58:38,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 04:58:38,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:58:38,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:58:38,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:58:38,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:58:38,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:58:38,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:58:38,939 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:58:38,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:58:38,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:58:38,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:58:38,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:58:38,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:58:38,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:58:38,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 04:58:39,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:58:39,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:58:39,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:58:39,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:58:39,092 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:58:39,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-01-19 04:58:39,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21aaf299/264b633e4f49423e808d7d732f17e387/FLAG0ef230354 [2022-01-19 04:58:39,572 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:58:39,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-01-19 04:58:39,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21aaf299/264b633e4f49423e808d7d732f17e387/FLAG0ef230354 [2022-01-19 04:58:39,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21aaf299/264b633e4f49423e808d7d732f17e387 [2022-01-19 04:58:39,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:58:39,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:58:39,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:58:39,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:58:39,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:58:39,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:58:39" (1/1) ... [2022-01-19 04:58:39,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5994ac94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:39, skipping insertion in model container [2022-01-19 04:58:39,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:58:39" (1/1) ... [2022-01-19 04:58:39,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:58:39,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:58:39,824 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-01-19 04:58:39,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:58:39,991 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:58:40,002 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-01-19 04:58:40,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:58:40,068 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:58:40,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40 WrapperNode [2022-01-19 04:58:40,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:58:40,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:58:40,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:58:40,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:58:40,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,108 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-01-19 04:58:40,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:58:40,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:58:40,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:58:40,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:58:40,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:58:40,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:58:40,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:58:40,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:58:40,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (1/1) ... [2022-01-19 04:58:40,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:58:40,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:58:40,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 04:58:40,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 04:58:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:58:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:58:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:58:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:58:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:58:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:58:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:58:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:58:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:58:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:58:40,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:58:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:58:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:58:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:58:40,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:58:40,218 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:58:40,362 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:58:40,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:58:40,768 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:58:40,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:58:40,916 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:58:40,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:58:40 BoogieIcfgContainer [2022-01-19 04:58:40,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:58:40,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:58:40,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:58:40,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:58:40,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:58:39" (1/3) ... [2022-01-19 04:58:40,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d07272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:58:40, skipping insertion in model container [2022-01-19 04:58:40,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:58:40" (2/3) ... [2022-01-19 04:58:40,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d07272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:58:40, skipping insertion in model container [2022-01-19 04:58:40,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:58:40" (3/3) ... [2022-01-19 04:58:40,922 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-01-19 04:58:40,925 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:58:40,925 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:58:40,925 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:58:40,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,957 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,962 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,963 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,963 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,963 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,963 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,963 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,964 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,965 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,966 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,966 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,966 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,966 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:58:40,966 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:58:40,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:58:40,999 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:58:40,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:58:41,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-01-19 04:58:41,030 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-01-19 04:58:41,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:58:41,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-19 04:58:41,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-01-19 04:58:41,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-01-19 04:58:41,040 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2022-01-19 04:58:41,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:58:41,040 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:41,041 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] [2022-01-19 04:58:41,041 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1654950207, now seen corresponding path program 1 times [2022-01-19 04:58:41,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:41,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102940012] [2022-01-19 04:58:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:41,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:41,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:41,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102940012] [2022-01-19 04:58:41,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102940012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:41,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:41,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:58:41,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086666692] [2022-01-19 04:58:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:41,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:58:41,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:58:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:58:41,227 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-01-19 04:58:41,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:41,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:41,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-01-19 04:58:41,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:41,345 INFO L129 PetriNetUnfolder]: 58/326 cut-off events. [2022-01-19 04:58:41,345 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 04:58:41,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 326 events. 58/326 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1332 event pairs, 10 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2022-01-19 04:58:41,349 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-01-19 04:58:41,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2022-01-19 04:58:41,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:58:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:58:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-01-19 04:58:41,361 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-01-19 04:58:41,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-01-19 04:58:41,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-01-19 04:58:41,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:41,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-01-19 04:58:41,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:41,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:41,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:41,374 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-01-19 04:58:41,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2022-01-19 04:58:41,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:58:41,380 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-01-19 04:58:41,381 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-01-19 04:58:41,384 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-01-19 04:58:41,384 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-01-19 04:58:41,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:41,385 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:41,385 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] [2022-01-19 04:58:41,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:58:41,385 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1969702196, now seen corresponding path program 1 times [2022-01-19 04:58:41,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571635781] [2022-01-19 04:58:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:41,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:41,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571635781] [2022-01-19 04:58:41,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571635781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:41,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:41,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:58:41,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711367582] [2022-01-19 04:58:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:41,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:58:41,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:58:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:58:41,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-01-19 04:58:41,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:41,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:41,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-01-19 04:58:41,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:42,155 INFO L129 PetriNetUnfolder]: 515/1536 cut-off events. [2022-01-19 04:58:42,155 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-01-19 04:58:42,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2465 conditions, 1536 events. 515/1536 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11250 event pairs, 129 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 2414. Up to 472 conditions per place. [2022-01-19 04:58:42,162 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 21 selfloop transitions, 3 changer transitions 51/153 dead transitions. [2022-01-19 04:58:42,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 153 transitions, 462 flow [2022-01-19 04:58:42,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:58:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:58:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 894 transitions. [2022-01-19 04:58:42,166 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8713450292397661 [2022-01-19 04:58:42,166 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 894 transitions. [2022-01-19 04:58:42,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 894 transitions. [2022-01-19 04:58:42,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:42,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 894 transitions. [2022-01-19 04:58:42,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.33333333333333) internal successors, (894), 9 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,172 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,173 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 894 transitions. [2022-01-19 04:58:42,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 153 transitions, 462 flow [2022-01-19 04:58:42,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 153 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:58:42,176 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 239 flow [2022-01-19 04:58:42,177 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2022-01-19 04:58:42,177 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-01-19 04:58:42,177 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 239 flow [2022-01-19 04:58:42,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,178 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:42,178 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] [2022-01-19 04:58:42,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:58:42,178 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:42,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -992827149, now seen corresponding path program 1 times [2022-01-19 04:58:42,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:42,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394252545] [2022-01-19 04:58:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:42,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:42,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:42,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394252545] [2022-01-19 04:58:42,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394252545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:42,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:42,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:58:42,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864567215] [2022-01-19 04:58:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:42,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:58:42,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:58:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:58:42,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-01-19 04:58:42,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:42,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-01-19 04:58:42,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:42,550 INFO L129 PetriNetUnfolder]: 424/979 cut-off events. [2022-01-19 04:58:42,550 INFO L130 PetriNetUnfolder]: For 715/722 co-relation queries the response was YES. [2022-01-19 04:58:42,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 979 events. 424/979 cut-off events. For 715/722 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5625 event pairs, 100 based on Foata normal form. 30/963 useless extension candidates. Maximal degree in co-relation 2142. Up to 295 conditions per place. [2022-01-19 04:58:42,557 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 31/132 dead transitions. [2022-01-19 04:58:42,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 429 flow [2022-01-19 04:58:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:58:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:58:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-01-19 04:58:42,559 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2022-01-19 04:58:42,559 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-01-19 04:58:42,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-01-19 04:58:42,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:42,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-01-19 04:58:42,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,565 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,565 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 239 flow. Second operand 9 states and 890 transitions. [2022-01-19 04:58:42,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 429 flow [2022-01-19 04:58:42,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 132 transitions, 412 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 04:58:42,575 INFO L242 Difference]: Finished difference. Result has 122 places, 97 transitions, 250 flow [2022-01-19 04:58:42,575 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2022-01-19 04:58:42,576 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2022-01-19 04:58:42,576 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 250 flow [2022-01-19 04:58:42,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,577 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:42,577 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] [2022-01-19 04:58:42,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:58:42,578 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 588842642, now seen corresponding path program 1 times [2022-01-19 04:58:42,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:42,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201830077] [2022-01-19 04:58:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:42,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:42,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201830077] [2022-01-19 04:58:42,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201830077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:42,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:42,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:58:42,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532135073] [2022-01-19 04:58:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:42,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:58:42,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:58:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:58:42,746 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-01-19 04:58:42,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:42,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:42,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-01-19 04:58:42,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:43,007 INFO L129 PetriNetUnfolder]: 488/1110 cut-off events. [2022-01-19 04:58:43,007 INFO L130 PetriNetUnfolder]: For 1033/1038 co-relation queries the response was YES. [2022-01-19 04:58:43,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 1110 events. 488/1110 cut-off events. For 1033/1038 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6438 event pairs, 81 based on Foata normal form. 28/1079 useless extension candidates. Maximal degree in co-relation 2520. Up to 281 conditions per place. [2022-01-19 04:58:43,013 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 25 selfloop transitions, 4 changer transitions 32/140 dead transitions. [2022-01-19 04:58:43,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 140 transitions, 495 flow [2022-01-19 04:58:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:58:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:58:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2022-01-19 04:58:43,015 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8535087719298246 [2022-01-19 04:58:43,015 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2022-01-19 04:58:43,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2022-01-19 04:58:43,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:43,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2022-01-19 04:58:43,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,019 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,019 INFO L186 Difference]: Start difference. First operand has 122 places, 97 transitions, 250 flow. Second operand 10 states and 973 transitions. [2022-01-19 04:58:43,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 140 transitions, 495 flow [2022-01-19 04:58:43,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 140 transitions, 459 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-01-19 04:58:43,024 INFO L242 Difference]: Finished difference. Result has 125 places, 98 transitions, 267 flow [2022-01-19 04:58:43,024 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=267, PETRI_PLACES=125, PETRI_TRANSITIONS=98} [2022-01-19 04:58:43,025 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2022-01-19 04:58:43,025 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 98 transitions, 267 flow [2022-01-19 04:58:43,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:43,025 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:58:43,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:58:43,026 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash 515189745, now seen corresponding path program 1 times [2022-01-19 04:58:43,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:43,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087289370] [2022-01-19 04:58:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:43,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:43,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:43,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087289370] [2022-01-19 04:58:43,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087289370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:43,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:43,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 04:58:43,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368232692] [2022-01-19 04:58:43,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:43,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 04:58:43,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 04:58:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-19 04:58:43,186 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-19 04:58:43,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 98 transitions, 267 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:43,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-19 04:58:43,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:43,570 INFO L129 PetriNetUnfolder]: 497/1162 cut-off events. [2022-01-19 04:58:43,570 INFO L130 PetriNetUnfolder]: For 1147/1196 co-relation queries the response was YES. [2022-01-19 04:58:43,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1162 events. 497/1162 cut-off events. For 1147/1196 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6487 event pairs, 127 based on Foata normal form. 32/1115 useless extension candidates. Maximal degree in co-relation 2613. Up to 501 conditions per place. [2022-01-19 04:58:43,581 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 21 selfloop transitions, 11 changer transitions 43/154 dead transitions. [2022-01-19 04:58:43,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 154 transitions, 589 flow [2022-01-19 04:58:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:58:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:58:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2022-01-19 04:58:43,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8350877192982457 [2022-01-19 04:58:43,585 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2022-01-19 04:58:43,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2022-01-19 04:58:43,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:43,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2022-01-19 04:58:43,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,594 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,594 INFO L186 Difference]: Start difference. First operand has 125 places, 98 transitions, 267 flow. Second operand 15 states and 1428 transitions. [2022-01-19 04:58:43,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 154 transitions, 589 flow [2022-01-19 04:58:43,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 154 transitions, 545 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-01-19 04:58:43,602 INFO L242 Difference]: Finished difference. Result has 136 places, 105 transitions, 352 flow [2022-01-19 04:58:43,603 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=352, PETRI_PLACES=136, PETRI_TRANSITIONS=105} [2022-01-19 04:58:43,605 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-01-19 04:58:43,605 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 105 transitions, 352 flow [2022-01-19 04:58:43,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,606 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:43,607 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] [2022-01-19 04:58:43,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:58:43,607 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 172582919, now seen corresponding path program 1 times [2022-01-19 04:58:43,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:43,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069839314] [2022-01-19 04:58:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:43,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:43,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:43,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069839314] [2022-01-19 04:58:43,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069839314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:43,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:43,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 04:58:43,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849712144] [2022-01-19 04:58:43,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:43,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 04:58:43,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 04:58:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 04:58:43,800 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-19 04:58:43,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 105 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:43,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:43,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-19 04:58:43,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:44,174 INFO L129 PetriNetUnfolder]: 429/1051 cut-off events. [2022-01-19 04:58:44,174 INFO L130 PetriNetUnfolder]: For 3512/3976 co-relation queries the response was YES. [2022-01-19 04:58:44,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 1051 events. 429/1051 cut-off events. For 3512/3976 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5789 event pairs, 119 based on Foata normal form. 26/1004 useless extension candidates. Maximal degree in co-relation 3635. Up to 439 conditions per place. [2022-01-19 04:58:44,183 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 31 selfloop transitions, 9 changer transitions 37/156 dead transitions. [2022-01-19 04:58:44,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 156 transitions, 880 flow [2022-01-19 04:58:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:58:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:58:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1424 transitions. [2022-01-19 04:58:44,186 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8327485380116959 [2022-01-19 04:58:44,186 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1424 transitions. [2022-01-19 04:58:44,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1424 transitions. [2022-01-19 04:58:44,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:44,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1424 transitions. [2022-01-19 04:58:44,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.93333333333334) internal successors, (1424), 15 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:44,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:44,193 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:44,193 INFO L186 Difference]: Start difference. First operand has 136 places, 105 transitions, 352 flow. Second operand 15 states and 1424 transitions. [2022-01-19 04:58:44,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 156 transitions, 880 flow [2022-01-19 04:58:44,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 156 transitions, 852 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-01-19 04:58:44,200 INFO L242 Difference]: Finished difference. Result has 146 places, 108 transitions, 422 flow [2022-01-19 04:58:44,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=422, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2022-01-19 04:58:44,202 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 27 predicate places. [2022-01-19 04:58:44,202 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 422 flow [2022-01-19 04:58:44,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:44,203 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:44,203 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] [2022-01-19 04:58:44,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:58:44,203 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -440170143, now seen corresponding path program 1 times [2022-01-19 04:58:44,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:44,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628814410] [2022-01-19 04:58:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:44,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:44,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:44,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628814410] [2022-01-19 04:58:44,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628814410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:44,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:44,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 04:58:44,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853760401] [2022-01-19 04:58:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:44,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 04:58:44,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 04:58:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-19 04:58:44,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-01-19 04:58:44,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:44,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:44,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-01-19 04:58:44,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:44,975 INFO L129 PetriNetUnfolder]: 451/1071 cut-off events. [2022-01-19 04:58:44,975 INFO L130 PetriNetUnfolder]: For 7975/8663 co-relation queries the response was YES. [2022-01-19 04:58:44,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5047 conditions, 1071 events. 451/1071 cut-off events. For 7975/8663 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5961 event pairs, 98 based on Foata normal form. 50/1065 useless extension candidates. Maximal degree in co-relation 4957. Up to 513 conditions per place. [2022-01-19 04:58:44,989 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 34 selfloop transitions, 16 changer transitions 41/168 dead transitions. [2022-01-19 04:58:44,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 168 transitions, 1210 flow [2022-01-19 04:58:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:58:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:58:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1489 transitions. [2022-01-19 04:58:44,993 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8163377192982456 [2022-01-19 04:58:44,993 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1489 transitions. [2022-01-19 04:58:44,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1489 transitions. [2022-01-19 04:58:44,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:44,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1489 transitions. [2022-01-19 04:58:44,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.0625) internal successors, (1489), 16 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 04:58:44,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,000 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,000 INFO L186 Difference]: Start difference. First operand has 146 places, 108 transitions, 422 flow. Second operand 16 states and 1489 transitions. [2022-01-19 04:58:45,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 168 transitions, 1210 flow [2022-01-19 04:58:45,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 168 transitions, 1151 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-19 04:58:45,011 INFO L242 Difference]: Finished difference. Result has 155 places, 121 transitions, 613 flow [2022-01-19 04:58:45,011 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=613, PETRI_PLACES=155, PETRI_TRANSITIONS=121} [2022-01-19 04:58:45,012 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2022-01-19 04:58:45,012 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 121 transitions, 613 flow [2022-01-19 04:58:45,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,012 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:45,013 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] [2022-01-19 04:58:45,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:58:45,013 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash -205648795, now seen corresponding path program 2 times [2022-01-19 04:58:45,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:45,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660335363] [2022-01-19 04:58:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:45,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:45,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:45,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660335363] [2022-01-19 04:58:45,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660335363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:45,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:45,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:58:45,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347276160] [2022-01-19 04:58:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:45,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:58:45,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:45,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:58:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:58:45,170 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-01-19 04:58:45,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 121 transitions, 613 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:45,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-01-19 04:58:45,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:45,586 INFO L129 PetriNetUnfolder]: 438/1051 cut-off events. [2022-01-19 04:58:45,586 INFO L130 PetriNetUnfolder]: For 12647/14168 co-relation queries the response was YES. [2022-01-19 04:58:45,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5940 conditions, 1051 events. 438/1051 cut-off events. For 12647/14168 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5866 event pairs, 97 based on Foata normal form. 90/1082 useless extension candidates. Maximal degree in co-relation 5844. Up to 471 conditions per place. [2022-01-19 04:58:45,601 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 30 selfloop transitions, 20 changer transitions 29/157 dead transitions. [2022-01-19 04:58:45,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 157 transitions, 1243 flow [2022-01-19 04:58:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:58:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:58:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1308 transitions. [2022-01-19 04:58:45,604 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8195488721804511 [2022-01-19 04:58:45,604 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1308 transitions. [2022-01-19 04:58:45,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1308 transitions. [2022-01-19 04:58:45,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:45,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1308 transitions. [2022-01-19 04:58:45,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.42857142857143) internal successors, (1308), 14 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,609 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,610 INFO L186 Difference]: Start difference. First operand has 155 places, 121 transitions, 613 flow. Second operand 14 states and 1308 transitions. [2022-01-19 04:58:45,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 157 transitions, 1243 flow [2022-01-19 04:58:45,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 157 transitions, 1121 flow, removed 59 selfloop flow, removed 8 redundant places. [2022-01-19 04:58:45,623 INFO L242 Difference]: Finished difference. Result has 158 places, 122 transitions, 625 flow [2022-01-19 04:58:45,623 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=625, PETRI_PLACES=158, PETRI_TRANSITIONS=122} [2022-01-19 04:58:45,624 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2022-01-19 04:58:45,624 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 122 transitions, 625 flow [2022-01-19 04:58:45,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,624 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:45,625 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] [2022-01-19 04:58:45,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:58:45,625 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1579075484, now seen corresponding path program 1 times [2022-01-19 04:58:45,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:45,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816929958] [2022-01-19 04:58:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:45,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:45,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:45,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816929958] [2022-01-19 04:58:45,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816929958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:45,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:45,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:58:45,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084876100] [2022-01-19 04:58:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:45,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:58:45,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:58:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:58:45,806 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-01-19 04:58:45,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 122 transitions, 625 flow. Second operand has 13 states, 13 states have (on average 89.38461538461539) internal successors, (1162), 13 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:45,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:45,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-01-19 04:58:45,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:46,401 INFO L129 PetriNetUnfolder]: 498/1245 cut-off events. [2022-01-19 04:58:46,401 INFO L130 PetriNetUnfolder]: For 19220/20548 co-relation queries the response was YES. [2022-01-19 04:58:46,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7522 conditions, 1245 events. 498/1245 cut-off events. For 19220/20548 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7662 event pairs, 33 based on Foata normal form. 104/1282 useless extension candidates. Maximal degree in co-relation 7420. Up to 371 conditions per place. [2022-01-19 04:58:46,416 INFO L132 encePairwiseOnDemand]: 100/114 looper letters, 40 selfloop transitions, 24 changer transitions 51/192 dead transitions. [2022-01-19 04:58:46,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 192 transitions, 1988 flow [2022-01-19 04:58:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 04:58:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 04:58:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2033 transitions. [2022-01-19 04:58:46,420 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-01-19 04:58:46,420 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2033 transitions. [2022-01-19 04:58:46,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2033 transitions. [2022-01-19 04:58:46,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:46,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2033 transitions. [2022-01-19 04:58:46,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 92.4090909090909) internal successors, (2033), 22 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:46,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 114.0) internal successors, (2622), 23 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:46,428 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 114.0) internal successors, (2622), 23 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:46,428 INFO L186 Difference]: Start difference. First operand has 158 places, 122 transitions, 625 flow. Second operand 22 states and 2033 transitions. [2022-01-19 04:58:46,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 192 transitions, 1988 flow [2022-01-19 04:58:46,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 192 transitions, 1903 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-01-19 04:58:46,446 INFO L242 Difference]: Finished difference. Result has 179 places, 127 transitions, 801 flow [2022-01-19 04:58:46,446 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=801, PETRI_PLACES=179, PETRI_TRANSITIONS=127} [2022-01-19 04:58:46,447 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 60 predicate places. [2022-01-19 04:58:46,447 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 127 transitions, 801 flow [2022-01-19 04:58:46,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.38461538461539) internal successors, (1162), 13 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:46,447 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:46,448 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] [2022-01-19 04:58:46,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:58:46,448 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1775107707, now seen corresponding path program 1 times [2022-01-19 04:58:46,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:46,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358053084] [2022-01-19 04:58:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:46,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:46,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:46,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358053084] [2022-01-19 04:58:46,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358053084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:46,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:46,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:58:46,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744891844] [2022-01-19 04:58:46,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:46,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:58:46,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:46,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:58:46,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:58:46,643 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-01-19 04:58:46,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 127 transitions, 801 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:46,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:46,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-01-19 04:58:46,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:47,114 INFO L129 PetriNetUnfolder]: 332/981 cut-off events. [2022-01-19 04:58:47,114 INFO L130 PetriNetUnfolder]: For 23927/25158 co-relation queries the response was YES. [2022-01-19 04:58:47,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6372 conditions, 981 events. 332/981 cut-off events. For 23927/25158 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6021 event pairs, 73 based on Foata normal form. 68/968 useless extension candidates. Maximal degree in co-relation 6256. Up to 441 conditions per place. [2022-01-19 04:58:47,128 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 41 selfloop transitions, 20 changer transitions 28/164 dead transitions. [2022-01-19 04:58:47,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 164 transitions, 1642 flow [2022-01-19 04:58:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:58:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:58:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1349 transitions. [2022-01-19 04:58:47,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2022-01-19 04:58:47,130 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1349 transitions. [2022-01-19 04:58:47,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1349 transitions. [2022-01-19 04:58:47,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:47,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1349 transitions. [2022-01-19 04:58:47,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.93333333333334) internal successors, (1349), 15 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,134 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,134 INFO L186 Difference]: Start difference. First operand has 179 places, 127 transitions, 801 flow. Second operand 15 states and 1349 transitions. [2022-01-19 04:58:47,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 164 transitions, 1642 flow [2022-01-19 04:58:47,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 164 transitions, 1280 flow, removed 175 selfloop flow, removed 26 redundant places. [2022-01-19 04:58:47,161 INFO L242 Difference]: Finished difference. Result has 162 places, 129 transitions, 766 flow [2022-01-19 04:58:47,161 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=766, PETRI_PLACES=162, PETRI_TRANSITIONS=129} [2022-01-19 04:58:47,162 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places. [2022-01-19 04:58:47,162 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 129 transitions, 766 flow [2022-01-19 04:58:47,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:47,163 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:58:47,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:58:47,163 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1910040746, now seen corresponding path program 1 times [2022-01-19 04:58:47,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:47,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273462557] [2022-01-19 04:58:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:47,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:47,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:47,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273462557] [2022-01-19 04:58:47,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273462557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:47,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:47,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:58:47,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532470308] [2022-01-19 04:58:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:47,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:58:47,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:47,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:58:47,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:58:47,225 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-19 04:58:47,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 129 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:47,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-19 04:58:47,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:47,897 INFO L129 PetriNetUnfolder]: 2697/4919 cut-off events. [2022-01-19 04:58:47,898 INFO L130 PetriNetUnfolder]: For 57502/59504 co-relation queries the response was YES. [2022-01-19 04:58:47,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22773 conditions, 4919 events. 2697/4919 cut-off events. For 57502/59504 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 36186 event pairs, 76 based on Foata normal form. 331/5016 useless extension candidates. Maximal degree in co-relation 22676. Up to 1462 conditions per place. [2022-01-19 04:58:47,941 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 102 selfloop transitions, 15 changer transitions 69/270 dead transitions. [2022-01-19 04:58:47,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 270 transitions, 2694 flow [2022-01-19 04:58:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:58:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:58:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-01-19 04:58:47,942 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2022-01-19 04:58:47,942 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-01-19 04:58:47,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-01-19 04:58:47,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:47,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-01-19 04:58:47,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,945 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,945 INFO L186 Difference]: Start difference. First operand has 162 places, 129 transitions, 766 flow. Second operand 10 states and 982 transitions. [2022-01-19 04:58:47,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 270 transitions, 2694 flow [2022-01-19 04:58:47,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 270 transitions, 2473 flow, removed 85 selfloop flow, removed 13 redundant places. [2022-01-19 04:58:47,985 INFO L242 Difference]: Finished difference. Result has 158 places, 137 transitions, 748 flow [2022-01-19 04:58:47,985 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=748, PETRI_PLACES=158, PETRI_TRANSITIONS=137} [2022-01-19 04:58:47,985 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 39 predicate places. [2022-01-19 04:58:47,986 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 137 transitions, 748 flow [2022-01-19 04:58:47,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:47,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:47,986 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] [2022-01-19 04:58:47,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:58:47,986 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1201115612, now seen corresponding path program 1 times [2022-01-19 04:58:47,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:47,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218266284] [2022-01-19 04:58:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:47,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:48,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:48,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218266284] [2022-01-19 04:58:48,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218266284] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:48,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:48,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:58:48,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705268798] [2022-01-19 04:58:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:48,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:58:48,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:48,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:58:48,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:58:48,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-19 04:58:48,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 137 transitions, 748 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:48,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:48,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-19 04:58:48,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:48,704 INFO L129 PetriNetUnfolder]: 2359/4512 cut-off events. [2022-01-19 04:58:48,704 INFO L130 PetriNetUnfolder]: For 43863/45140 co-relation queries the response was YES. [2022-01-19 04:58:48,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22299 conditions, 4512 events. 2359/4512 cut-off events. For 43863/45140 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34808 event pairs, 80 based on Foata normal form. 351/4730 useless extension candidates. Maximal degree in co-relation 22206. Up to 902 conditions per place. [2022-01-19 04:58:48,730 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 101 selfloop transitions, 26 changer transitions 78/288 dead transitions. [2022-01-19 04:58:48,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 288 transitions, 2801 flow [2022-01-19 04:58:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:58:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:58:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1277 transitions. [2022-01-19 04:58:48,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8616734143049932 [2022-01-19 04:58:48,732 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1277 transitions. [2022-01-19 04:58:48,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1277 transitions. [2022-01-19 04:58:48,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:48,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1277 transitions. [2022-01-19 04:58:48,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.23076923076923) internal successors, (1277), 13 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:48,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:48,735 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:48,736 INFO L186 Difference]: Start difference. First operand has 158 places, 137 transitions, 748 flow. Second operand 13 states and 1277 transitions. [2022-01-19 04:58:48,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 288 transitions, 2801 flow [2022-01-19 04:58:48,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 288 transitions, 2752 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-01-19 04:58:48,781 INFO L242 Difference]: Finished difference. Result has 173 places, 149 transitions, 910 flow [2022-01-19 04:58:48,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=910, PETRI_PLACES=173, PETRI_TRANSITIONS=149} [2022-01-19 04:58:48,782 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places. [2022-01-19 04:58:48,782 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 149 transitions, 910 flow [2022-01-19 04:58:48,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:48,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:48,782 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:58:48,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:58:48,782 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1956013789, now seen corresponding path program 1 times [2022-01-19 04:58:48,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:48,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022320632] [2022-01-19 04:58:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:48,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:48,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:48,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022320632] [2022-01-19 04:58:48,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022320632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:48,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:48,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:58:48,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366515618] [2022-01-19 04:58:48,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:48,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:58:48,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:58:48,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:58:48,850 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-01-19 04:58:48,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 149 transitions, 910 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:48,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:48,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-01-19 04:58:48,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:49,476 INFO L129 PetriNetUnfolder]: 2134/4255 cut-off events. [2022-01-19 04:58:49,477 INFO L130 PetriNetUnfolder]: For 45801/47089 co-relation queries the response was YES. [2022-01-19 04:58:49,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22707 conditions, 4255 events. 2134/4255 cut-off events. For 45801/47089 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34590 event pairs, 58 based on Foata normal form. 301/4424 useless extension candidates. Maximal degree in co-relation 22608. Up to 844 conditions per place. [2022-01-19 04:58:49,502 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 91 selfloop transitions, 30 changer transitions 76/280 dead transitions. [2022-01-19 04:58:49,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 280 transitions, 2730 flow [2022-01-19 04:58:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:58:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:58:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1536 transitions. [2022-01-19 04:58:49,504 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2022-01-19 04:58:49,504 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1536 transitions. [2022-01-19 04:58:49,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1536 transitions. [2022-01-19 04:58:49,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:49,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1536 transitions. [2022-01-19 04:58:49,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.0) internal successors, (1536), 16 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:49,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:49,508 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:49,508 INFO L186 Difference]: Start difference. First operand has 173 places, 149 transitions, 910 flow. Second operand 16 states and 1536 transitions. [2022-01-19 04:58:49,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 280 transitions, 2730 flow [2022-01-19 04:58:49,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 280 transitions, 2380 flow, removed 157 selfloop flow, removed 10 redundant places. [2022-01-19 04:58:49,627 INFO L242 Difference]: Finished difference. Result has 185 places, 150 transitions, 863 flow [2022-01-19 04:58:49,628 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=863, PETRI_PLACES=185, PETRI_TRANSITIONS=150} [2022-01-19 04:58:49,628 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 66 predicate places. [2022-01-19 04:58:49,628 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 150 transitions, 863 flow [2022-01-19 04:58:49,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:49,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:49,628 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 04:58:49,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:58:49,629 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -257841056, now seen corresponding path program 1 times [2022-01-19 04:58:49,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:49,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784602830] [2022-01-19 04:58:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:49,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:58:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:58:49,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:58:49,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784602830] [2022-01-19 04:58:49,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784602830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:58:49,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:58:49,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 04:58:49,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239776562] [2022-01-19 04:58:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:58:49,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 04:58:49,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:58:49,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 04:58:49,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-01-19 04:58:49,824 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-01-19 04:58:49,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 150 transitions, 863 flow. Second operand has 14 states, 14 states have (on average 87.64285714285714) internal successors, (1227), 14 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:49,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:58:49,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-01-19 04:58:49,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:58:50,242 INFO L129 PetriNetUnfolder]: 383/2192 cut-off events. [2022-01-19 04:58:50,242 INFO L130 PetriNetUnfolder]: For 6868/7242 co-relation queries the response was YES. [2022-01-19 04:58:50,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7335 conditions, 2192 events. 383/2192 cut-off events. For 6868/7242 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 25485 event pairs, 4 based on Foata normal form. 33/2087 useless extension candidates. Maximal degree in co-relation 7232. Up to 293 conditions per place. [2022-01-19 04:58:50,261 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 36 selfloop transitions, 14 changer transitions 8/162 dead transitions. [2022-01-19 04:58:50,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 162 transitions, 1087 flow [2022-01-19 04:58:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 04:58:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 04:58:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1069 transitions. [2022-01-19 04:58:50,263 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7814327485380117 [2022-01-19 04:58:50,263 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1069 transitions. [2022-01-19 04:58:50,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1069 transitions. [2022-01-19 04:58:50,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:58:50,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1069 transitions. [2022-01-19 04:58:50,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.08333333333333) internal successors, (1069), 12 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:50,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:50,266 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:50,267 INFO L186 Difference]: Start difference. First operand has 185 places, 150 transitions, 863 flow. Second operand 12 states and 1069 transitions. [2022-01-19 04:58:50,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 162 transitions, 1087 flow [2022-01-19 04:58:50,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 162 transitions, 925 flow, removed 48 selfloop flow, removed 20 redundant places. [2022-01-19 04:58:50,348 INFO L242 Difference]: Finished difference. Result has 178 places, 148 transitions, 766 flow [2022-01-19 04:58:50,349 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=766, PETRI_PLACES=178, PETRI_TRANSITIONS=148} [2022-01-19 04:58:50,349 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 59 predicate places. [2022-01-19 04:58:50,349 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 148 transitions, 766 flow [2022-01-19 04:58:50,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.64285714285714) internal successors, (1227), 14 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:58:50,350 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:58:50,350 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 04:58:50,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:58:50,350 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:58:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:58:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 915003692, now seen corresponding path program 2 times [2022-01-19 04:58:50,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:58:50,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548266706] [2022-01-19 04:58:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:58:50,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:58:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:58:50,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:58:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:58:50,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:58:50,443 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:58:50,444 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:58:50,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:58:50,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:58:50,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:58:50,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:58:50,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:58:50,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 04:58:50,448 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:58:50,451 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:58:50,451 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:58:50,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:58:50 BasicIcfg [2022-01-19 04:58:50,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:58:50,546 INFO L158 Benchmark]: Toolchain (without parser) took 10934.22ms. Allocated memory was 396.4MB in the beginning and 1.0GB in the end (delta: 616.6MB). Free memory was 341.7MB in the beginning and 807.3MB in the end (delta: -465.6MB). Peak memory consumption was 151.2MB. Max. memory is 16.0GB. [2022-01-19 04:58:50,546 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 396.4MB. Free memory is still 360.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:58:50,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.77ms. Allocated memory was 396.4MB in the beginning and 482.3MB in the end (delta: 86.0MB). Free memory was 341.6MB in the beginning and 443.8MB in the end (delta: -102.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-19 04:58:50,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.17ms. Allocated memory is still 482.3MB. Free memory was 443.8MB in the beginning and 440.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:58:50,547 INFO L158 Benchmark]: Boogie Preprocessor took 22.77ms. Allocated memory is still 482.3MB. Free memory was 440.7MB in the beginning and 438.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:58:50,547 INFO L158 Benchmark]: RCFGBuilder took 784.95ms. Allocated memory is still 482.3MB. Free memory was 438.6MB in the beginning and 359.9MB in the end (delta: 78.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2022-01-19 04:58:50,547 INFO L158 Benchmark]: TraceAbstraction took 9627.00ms. Allocated memory was 482.3MB in the beginning and 1.0GB in the end (delta: 530.6MB). Free memory was 358.9MB in the beginning and 807.3MB in the end (delta: -448.4MB). Peak memory consumption was 82.1MB. Max. memory is 16.0GB. [2022-01-19 04:58:50,548 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 396.4MB. Free memory is still 360.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 455.77ms. Allocated memory was 396.4MB in the beginning and 482.3MB in the end (delta: 86.0MB). Free memory was 341.6MB in the beginning and 443.8MB in the end (delta: -102.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.17ms. Allocated memory is still 482.3MB. Free memory was 443.8MB in the beginning and 440.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.77ms. Allocated memory is still 482.3MB. Free memory was 440.7MB in the beginning and 438.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 784.95ms. Allocated memory is still 482.3MB. Free memory was 438.6MB in the beginning and 359.9MB in the end (delta: 78.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9627.00ms. Allocated memory was 482.3MB in the beginning and 1.0GB in the end (delta: 530.6MB). Free memory was 358.9MB in the beginning and 807.3MB in the end (delta: -448.4MB). Peak memory consumption was 82.1MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] 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) [L829] 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) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 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 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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: 823]: 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: 821]: 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: 819]: 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 7 procedures, 141 locations, 6 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: 9.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 655 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1083 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1998 IncrementalHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 128 mSDtfsCounter, 1998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=910occurred in iteration=12, InterpolantAutomatonStates: 179, 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.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 6915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 04:58:50,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...