/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:40:41,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:40:41,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:40:41,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:40:41,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:40:41,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:40:41,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:40:41,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:40:41,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:40:41,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:40:41,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:40:41,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:40:41,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:40:41,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:40:41,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:40:41,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:40:41,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:40:41,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:40:41,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:40:41,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:40:41,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:40:41,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:40:41,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:40:41,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:40:41,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:40:41,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:40:41,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:40:41,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:40:41,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:40:41,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:40:41,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:40:41,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:40:41,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:40:41,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:40:41,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:40:41,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:40:41,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:40:41,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:40:41,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:40:41,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:40:41,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:40:41,764 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:40:41,799 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:40:41,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:40:41,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:40:41,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:40:41,801 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:40:41,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:40:41,801 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:40:41,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:40:41,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:40:41,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:40:41,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:40:41,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:40:41,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:40:41,803 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:40:41,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:40:41,803 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:40:41,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:40:41,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:40:41,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:40:41,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:40:41,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:40:41,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:40:41,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:40:41,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:40:41,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:40:41,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:40:41,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:40:41,805 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:40:41,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:40:41,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:40:41,805 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-26 10:40:42,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:40:42,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:40:42,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:40:42,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:40:42,132 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:40:42,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-03-26 10:40:42,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43c141a7/38e42678831f4813a2adb119ec33c687/FLAG8839a35d9 [2021-03-26 10:40:42,986 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:40:42,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-03-26 10:40:43,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43c141a7/38e42678831f4813a2adb119ec33c687/FLAG8839a35d9 [2021-03-26 10:40:43,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43c141a7/38e42678831f4813a2adb119ec33c687 [2021-03-26 10:40:43,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:40:43,204 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:40:43,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:40:43,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:40:43,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:40:43,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f74799a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43, skipping insertion in model container [2021-03-26 10:40:43,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:40:43,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:40:43,385 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/safe029_power.opt.i[951,964] [2021-03-26 10:40:43,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:40:43,622 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:40:43,633 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/safe029_power.opt.i[951,964] [2021-03-26 10:40:43,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:40:43,766 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:40:43,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43 WrapperNode [2021-03-26 10:40:43,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:40:43,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:40:43,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:40:43,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:40:43,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:40:43,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:40:43,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:40:43,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:40:43,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (1/1) ... [2021-03-26 10:40:43,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:40:43,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:40:43,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:40:43,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:40:43,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (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-26 10:40:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:40:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:40:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:40:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:40:43,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:40:43,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:40:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:40:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:40:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:40:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:40:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:40:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:40:43,955 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:40:45,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:40:45,905 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:40:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:40:45 BoogieIcfgContainer [2021-03-26 10:40:45,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:40:45,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:40:45,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:40:45,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:40:45,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:40:43" (1/3) ... [2021-03-26 10:40:45,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a58227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:40:45, skipping insertion in model container [2021-03-26 10:40:45,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:43" (2/3) ... [2021-03-26 10:40:45,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a58227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:40:45, skipping insertion in model container [2021-03-26 10:40:45,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:40:45" (3/3) ... [2021-03-26 10:40:45,914 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2021-03-26 10:40:45,921 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:40:45,925 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:40:45,925 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:40:45,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,969 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,970 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:45,985 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:40:46,001 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:40:46,031 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:40:46,031 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:40:46,031 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:40:46,032 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:40:46,032 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:40:46,032 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:40:46,032 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:40:46,032 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:40:46,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 10:40:46,069 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 10:40:46,069 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:46,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:40:46,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 10:40:46,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:46,077 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:46,089 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:46,091 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:46,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:46,106 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 10:40:46,106 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:46,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:40:46,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 10:40:47,408 WARN L205 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 10:40:47,711 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 10:40:49,062 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 10:40:49,686 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 10:40:50,308 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:40:50,705 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:40:50,837 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:40:52,103 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 10:40:52,448 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 10:40:53,019 WARN L205 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:40:53,656 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:40:53,969 INFO L154 LiptonReduction]: Checked pairs total: 1657 [2021-03-26 10:40:53,970 INFO L156 LiptonReduction]: Total number of compositions: 53 [2021-03-26 10:40:53,972 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7896 [2021-03-26 10:40:53,980 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 10:40:53,980 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:53,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:53,981 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:53,981 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1463710772, now seen corresponding path program 1 times [2021-03-26 10:40:53,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:53,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35009585] [2021-03-26 10:40:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:54,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:54,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:54,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:54,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:54,173 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-26 10:40:54,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35009585] [2021-03-26 10:40:54,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:54,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:40:54,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954413541] [2021-03-26 10:40:54,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:40:54,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:40:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:40:54,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2021-03-26 10:40:54,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-26 10:40:54,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:54,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2021-03-26 10:40:54,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:54,291 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 10:40:54,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:54,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 332 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 130. Up to 37 conditions per place. [2021-03-26 10:40:54,293 INFO L132 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-03-26 10:40:54,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 92 flow [2021-03-26 10:40:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:40:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:40:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2021-03-26 10:40:54,304 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2021-03-26 10:40:54,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2021-03-26 10:40:54,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2021-03-26 10:40:54,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:54,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2021-03-26 10:40:54,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-26 10:40:54,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:40:54,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:40:54,328 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 347 transitions. [2021-03-26 10:40:54,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 92 flow [2021-03-26 10:40:54,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:40:54,331 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2021-03-26 10:40:54,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 10:40:54,333 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-26 10:40:54,333 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:54,334 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-26 10:40:54,334 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-26 10:40:54,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2021-03-26 10:40:54,338 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:40:54,338 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:54,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:40:54,339 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:40:54,795 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:40:55,091 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:40:55,783 WARN L205 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:40:56,347 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:40:56,830 INFO L154 LiptonReduction]: Checked pairs total: 448 [2021-03-26 10:40:56,830 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:40:56,830 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2497 [2021-03-26 10:40:56,831 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 10:40:56,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-26 10:40:56,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:56,831 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:56,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:40:56,832 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1396965882, now seen corresponding path program 1 times [2021-03-26 10:40:56,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:56,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31797831] [2021-03-26 10:40:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:57,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:57,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:57,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:57,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:57,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:57,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:40:57,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:57,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:40:57,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:57,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:40:57,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:57,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:40:57,103 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-26 10:40:57,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31797831] [2021-03-26 10:40:57,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:57,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:40:57,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171441211] [2021-03-26 10:40:57,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:40:57,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:57,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:40:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:40:57,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 138 [2021-03-26 10:40:57,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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-26 10:40:57,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:57,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 138 [2021-03-26 10:40:57,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:57,175 INFO L129 PetriNetUnfolder]: 28/77 cut-off events. [2021-03-26 10:40:57,175 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 10:40:57,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 77 events. 28/77 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 267 event pairs, 11 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 137. Up to 52 conditions per place. [2021-03-26 10:40:57,178 INFO L132 encePairwiseOnDemand]: 131/138 looper letters, 7 selfloop transitions, 8 changer transitions 0/25 dead transitions. [2021-03-26 10:40:57,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 90 flow [2021-03-26 10:40:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:40:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:40:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2021-03-26 10:40:57,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2021-03-26 10:40:57,192 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2021-03-26 10:40:57,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2021-03-26 10:40:57,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:57,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2021-03-26 10:40:57,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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-26 10:40:57,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 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-26 10:40:57,198 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 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-26 10:40:57,198 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 4 states and 416 transitions. [2021-03-26 10:40:57,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 90 flow [2021-03-26 10:40:57,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:40:57,199 INFO L241 Difference]: Finished difference. Result has 28 places, 24 transitions, 90 flow [2021-03-26 10:40:57,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2021-03-26 10:40:57,200 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -9 predicate places. [2021-03-26 10:40:57,200 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:57,200 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 90 flow [2021-03-26 10:40:57,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 90 flow [2021-03-26 10:40:57,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 90 flow [2021-03-26 10:40:57,213 INFO L129 PetriNetUnfolder]: 13/51 cut-off events. [2021-03-26 10:40:57,213 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:40:57,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 51 events. 13/51 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 150 event pairs, 4 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 92. Up to 22 conditions per place. [2021-03-26 10:40:57,214 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 10:40:57,772 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 10:40:58,120 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 10:40:58,217 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-26 10:40:58,217 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:40:58,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1017 [2021-03-26 10:40:58,218 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 84 flow [2021-03-26 10:40:58,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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-26 10:40:58,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:58,219 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:58,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:40:58,219 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1389315414, now seen corresponding path program 1 times [2021-03-26 10:40:58,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:58,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997192455] [2021-03-26 10:40:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:58,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:58,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:58,290 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-26 10:40:58,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997192455] [2021-03-26 10:40:58,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:58,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:40:58,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830170371] [2021-03-26 10:40:58,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:40:58,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:40:58,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:40:58,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2021-03-26 10:40:58,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-26 10:40:58,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:58,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2021-03-26 10:40:58,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:58,319 INFO L129 PetriNetUnfolder]: 27/71 cut-off events. [2021-03-26 10:40:58,319 INFO L130 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2021-03-26 10:40:58,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 71 events. 27/71 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 240 event pairs, 7 based on Foata normal form. 3/69 useless extension candidates. Maximal degree in co-relation 164. Up to 35 conditions per place. [2021-03-26 10:40:58,322 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 4 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 10:40:58,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 102 flow [2021-03-26 10:40:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:40:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:40:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2021-03-26 10:40:58,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2021-03-26 10:40:58,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2021-03-26 10:40:58,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2021-03-26 10:40:58,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:58,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2021-03-26 10:40:58,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-26 10:40:58,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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-26 10:40:58,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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-26 10:40:58,328 INFO L185 Difference]: Start difference. First operand has 26 places, 22 transitions, 84 flow. Second operand 3 states and 367 transitions. [2021-03-26 10:40:58,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 102 flow [2021-03-26 10:40:58,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 100 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:40:58,330 INFO L241 Difference]: Finished difference. Result has 29 places, 24 transitions, 103 flow [2021-03-26 10:40:58,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2021-03-26 10:40:58,331 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2021-03-26 10:40:58,331 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:58,331 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 103 flow [2021-03-26 10:40:58,332 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 103 flow [2021-03-26 10:40:58,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 103 flow [2021-03-26 10:40:58,365 INFO L129 PetriNetUnfolder]: 25/71 cut-off events. [2021-03-26 10:40:58,365 INFO L130 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2021-03-26 10:40:58,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 71 events. 25/71 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 242 event pairs, 7 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 160. Up to 32 conditions per place. [2021-03-26 10:40:58,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 10:40:58,369 INFO L154 LiptonReduction]: Checked pairs total: 44 [2021-03-26 10:40:58,369 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:40:58,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 10:40:58,372 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 103 flow [2021-03-26 10:40:58,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-26 10:40:58,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:58,373 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:58,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:40:58,373 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:58,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1125741410, now seen corresponding path program 1 times [2021-03-26 10:40:58,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:58,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856207042] [2021-03-26 10:40:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:58,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:40:58,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:40:58,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:40:58,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:40:58,491 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-26 10:40:58,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856207042] [2021-03-26 10:40:58,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:58,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:40:58,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411234288] [2021-03-26 10:40:58,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:40:58,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:58,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:40:58,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:40:58,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 140 [2021-03-26 10:40:58,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 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-26 10:40:58,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:58,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 140 [2021-03-26 10:40:58,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:58,647 INFO L129 PetriNetUnfolder]: 121/240 cut-off events. [2021-03-26 10:40:58,647 INFO L130 PetriNetUnfolder]: For 199/204 co-relation queries the response was YES. [2021-03-26 10:40:58,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 240 events. 121/240 cut-off events. For 199/204 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1015 event pairs, 8 based on Foata normal form. 15/233 useless extension candidates. Maximal degree in co-relation 631. Up to 147 conditions per place. [2021-03-26 10:40:58,651 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 22 selfloop transitions, 7 changer transitions 2/38 dead transitions. [2021-03-26 10:40:58,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 198 flow [2021-03-26 10:40:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:40:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:40:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2021-03-26 10:40:58,655 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2021-03-26 10:40:58,655 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2021-03-26 10:40:58,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2021-03-26 10:40:58,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:58,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2021-03-26 10:40:58,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 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-26 10:40:58,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 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-26 10:40:58,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 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-26 10:40:58,658 INFO L185 Difference]: Start difference. First operand has 29 places, 24 transitions, 103 flow. Second operand 5 states and 480 transitions. [2021-03-26 10:40:58,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 198 flow [2021-03-26 10:40:58,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:40:58,661 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 128 flow [2021-03-26 10:40:58,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2021-03-26 10:40:58,661 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-03-26 10:40:58,661 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:58,662 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 128 flow [2021-03-26 10:40:58,662 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 128 flow [2021-03-26 10:40:58,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 128 flow [2021-03-26 10:40:58,670 INFO L129 PetriNetUnfolder]: 20/68 cut-off events. [2021-03-26 10:40:58,670 INFO L130 PetriNetUnfolder]: For 89/92 co-relation queries the response was YES. [2021-03-26 10:40:58,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 68 events. 20/68 cut-off events. For 89/92 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 239 event pairs, 6 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 185. Up to 28 conditions per place. [2021-03-26 10:40:58,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 10:40:58,673 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-26 10:40:58,673 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:40:58,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 10:40:58,674 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 128 flow [2021-03-26 10:40:58,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 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-26 10:40:58,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:58,675 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:58,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:40:58,675 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:58,676 INFO L82 PathProgramCache]: Analyzing trace with hash -534694533, now seen corresponding path program 1 times [2021-03-26 10:40:58,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:58,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439486595] [2021-03-26 10:40:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:58,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:58,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:58,764 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-26 10:40:58,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439486595] [2021-03-26 10:40:58,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:58,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:40:58,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140561987] [2021-03-26 10:40:58,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:40:58,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:40:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:40:58,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2021-03-26 10:40:58,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:40:58,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:58,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2021-03-26 10:40:58,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:58,789 INFO L129 PetriNetUnfolder]: 23/88 cut-off events. [2021-03-26 10:40:58,789 INFO L130 PetriNetUnfolder]: For 222/238 co-relation queries the response was YES. [2021-03-26 10:40:58,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 88 events. 23/88 cut-off events. For 222/238 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 368 event pairs, 6 based on Foata normal form. 7/90 useless extension candidates. Maximal degree in co-relation 250. Up to 39 conditions per place. [2021-03-26 10:40:58,790 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-26 10:40:58,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 140 flow [2021-03-26 10:40:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:40:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:40:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2021-03-26 10:40:58,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2021-03-26 10:40:58,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2021-03-26 10:40:58,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2021-03-26 10:40:58,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:58,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2021-03-26 10:40:58,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-26 10:40:58,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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-26 10:40:58,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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-26 10:40:58,796 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 128 flow. Second operand 3 states and 366 transitions. [2021-03-26 10:40:58,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 140 flow [2021-03-26 10:40:58,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 131 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:40:58,799 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 130 flow [2021-03-26 10:40:58,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-26 10:40:58,800 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-26 10:40:58,800 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:58,800 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 130 flow [2021-03-26 10:40:58,800 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 130 flow [2021-03-26 10:40:58,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 130 flow [2021-03-26 10:40:58,812 INFO L129 PetriNetUnfolder]: 25/92 cut-off events. [2021-03-26 10:40:58,812 INFO L130 PetriNetUnfolder]: For 120/126 co-relation queries the response was YES. [2021-03-26 10:40:58,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 92 events. 25/92 cut-off events. For 120/126 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 399 event pairs, 9 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 229. Up to 38 conditions per place. [2021-03-26 10:40:58,813 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 10:40:58,815 INFO L154 LiptonReduction]: Checked pairs total: 38 [2021-03-26 10:40:58,815 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:40:58,815 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:40:58,817 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 130 flow [2021-03-26 10:40:58,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:40:58,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:58,818 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:58,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:40:58,818 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash 146156219, now seen corresponding path program 1 times [2021-03-26 10:40:58,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:58,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78472366] [2021-03-26 10:40:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:58,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:40:58,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:40:58,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:40:58,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:40:58,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:58,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:40:58,960 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-26 10:40:58,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78472366] [2021-03-26 10:40:58,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:58,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:40:58,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510987905] [2021-03-26 10:40:58,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:40:58,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:40:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:40:58,962 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2021-03-26 10:40:58,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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-26 10:40:58,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:58,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2021-03-26 10:40:58,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:59,081 INFO L129 PetriNetUnfolder]: 33/121 cut-off events. [2021-03-26 10:40:59,081 INFO L130 PetriNetUnfolder]: For 209/216 co-relation queries the response was YES. [2021-03-26 10:40:59,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 121 events. 33/121 cut-off events. For 209/216 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 606 event pairs, 1 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 361. Up to 45 conditions per place. [2021-03-26 10:40:59,082 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 7 selfloop transitions, 12 changer transitions 9/37 dead transitions. [2021-03-26 10:40:59,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 234 flow [2021-03-26 10:40:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:40:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:40:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2021-03-26 10:40:59,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7642857142857142 [2021-03-26 10:40:59,085 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 749 transitions. [2021-03-26 10:40:59,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 749 transitions. [2021-03-26 10:40:59,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:59,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 749 transitions. [2021-03-26 10:40:59,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-26 10:40:59,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 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-26 10:40:59,089 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 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-26 10:40:59,090 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 130 flow. Second operand 7 states and 749 transitions. [2021-03-26 10:40:59,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 234 flow [2021-03-26 10:40:59,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 229 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:40:59,094 INFO L241 Difference]: Finished difference. Result has 43 places, 26 transitions, 178 flow [2021-03-26 10:40:59,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2021-03-26 10:40:59,094 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-26 10:40:59,094 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:59,094 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 178 flow [2021-03-26 10:40:59,095 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 26 transitions, 178 flow [2021-03-26 10:40:59,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 178 flow [2021-03-26 10:40:59,105 INFO L129 PetriNetUnfolder]: 13/60 cut-off events. [2021-03-26 10:40:59,105 INFO L130 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2021-03-26 10:40:59,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 60 events. 13/60 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 201 event pairs, 1 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 204. Up to 24 conditions per place. [2021-03-26 10:40:59,106 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-26 10:40:59,353 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-26 10:40:59,596 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-26 10:40:59,665 INFO L154 LiptonReduction]: Checked pairs total: 175 [2021-03-26 10:40:59,666 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:40:59,666 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 572 [2021-03-26 10:40:59,666 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 185 flow [2021-03-26 10:40:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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-26 10:40:59,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:59,667 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:59,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:40:59,667 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 493537197, now seen corresponding path program 1 times [2021-03-26 10:40:59,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:59,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073530177] [2021-03-26 10:40:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:59,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:59,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:59,729 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:40:59,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:40:59,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:59,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:59,738 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-26 10:40:59,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073530177] [2021-03-26 10:40:59,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:59,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:40:59,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560445680] [2021-03-26 10:40:59,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:40:59,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:40:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:40:59,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2021-03-26 10:40:59,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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-26 10:40:59,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:59,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2021-03-26 10:40:59,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:59,784 INFO L129 PetriNetUnfolder]: 27/89 cut-off events. [2021-03-26 10:40:59,784 INFO L130 PetriNetUnfolder]: For 230/254 co-relation queries the response was YES. [2021-03-26 10:40:59,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 89 events. 27/89 cut-off events. For 230/254 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 367 event pairs, 6 based on Foata normal form. 25/98 useless extension candidates. Maximal degree in co-relation 276. Up to 52 conditions per place. [2021-03-26 10:40:59,785 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 6 selfloop transitions, 5 changer transitions 4/29 dead transitions. [2021-03-26 10:40:59,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 29 transitions, 203 flow [2021-03-26 10:40:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:40:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:40:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2021-03-26 10:40:59,788 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8265734265734266 [2021-03-26 10:40:59,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2021-03-26 10:40:59,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2021-03-26 10:40:59,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:59,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2021-03-26 10:40:59,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 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-26 10:40:59,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 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-26 10:40:59,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 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-26 10:40:59,791 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 185 flow. Second operand 5 states and 591 transitions. [2021-03-26 10:40:59,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 29 transitions, 203 flow [2021-03-26 10:40:59,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 159 flow, removed 11 selfloop flow, removed 10 redundant places. [2021-03-26 10:40:59,794 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 144 flow [2021-03-26 10:40:59,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2021-03-26 10:40:59,794 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2021-03-26 10:40:59,794 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:59,795 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 144 flow [2021-03-26 10:40:59,795 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 24 transitions, 144 flow [2021-03-26 10:40:59,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 144 flow [2021-03-26 10:40:59,803 INFO L129 PetriNetUnfolder]: 11/62 cut-off events. [2021-03-26 10:40:59,804 INFO L130 PetriNetUnfolder]: For 112/123 co-relation queries the response was YES. [2021-03-26 10:40:59,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 62 events. 11/62 cut-off events. For 112/123 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 238 event pairs, 7 based on Foata normal form. 5/64 useless extension candidates. Maximal degree in co-relation 205. Up to 23 conditions per place. [2021-03-26 10:40:59,804 INFO L142 LiptonReduction]: Number of co-enabled transitions 86 [2021-03-26 10:40:59,806 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:40:59,806 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:40:59,806 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 10:40:59,809 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 144 flow [2021-03-26 10:40:59,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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-26 10:40:59,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:59,809 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:59,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:40:59,809 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash -148804270, now seen corresponding path program 1 times [2021-03-26 10:40:59,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:59,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518411461] [2021-03-26 10:40:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:59,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:59,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:59,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:59,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:59,874 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:40:59,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:40:59,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:59,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:59,882 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-26 10:40:59,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518411461] [2021-03-26 10:40:59,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:59,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:40:59,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102728922] [2021-03-26 10:40:59,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:40:59,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:59,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:40:59,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:40:59,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2021-03-26 10:40:59,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 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-26 10:40:59,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:59,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2021-03-26 10:40:59,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:59,936 INFO L129 PetriNetUnfolder]: 14/61 cut-off events. [2021-03-26 10:40:59,936 INFO L130 PetriNetUnfolder]: For 153/227 co-relation queries the response was YES. [2021-03-26 10:40:59,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 61 events. 14/61 cut-off events. For 153/227 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 208 event pairs, 0 based on Foata normal form. 34/89 useless extension candidates. Maximal degree in co-relation 204. Up to 27 conditions per place. [2021-03-26 10:40:59,937 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 4 selfloop transitions, 8 changer transitions 7/29 dead transitions. [2021-03-26 10:40:59,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 192 flow [2021-03-26 10:40:59,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:40:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:40:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2021-03-26 10:40:59,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8211788211788211 [2021-03-26 10:40:59,940 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2021-03-26 10:40:59,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2021-03-26 10:40:59,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:59,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2021-03-26 10:40:59,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 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-26 10:40:59,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 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-26 10:40:59,945 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 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-26 10:40:59,945 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 144 flow. Second operand 7 states and 822 transitions. [2021-03-26 10:40:59,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 192 flow [2021-03-26 10:40:59,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 180 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:40:59,947 INFO L241 Difference]: Finished difference. Result has 45 places, 21 transitions, 146 flow [2021-03-26 10:40:59,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2021-03-26 10:40:59,947 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2021-03-26 10:40:59,947 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:59,947 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 21 transitions, 146 flow [2021-03-26 10:40:59,948 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 21 transitions, 146 flow [2021-03-26 10:40:59,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 21 transitions, 146 flow [2021-03-26 10:40:59,955 INFO L129 PetriNetUnfolder]: 2/24 cut-off events. [2021-03-26 10:40:59,955 INFO L130 PetriNetUnfolder]: For 52/55 co-relation queries the response was YES. [2021-03-26 10:40:59,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 24 events. 2/24 cut-off events. For 52/55 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 83. Up to 10 conditions per place. [2021-03-26 10:40:59,955 INFO L142 LiptonReduction]: Number of co-enabled transitions 42 [2021-03-26 10:41:00,162 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:41:00,535 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2021-03-26 10:41:00,677 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:41:01,217 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 10:41:01,407 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 10:41:02,642 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 333 DAG size of output: 254 [2021-03-26 10:41:03,046 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:41:03,284 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:41:03,515 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:41:03,951 WARN L205 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:41:04,424 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:41:04,427 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 10:41:04,427 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:41:04,427 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4480 [2021-03-26 10:41:04,428 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 17 transitions, 128 flow [2021-03-26 10:41:04,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 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-26 10:41:04,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:04,428 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:04,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:41:04,428 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2026832090, now seen corresponding path program 1 times [2021-03-26 10:41:04,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:04,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441106202] [2021-03-26 10:41:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:04,463 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:04,523 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:04,560 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:41:04,560 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:41:04,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:41:04,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:41:04 BasicIcfg [2021-03-26 10:41:04,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:41:04,629 INFO L168 Benchmark]: Toolchain (without parser) took 21425.14 ms. Allocated memory was 255.9 MB in the beginning and 583.0 MB in the end (delta: 327.2 MB). Free memory was 234.7 MB in the beginning and 314.0 MB in the end (delta: -79.3 MB). Peak memory consumption was 247.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:04,630 INFO L168 Benchmark]: CDTParser took 0.14 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-26 10:41:04,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.56 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.7 MB in the beginning and 296.3 MB in the end (delta: -61.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:04,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.86 ms. Allocated memory is still 335.5 MB. Free memory was 296.3 MB in the beginning and 293.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:04,632 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 335.5 MB. Free memory was 293.5 MB in the beginning and 291.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:04,632 INFO L168 Benchmark]: RCFGBuilder took 2017.92 ms. Allocated memory is still 335.5 MB. Free memory was 291.4 MB in the beginning and 223.3 MB in the end (delta: 68.1 MB). Peak memory consumption was 70.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:04,633 INFO L168 Benchmark]: TraceAbstraction took 18719.22 ms. Allocated memory was 335.5 MB in the beginning and 583.0 MB in the end (delta: 247.5 MB). Free memory was 222.3 MB in the beginning and 314.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 155.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:04,634 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.14 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 563.56 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.7 MB in the beginning and 296.3 MB in the end (delta: -61.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.86 ms. Allocated memory is still 335.5 MB. Free memory was 296.3 MB in the beginning and 293.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 335.5 MB. Free memory was 293.5 MB in the beginning and 291.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2017.92 ms. Allocated memory is still 335.5 MB. Free memory was 291.4 MB in the beginning and 223.3 MB in the end (delta: 68.1 MB). Peak memory consumption was 70.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18719.22 ms. Allocated memory was 335.5 MB in the beginning and 583.0 MB in the end (delta: 247.5 MB). Free memory was 222.3 MB in the beginning and 314.0 MB in the end (delta: -91.8 MB). Peak memory consumption was 155.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7878.4ms, 82 PlacesBefore, 37 PlacesAfterwards, 77 TransitionsBefore, 31 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, 1657 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 809, positive: 743, positive conditional: 743, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 809, positive: 743, positive conditional: 0, positive unconditional: 743, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 809, positive: 743, positive conditional: 0, positive unconditional: 743, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 624, positive: 593, positive conditional: 0, positive unconditional: 593, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 624, positive: 591, positive conditional: 0, positive unconditional: 591, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 611, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 601, negative conditional: 0, negative unconditional: 601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 809, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 624, unknown conditional: 0, unknown unconditional: 624] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 593, Positive conditional cache size: 0, Positive unconditional cache size: 593, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2495.9ms, 35 PlacesBefore, 25 PlacesAfterwards, 24 TransitionsBefore, 18 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 448 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, positive: 123, positive conditional: 17, positive unconditional: 106, negative: 49, negative conditional: 7, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 123, positive conditional: 17, positive unconditional: 106, negative: 49, negative conditional: 7, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 32, positive conditional: 5, positive unconditional: 27, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 173, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 153, negative conditional: 42, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 91, positive conditional: 12, positive unconditional: 79, negative: 36, negative conditional: 4, negative unconditional: 32, unknown: 45, unknown conditional: 8, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 625, Positive conditional cache size: 5, Positive unconditional cache size: 620, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1016.6ms, 28 PlacesBefore, 26 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, positive: 122, positive conditional: 122, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, positive: 122, positive conditional: 18, positive unconditional: 104, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 122, positive conditional: 18, positive unconditional: 104, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 146, positive: 118, positive conditional: 18, positive unconditional: 100, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 673, Positive cache size: 629, Positive conditional cache size: 5, Positive unconditional cache size: 624, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.4ms, 29 PlacesBefore, 29 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 19, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 630, Positive conditional cache size: 5, Positive unconditional cache size: 625, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.3ms, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 11, positive conditional: 2, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 2, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 13, positive: 8, positive conditional: 1, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 677, Positive cache size: 633, Positive conditional cache size: 6, Positive unconditional cache size: 627, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.9ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 38 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 19, positive conditional: 3, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 19, positive conditional: 3, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 17, positive conditional: 3, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 635, Positive conditional cache size: 6, Positive unconditional cache size: 629, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 571.0ms, 43 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 175 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, positive: 67, positive conditional: 35, positive unconditional: 32, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 67, positive conditional: 35, positive unconditional: 32, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 82, positive: 64, positive conditional: 34, positive unconditional: 30, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 682, Positive cache size: 638, Positive conditional cache size: 7, Positive unconditional cache size: 631, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 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] , Statistics on independence cache: Total cache size (in pairs): 682, Positive cache size: 638, Positive conditional cache size: 7, Positive unconditional cache size: 631, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4479.6ms, 45 PlacesBefore, 41 PlacesAfterwards, 21 TransitionsBefore, 17 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 9, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 642, Positive conditional cache size: 8, Positive unconditional cache size: 634, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 3 - 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18533.4ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 729.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7944.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 28 SDtfs, 25 SDslu, 23 SDs, 0 SdLazy, 143 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 215.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 176.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=6, InterpolantAutomatonStates: 37, 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: 32.9ms SsaConstructionTime, 334.7ms SatisfiabilityAnalysisTime, 577.3ms InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...