/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:01:02,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:01:02,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:01:02,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:01:02,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:01:02,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:01:02,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:01:02,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:01:02,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:01:02,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:01:02,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:01:02,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:01:02,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:01:02,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:01:02,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:01:02,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:01:02,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:01:02,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:01:02,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:01:02,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:01:02,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:01:02,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:01:02,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:01:02,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:01:02,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:01:02,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:01:02,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:01:02,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:01:02,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:01:02,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:01:02,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:01:02,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:01:02,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:01:02,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:01:02,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:01:02,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:01:02,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:01:02,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:01:02,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:01:02,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:01:02,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:01:02,556 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-RepeatedVariableLbe.epf [2021-03-25 05:01:02,590 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:01:02,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:01:02,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:01:02,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:01:02,594 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:01:02,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:01:02,594 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:01:02,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:01:02,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:01:02,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:01:02,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:01:02,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:01:02,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:01:02,596 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:01:02,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:01:02,596 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:01:02,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:01:02,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:01:02,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:01:02,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:01:02,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:01:02,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:01:02,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:01:02,598 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-25 05:01:02,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:01:02,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:01:02,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:01:02,945 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:01:02,946 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:01:02,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-03-25 05:01:02,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e566c2257/56f8d0cc903a42c695079f8c243f27cc/FLAG6d2e77914 [2021-03-25 05:01:03,500 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:01:03,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-03-25 05:01:03,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e566c2257/56f8d0cc903a42c695079f8c243f27cc/FLAG6d2e77914 [2021-03-25 05:01:04,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e566c2257/56f8d0cc903a42c695079f8c243f27cc [2021-03-25 05:01:04,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:01:04,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:01:04,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:01:04,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:01:04,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:01:04,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ccd56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04, skipping insertion in model container [2021-03-25 05:01:04,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:01:04,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:01:04,233 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i[952,965] [2021-03-25 05:01:04,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:01:04,481 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:01:04,493 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i[952,965] [2021-03-25 05:01:04,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:01:04,627 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:01:04,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04 WrapperNode [2021-03-25 05:01:04,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:01:04,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:01:04,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:01:04,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:01:04,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:01:04,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:01:04,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:01:04,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:01:04,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... [2021-03-25 05:01:04,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:01:04,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:01:04,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:01:04,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:01:04,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:01:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:01:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:01:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:01:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:01:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:01:04,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:01:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:01:04,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:01:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:01:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:01:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:01:04,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:01:04,841 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 05:01:06,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:01:06,267 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 05:01:06,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:01:06 BoogieIcfgContainer [2021-03-25 05:01:06,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:01:06,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:01:06,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:01:06,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:01:06,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:01:04" (1/3) ... [2021-03-25 05:01:06,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b7e044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:01:06, skipping insertion in model container [2021-03-25 05:01:06,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:01:04" (2/3) ... [2021-03-25 05:01:06,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b7e044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:01:06, skipping insertion in model container [2021-03-25 05:01:06,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:01:06" (3/3) ... [2021-03-25 05:01:06,275 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2021-03-25 05:01:06,281 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:01:06,285 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 05:01:06,285 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:01:06,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,317 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,318 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:01:06,332 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:01:06,348 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 05:01:06,365 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:01:06,365 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:01:06,365 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:01:06,365 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:01:06,365 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:01:06,365 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:01:06,365 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:01:06,365 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:01:06,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 05:01:06,399 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 05:01:06,400 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:06,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 05:01:06,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 05:01:06,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-25 05:01:06,407 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:06,414 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 05:01:06,416 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 05:01:06,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-25 05:01:06,430 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 05:01:06,430 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:06,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 05:01:06,433 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-25 05:01:07,356 WARN L205 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-25 05:01:07,714 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-25 05:01:09,081 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-25 05:01:09,734 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-25 05:01:10,430 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:01:10,804 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 05:01:10,912 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 05:01:11,826 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 05:01:12,121 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 05:01:12,706 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 05:01:13,356 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 05:01:13,372 INFO L154 LiptonReduction]: Checked pairs total: 1464 [2021-03-25 05:01:13,372 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-25 05:01:13,374 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6968 [2021-03-25 05:01:13,384 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-25 05:01:13,384 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:13,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:13,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:13,385 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1967679308, now seen corresponding path program 1 times [2021-03-25 05:01:13,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:13,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202910078] [2021-03-25 05:01:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:13,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:13,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:01:13,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:13,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:13,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202910078] [2021-03-25 05:01:13,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:13,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:01:13,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33789216] [2021-03-25 05:01:13,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:01:13,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:01:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:01:13,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-03-25 05:01:13,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:13,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:13,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-03-25 05:01:13,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:13,712 INFO L129 PetriNetUnfolder]: 23/92 cut-off events. [2021-03-25 05:01:13,712 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:13,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 92 events. 23/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 16 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 133. Up to 37 conditions per place. [2021-03-25 05:01:13,715 INFO L132 encePairwiseOnDemand]: 133/137 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-25 05:01:13,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-25 05:01:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:01:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:01:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-25 05:01:13,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2021-03-25 05:01:13,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-25 05:01:13,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-25 05:01:13,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:13,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-25 05:01:13,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:13,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:13,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:13,753 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 356 transitions. [2021-03-25 05:01:13,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-25 05:01:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:01:13,757 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-25 05:01:13,759 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-25 05:01:13,761 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-25 05:01:13,761 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:13,761 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 05:01:13,762 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 05:01:13,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-25 05:01:13,769 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 05:01:13,769 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:13,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 05:01:13,770 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 05:01:14,391 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 05:01:14,672 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 05:01:15,261 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 05:01:15,811 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 05:01:15,936 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-25 05:01:15,936 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 05:01:15,937 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2176 [2021-03-25 05:01:15,938 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-25 05:01:15,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:15,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:15,939 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:15,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:01:15,939 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 434742666, now seen corresponding path program 1 times [2021-03-25 05:01:15,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:15,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881183169] [2021-03-25 05:01:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:16,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:16,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:01:16,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:16,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:16,079 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 05:01:16,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:01:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:16,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881183169] [2021-03-25 05:01:16,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:16,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:01:16,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849015908] [2021-03-25 05:01:16,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:01:16,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:01:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:01:16,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 142 [2021-03-25 05:01:16,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:16,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:16,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 142 [2021-03-25 05:01:16,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:16,101 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 05:01:16,101 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:16,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:01:16,102 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 1 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2021-03-25 05:01:16,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 48 flow [2021-03-25 05:01:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:01:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:01:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2021-03-25 05:01:16,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8474178403755869 [2021-03-25 05:01:16,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2021-03-25 05:01:16,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2021-03-25 05:01:16,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:16,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2021-03-25 05:01:16,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:16,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:16,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:16,108 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 361 transitions. [2021-03-25 05:01:16,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 48 flow [2021-03-25 05:01:16,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 44 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:01:16,110 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 46 flow [2021-03-25 05:01:16,110 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2021-03-25 05:01:16,111 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 05:01:16,111 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:16,111 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 05:01:16,111 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 05:01:16,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2021-03-25 05:01:16,115 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 05:01:16,115 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:01:16,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:01:16,115 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-25 05:01:16,686 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 05:01:16,812 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 05:01:17,021 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 05:01:17,146 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 05:01:17,148 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-25 05:01:17,148 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:01:17,148 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1037 [2021-03-25 05:01:17,149 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-25 05:01:17,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:17,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:17,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:01:17,149 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 942494911, now seen corresponding path program 1 times [2021-03-25 05:01:17,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:17,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500437419] [2021-03-25 05:01:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:17,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:01:17,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:01:17,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:01:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:17,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500437419] [2021-03-25 05:01:17,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:17,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:01:17,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204464723] [2021-03-25 05:01:17,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:01:17,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:01:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:01:17,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2021-03-25 05:01:17,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:17,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2021-03-25 05:01:17,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:17,236 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 05:01:17,236 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-25 05:01:17,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 05:01:17,237 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2021-03-25 05:01:17,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2021-03-25 05:01:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:01:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:01:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2021-03-25 05:01:17,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2021-03-25 05:01:17,239 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2021-03-25 05:01:17,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2021-03-25 05:01:17,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:17,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2021-03-25 05:01:17,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,243 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,243 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 475 transitions. [2021-03-25 05:01:17,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2021-03-25 05:01:17,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:01:17,244 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2021-03-25 05:01:17,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2021-03-25 05:01:17,244 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -9 predicate places. [2021-03-25 05:01:17,244 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:17,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 05:01:17,245 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 05:01:17,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2021-03-25 05:01:17,248 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 05:01:17,248 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 05:01:17,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:01:17,248 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 05:01:17,351 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-25 05:01:17,352 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:01:17,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-25 05:01:17,353 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow [2021-03-25 05:01:17,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:17,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:17,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:01:17,353 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:17,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:17,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1529641860, now seen corresponding path program 1 times [2021-03-25 05:01:17,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:17,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136868000] [2021-03-25 05:01:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:17,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:01:17,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 05:01:17,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 05:01:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:17,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136868000] [2021-03-25 05:01:17,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:17,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:01:17,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919575697] [2021-03-25 05:01:17,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:01:17,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:17,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:01:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:01:17,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2021-03-25 05:01:17,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:17,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2021-03-25 05:01:17,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:17,544 INFO L129 PetriNetUnfolder]: 19/51 cut-off events. [2021-03-25 05:01:17,544 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-03-25 05:01:17,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 51 events. 19/51 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 5 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 119. Up to 36 conditions per place. [2021-03-25 05:01:17,545 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 8 selfloop transitions, 7 changer transitions 0/22 dead transitions. [2021-03-25 05:01:17,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 100 flow [2021-03-25 05:01:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:01:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:01:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2021-03-25 05:01:17,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7406896551724138 [2021-03-25 05:01:17,548 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2021-03-25 05:01:17,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2021-03-25 05:01:17,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:17,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2021-03-25 05:01:17,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,552 INFO L185 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 5 states and 537 transitions. [2021-03-25 05:01:17,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 100 flow [2021-03-25 05:01:17,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 85 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 05:01:17,553 INFO L241 Difference]: Finished difference. Result has 28 places, 20 transitions, 88 flow [2021-03-25 05:01:17,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2021-03-25 05:01:17,553 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -7 predicate places. [2021-03-25 05:01:17,553 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:17,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 88 flow [2021-03-25 05:01:17,554 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 20 transitions, 88 flow [2021-03-25 05:01:17,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 20 transitions, 88 flow [2021-03-25 05:01:17,560 INFO L129 PetriNetUnfolder]: 6/38 cut-off events. [2021-03-25 05:01:17,561 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-25 05:01:17,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 38 events. 6/38 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 102 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 84. Up to 13 conditions per place. [2021-03-25 05:01:17,561 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-25 05:01:17,589 INFO L154 LiptonReduction]: Checked pairs total: 101 [2021-03-25 05:01:17,589 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:01:17,589 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-25 05:01:17,591 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 90 flow [2021-03-25 05:01:17,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:17,592 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:17,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:01:17,593 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 204271417, now seen corresponding path program 1 times [2021-03-25 05:01:17,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:17,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646502354] [2021-03-25 05:01:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:17,697 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 05:01:17,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 05:01:17,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:01:17,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:01:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:17,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646502354] [2021-03-25 05:01:17,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:17,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:01:17,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414462915] [2021-03-25 05:01:17,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:01:17,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:01:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:01:17,734 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 146 [2021-03-25 05:01:17,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:17,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 146 [2021-03-25 05:01:17,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:17,819 INFO L129 PetriNetUnfolder]: 17/51 cut-off events. [2021-03-25 05:01:17,819 INFO L130 PetriNetUnfolder]: For 52/58 co-relation queries the response was YES. [2021-03-25 05:01:17,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 51 events. 17/51 cut-off events. For 52/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 4 based on Foata normal form. 7/58 useless extension candidates. Maximal degree in co-relation 151. Up to 34 conditions per place. [2021-03-25 05:01:17,821 INFO L132 encePairwiseOnDemand]: 140/146 looper letters, 9 selfloop transitions, 7 changer transitions 0/23 dead transitions. [2021-03-25 05:01:17,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 134 flow [2021-03-25 05:01:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:01:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:01:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2021-03-25 05:01:17,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7482876712328768 [2021-03-25 05:01:17,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2021-03-25 05:01:17,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2021-03-25 05:01:17,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:17,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2021-03-25 05:01:17,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,826 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,826 INFO L185 Difference]: Start difference. First operand has 28 places, 20 transitions, 90 flow. Second operand 4 states and 437 transitions. [2021-03-25 05:01:17,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 134 flow [2021-03-25 05:01:17,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 05:01:17,828 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 124 flow [2021-03-25 05:01:17,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-03-25 05:01:17,828 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-03-25 05:01:17,828 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:17,828 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 124 flow [2021-03-25 05:01:17,829 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 124 flow [2021-03-25 05:01:17,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 124 flow [2021-03-25 05:01:17,838 INFO L129 PetriNetUnfolder]: 12/46 cut-off events. [2021-03-25 05:01:17,839 INFO L130 PetriNetUnfolder]: For 71/76 co-relation queries the response was YES. [2021-03-25 05:01:17,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 46 events. 12/46 cut-off events. For 71/76 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 119 event pairs, 1 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 132. Up to 21 conditions per place. [2021-03-25 05:01:17,842 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 05:01:17,866 INFO L154 LiptonReduction]: Checked pairs total: 87 [2021-03-25 05:01:17,866 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:01:17,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 05:01:17,867 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 126 flow [2021-03-25 05:01:17,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:17,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:17,868 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:17,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:01:17,869 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash -883214811, now seen corresponding path program 1 times [2021-03-25 05:01:17,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:17,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734868827] [2021-03-25 05:01:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:17,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:17,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:01:17,975 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-03-25 05:01:17,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 05:01:17,995 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.2 percent of original size [2021-03-25 05:01:17,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 05:01:18,026 INFO L142 QuantifierPusher]: treesize reduction 37, result has 51.3 percent of original size [2021-03-25 05:01:18,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:01:18,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:01:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:18,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734868827] [2021-03-25 05:01:18,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:18,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:01:18,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048127119] [2021-03-25 05:01:18,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:01:18,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:01:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:01:18,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 147 [2021-03-25 05:01:18,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:18,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 147 [2021-03-25 05:01:18,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:18,211 INFO L129 PetriNetUnfolder]: 72/145 cut-off events. [2021-03-25 05:01:18,212 INFO L130 PetriNetUnfolder]: For 212/217 co-relation queries the response was YES. [2021-03-25 05:01:18,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 145 events. 72/145 cut-off events. For 212/217 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 5 based on Foata normal form. 14/159 useless extension candidates. Maximal degree in co-relation 471. Up to 105 conditions per place. [2021-03-25 05:01:18,217 INFO L132 encePairwiseOnDemand]: 138/147 looper letters, 19 selfloop transitions, 14 changer transitions 8/45 dead transitions. [2021-03-25 05:01:18,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 319 flow [2021-03-25 05:01:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:01:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:01:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 609 transitions. [2021-03-25 05:01:18,219 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2021-03-25 05:01:18,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 609 transitions. [2021-03-25 05:01:18,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 609 transitions. [2021-03-25 05:01:18,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:18,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 609 transitions. [2021-03-25 05:01:18,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,222 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,222 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 126 flow. Second operand 7 states and 609 transitions. [2021-03-25 05:01:18,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 319 flow [2021-03-25 05:01:18,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 295 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-25 05:01:18,226 INFO L241 Difference]: Finished difference. Result has 40 places, 32 transitions, 236 flow [2021-03-25 05:01:18,226 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2021-03-25 05:01:18,226 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-03-25 05:01:18,226 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:18,226 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 236 flow [2021-03-25 05:01:18,226 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 236 flow [2021-03-25 05:01:18,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 236 flow [2021-03-25 05:01:18,238 INFO L129 PetriNetUnfolder]: 35/83 cut-off events. [2021-03-25 05:01:18,239 INFO L130 PetriNetUnfolder]: For 164/174 co-relation queries the response was YES. [2021-03-25 05:01:18,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 83 events. 35/83 cut-off events. For 164/174 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 288 event pairs, 7 based on Foata normal form. 4/83 useless extension candidates. Maximal degree in co-relation 308. Up to 33 conditions per place. [2021-03-25 05:01:18,240 INFO L142 LiptonReduction]: Number of co-enabled transitions 66 [2021-03-25 05:01:18,242 INFO L154 LiptonReduction]: Checked pairs total: 38 [2021-03-25 05:01:18,242 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:01:18,242 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 05:01:18,245 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 236 flow [2021-03-25 05:01:18,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:18,246 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:18,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:01:18,246 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 204273432, now seen corresponding path program 1 times [2021-03-25 05:01:18,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:18,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80377742] [2021-03-25 05:01:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:18,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:18,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:18,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:01:18,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:01:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:18,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80377742] [2021-03-25 05:01:18,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:18,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:01:18,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700831025] [2021-03-25 05:01:18,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:01:18,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:01:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:01:18,300 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2021-03-25 05:01:18,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:18,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2021-03-25 05:01:18,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:18,343 INFO L129 PetriNetUnfolder]: 42/100 cut-off events. [2021-03-25 05:01:18,344 INFO L130 PetriNetUnfolder]: For 278/296 co-relation queries the response was YES. [2021-03-25 05:01:18,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 100 events. 42/100 cut-off events. For 278/296 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 352 event pairs, 7 based on Foata normal form. 6/103 useless extension candidates. Maximal degree in co-relation 430. Up to 52 conditions per place. [2021-03-25 05:01:18,345 INFO L132 encePairwiseOnDemand]: 140/147 looper letters, 14 selfloop transitions, 12 changer transitions 0/34 dead transitions. [2021-03-25 05:01:18,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 300 flow [2021-03-25 05:01:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:01:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:01:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2021-03-25 05:01:18,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7908163265306123 [2021-03-25 05:01:18,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2021-03-25 05:01:18,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2021-03-25 05:01:18,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:18,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2021-03-25 05:01:18,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,350 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 236 flow. Second operand 4 states and 465 transitions. [2021-03-25 05:01:18,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 300 flow [2021-03-25 05:01:18,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 289 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-25 05:01:18,352 INFO L241 Difference]: Finished difference. Result has 40 places, 32 transitions, 263 flow [2021-03-25 05:01:18,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2021-03-25 05:01:18,353 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-03-25 05:01:18,353 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:18,353 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 263 flow [2021-03-25 05:01:18,353 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 263 flow [2021-03-25 05:01:18,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 263 flow [2021-03-25 05:01:18,363 INFO L129 PetriNetUnfolder]: 31/84 cut-off events. [2021-03-25 05:01:18,363 INFO L130 PetriNetUnfolder]: For 226/236 co-relation queries the response was YES. [2021-03-25 05:01:18,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 84 events. 31/84 cut-off events. For 226/236 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 328 event pairs, 8 based on Foata normal form. 5/85 useless extension candidates. Maximal degree in co-relation 341. Up to 35 conditions per place. [2021-03-25 05:01:18,365 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-25 05:01:18,367 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-25 05:01:18,367 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:01:18,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-25 05:01:18,368 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 263 flow [2021-03-25 05:01:18,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:18,368 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:18,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:01:18,368 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash 422239723, now seen corresponding path program 2 times [2021-03-25 05:01:18,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:18,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477857463] [2021-03-25 05:01:18,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:18,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:18,431 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:01:18,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:01:18,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:18,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:01:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:18,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477857463] [2021-03-25 05:01:18,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:18,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:01:18,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546989278] [2021-03-25 05:01:18,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:01:18,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:18,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:01:18,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:01:18,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 147 [2021-03-25 05:01:18,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:18,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 147 [2021-03-25 05:01:18,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:18,473 INFO L129 PetriNetUnfolder]: 27/76 cut-off events. [2021-03-25 05:01:18,473 INFO L130 PetriNetUnfolder]: For 276/288 co-relation queries the response was YES. [2021-03-25 05:01:18,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 76 events. 27/76 cut-off events. For 276/288 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 269 event pairs, 9 based on Foata normal form. 17/88 useless extension candidates. Maximal degree in co-relation 312. Up to 31 conditions per place. [2021-03-25 05:01:18,476 INFO L132 encePairwiseOnDemand]: 142/147 looper letters, 4 selfloop transitions, 5 changer transitions 5/30 dead transitions. [2021-03-25 05:01:18,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 232 flow [2021-03-25 05:01:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:01:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:01:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2021-03-25 05:01:18,478 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8081632653061225 [2021-03-25 05:01:18,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2021-03-25 05:01:18,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2021-03-25 05:01:18,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:18,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2021-03-25 05:01:18,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,481 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:18,481 INFO L185 Difference]: Start difference. First operand has 40 places, 32 transitions, 263 flow. Second operand 5 states and 594 transitions. [2021-03-25 05:01:18,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 232 flow [2021-03-25 05:01:18,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 208 flow, removed 2 selfloop flow, removed 6 redundant places. [2021-03-25 05:01:18,484 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 189 flow [2021-03-25 05:01:18,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2021-03-25 05:01:18,484 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2021-03-25 05:01:18,484 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:18,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 189 flow [2021-03-25 05:01:18,484 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 189 flow [2021-03-25 05:01:18,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 189 flow [2021-03-25 05:01:18,495 INFO L129 PetriNetUnfolder]: 20/61 cut-off events. [2021-03-25 05:01:18,495 INFO L130 PetriNetUnfolder]: For 187/197 co-relation queries the response was YES. [2021-03-25 05:01:18,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 61 events. 20/61 cut-off events. For 187/197 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 9 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 263. Up to 24 conditions per place. [2021-03-25 05:01:18,496 INFO L142 LiptonReduction]: Number of co-enabled transitions 50 [2021-03-25 05:01:18,649 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 05:01:19,041 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-25 05:01:19,154 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 05:01:19,156 INFO L154 LiptonReduction]: Checked pairs total: 1 [2021-03-25 05:01:19,156 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:01:19,157 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 673 [2021-03-25 05:01:19,157 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 193 flow [2021-03-25 05:01:19,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:19,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:19,157 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:19,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 05:01:19,158 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1275136237, now seen corresponding path program 1 times [2021-03-25 05:01:19,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:19,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26907163] [2021-03-25 05:01:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:19,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:19,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:01:19,289 INFO L142 QuantifierPusher]: treesize reduction 10, result has 77.3 percent of original size [2021-03-25 05:01:19,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 05:01:19,322 INFO L142 QuantifierPusher]: treesize reduction 21, result has 70.8 percent of original size [2021-03-25 05:01:19,323 INFO L147 QuantifierPusher]: treesize reduction 8, result has 84.3 percent of original size 43 [2021-03-25 05:01:19,362 INFO L142 QuantifierPusher]: treesize reduction 21, result has 72.0 percent of original size [2021-03-25 05:01:19,367 INFO L147 QuantifierPusher]: treesize reduction 8, result has 85.2 percent of original size 46 [2021-03-25 05:01:19,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:19,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 05:01:19,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:19,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:01:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:19,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26907163] [2021-03-25 05:01:19,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:19,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 05:01:19,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684147646] [2021-03-25 05:01:19,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 05:01:19,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 05:01:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 05:01:19,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 148 [2021-03-25 05:01:19,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:19,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:19,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 148 [2021-03-25 05:01:19,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:19,556 INFO L129 PetriNetUnfolder]: 20/75 cut-off events. [2021-03-25 05:01:19,556 INFO L130 PetriNetUnfolder]: For 314/329 co-relation queries the response was YES. [2021-03-25 05:01:19,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 75 events. 20/75 cut-off events. For 314/329 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 265 event pairs, 5 based on Foata normal form. 11/84 useless extension candidates. Maximal degree in co-relation 363. Up to 30 conditions per place. [2021-03-25 05:01:19,557 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 8 selfloop transitions, 6 changer transitions 3/27 dead transitions. [2021-03-25 05:01:19,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 27 transitions, 249 flow [2021-03-25 05:01:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:01:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:01:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2021-03-25 05:01:19,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6779279279279279 [2021-03-25 05:01:19,562 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 602 transitions. [2021-03-25 05:01:19,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 602 transitions. [2021-03-25 05:01:19,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:19,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 602 transitions. [2021-03-25 05:01:19,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:19,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:19,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:19,566 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 193 flow. Second operand 6 states and 602 transitions. [2021-03-25 05:01:19,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 27 transitions, 249 flow [2021-03-25 05:01:19,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 27 transitions, 229 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-25 05:01:19,568 INFO L241 Difference]: Finished difference. Result has 45 places, 23 transitions, 183 flow [2021-03-25 05:01:19,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=45, PETRI_TRANSITIONS=23} [2021-03-25 05:01:19,568 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2021-03-25 05:01:19,569 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:19,569 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 23 transitions, 183 flow [2021-03-25 05:01:19,569 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 23 transitions, 183 flow [2021-03-25 05:01:19,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 23 transitions, 183 flow [2021-03-25 05:01:19,578 INFO L129 PetriNetUnfolder]: 13/55 cut-off events. [2021-03-25 05:01:19,578 INFO L130 PetriNetUnfolder]: For 198/199 co-relation queries the response was YES. [2021-03-25 05:01:19,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 55 events. 13/55 cut-off events. For 198/199 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 173 event pairs, 7 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 235. Up to 22 conditions per place. [2021-03-25 05:01:19,579 INFO L142 LiptonReduction]: Number of co-enabled transitions 36 [2021-03-25 05:01:19,709 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-25 05:01:19,934 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-25 05:01:19,989 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-25 05:01:19,990 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:01:19,990 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 421 [2021-03-25 05:01:19,990 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 187 flow [2021-03-25 05:01:19,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:19,991 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:19,991 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:19,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 05:01:19,991 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1540542662, now seen corresponding path program 1 times [2021-03-25 05:01:19,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:19,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616028415] [2021-03-25 05:01:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:01:20,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:20,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:20,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:20,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:01:20,035 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:01:20,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:01:20,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:01:20,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:01:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:01:20,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616028415] [2021-03-25 05:01:20,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:01:20,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:01:20,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232785406] [2021-03-25 05:01:20,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:01:20,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:01:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:01:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:01:20,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 149 [2021-03-25 05:01:20,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:20,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:01:20,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 149 [2021-03-25 05:01:20,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:01:20,075 INFO L129 PetriNetUnfolder]: 5/37 cut-off events. [2021-03-25 05:01:20,075 INFO L130 PetriNetUnfolder]: For 161/167 co-relation queries the response was YES. [2021-03-25 05:01:20,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 37 events. 5/37 cut-off events. For 161/167 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 1 based on Foata normal form. 9/45 useless extension candidates. Maximal degree in co-relation 161. Up to 18 conditions per place. [2021-03-25 05:01:20,076 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 2 selfloop transitions, 7 changer transitions 6/26 dead transitions. [2021-03-25 05:01:20,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 26 transitions, 231 flow [2021-03-25 05:01:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:01:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:01:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2021-03-25 05:01:20,078 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8053691275167785 [2021-03-25 05:01:20,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2021-03-25 05:01:20,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2021-03-25 05:01:20,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:01:20,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2021-03-25 05:01:20,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:20,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:20,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 149.0) internal successors, (1043), 7 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:20,083 INFO L185 Difference]: Start difference. First operand has 44 places, 23 transitions, 187 flow. Second operand 6 states and 720 transitions. [2021-03-25 05:01:20,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 26 transitions, 231 flow [2021-03-25 05:01:20,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 26 transitions, 178 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-03-25 05:01:20,088 INFO L241 Difference]: Finished difference. Result has 45 places, 20 transitions, 146 flow [2021-03-25 05:01:20,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=20} [2021-03-25 05:01:20,091 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2021-03-25 05:01:20,091 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:01:20,091 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 20 transitions, 146 flow [2021-03-25 05:01:20,091 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 20 transitions, 146 flow [2021-03-25 05:01:20,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 20 transitions, 146 flow [2021-03-25 05:01:20,095 INFO L129 PetriNetUnfolder]: 3/22 cut-off events. [2021-03-25 05:01:20,095 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-03-25 05:01:20,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 22 events. 3/22 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 85. Up to 10 conditions per place. [2021-03-25 05:01:20,096 INFO L142 LiptonReduction]: Number of co-enabled transitions 10 [2021-03-25 05:01:20,248 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 05:01:20,595 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2021-03-25 05:01:20,725 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-25 05:01:20,994 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 05:01:21,104 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 05:01:21,687 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 189 [2021-03-25 05:01:21,887 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 05:01:23,127 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 344 DAG size of output: 265 [2021-03-25 05:01:23,577 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-25 05:01:23,580 INFO L154 LiptonReduction]: Checked pairs total: 2 [2021-03-25 05:01:23,580 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 05:01:23,580 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3489 [2021-03-25 05:01:23,580 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 17 transitions, 138 flow [2021-03-25 05:01:23,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:01:23,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:01:23,581 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:01:23,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 05:01:23,581 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:01:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:01:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -932845871, now seen corresponding path program 1 times [2021-03-25 05:01:23,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:01:23,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508425990] [2021-03-25 05:01:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:01:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:01:23,610 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:01:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:01:23,637 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:01:23,667 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:01:23,668 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:01:23,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 05:01:23,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:01:23 BasicIcfg [2021-03-25 05:01:23,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:01:23,739 INFO L168 Benchmark]: Toolchain (without parser) took 19714.83 ms. Allocated memory was 255.9 MB in the beginning and 595.6 MB in the end (delta: 339.7 MB). Free memory was 232.6 MB in the beginning and 363.6 MB in the end (delta: -131.0 MB). Peak memory consumption was 208.5 MB. Max. memory is 16.0 GB. [2021-03-25 05:01:23,739 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:01:23,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.96 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 232.6 MB in the beginning and 303.2 MB in the end (delta: -70.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-25 05:01:23,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.30 ms. Allocated memory is still 341.8 MB. Free memory was 302.5 MB in the beginning and 300.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:01:23,740 INFO L168 Benchmark]: Boogie Preprocessor took 54.45 ms. Allocated memory is still 341.8 MB. Free memory was 300.4 MB in the beginning and 298.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:01:23,740 INFO L168 Benchmark]: RCFGBuilder took 1509.70 ms. Allocated memory is still 341.8 MB. Free memory was 298.3 MB in the beginning and 315.9 MB in the end (delta: -17.6 MB). Peak memory consumption was 67.7 MB. Max. memory is 16.0 GB. [2021-03-25 05:01:23,741 INFO L168 Benchmark]: TraceAbstraction took 17467.29 ms. Allocated memory was 341.8 MB in the beginning and 595.6 MB in the end (delta: 253.8 MB). Free memory was 315.9 MB in the beginning and 363.6 MB in the end (delta: -47.8 MB). Peak memory consumption was 207.0 MB. Max. memory is 16.0 GB. [2021-03-25 05:01:23,749 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.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 601.96 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 232.6 MB in the beginning and 303.2 MB in the end (delta: -70.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.30 ms. Allocated memory is still 341.8 MB. Free memory was 302.5 MB in the beginning and 300.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 54.45 ms. Allocated memory is still 341.8 MB. Free memory was 300.4 MB in the beginning and 298.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1509.70 ms. Allocated memory is still 341.8 MB. Free memory was 298.3 MB in the beginning and 315.9 MB in the end (delta: -17.6 MB). Peak memory consumption was 67.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17467.29 ms. Allocated memory was 341.8 MB in the beginning and 595.6 MB in the end (delta: 253.8 MB). Free memory was 315.9 MB in the beginning and 363.6 MB in the end (delta: -47.8 MB). Peak memory consumption was 207.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6956.2ms, 83 PlacesBefore, 35 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 756, positive: 709, positive conditional: 0, positive unconditional: 709, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 454, positive: 440, positive conditional: 0, positive unconditional: 440, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 454, positive: 440, positive conditional: 0, positive unconditional: 440, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 756, positive: 269, positive conditional: 0, positive unconditional: 269, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 454, unknown conditional: 0, unknown unconditional: 454] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2174.2ms, 33 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 143, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1036.7ms, 25 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 119, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.9ms, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.5ms, 28 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 101 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 40, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.9ms, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 87 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.7ms, 40 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 38 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 22, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 672.1ms, 41 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 420.7ms, 45 PlacesBefore, 44 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3488.4ms, 45 PlacesBefore, 39 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 2 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x [L767] 2 y = 1 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17307.3ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 803.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7015.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 41 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 228 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 278.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 356.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 30.2ms SsaConstructionTime, 378.9ms SatisfiabilityAnalysisTime, 818.2ms InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...