/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:10:01,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:10:01,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:10:01,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:10:01,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:10:01,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:10:01,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:10:01,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:10:01,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:10:01,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:10:01,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:10:01,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:10:01,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:10:01,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:10:01,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:10:01,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:10:01,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:10:01,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:10:01,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:10:01,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:10:01,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:10:01,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:10:01,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:10:01,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:10:01,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:10:01,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:10:01,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:10:01,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:10:01,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:10:01,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:10:01,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:10:01,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:10:01,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:10:01,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:10:01,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:10:01,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:10:01,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:10:01,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:10:01,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:10:01,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:10:01,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:10:01,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 05:10:01,851 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:10:01,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:10:01,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:10:01,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:10:01,855 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:10:01,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:10:01,855 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:10:01,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:10:01,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:10:01,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:10:01,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:10:01,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:10:01,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:10:01,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:10:01,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:10:01,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:10:01,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:10:01,859 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 05:10:02,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:10:02,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:10:02,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:10:02,198 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:10:02,199 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:10:02,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-03-25 05:10:02,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde65bac3/b243fb98918440bd8f823143ec0127a0/FLAGce41d7478 [2021-03-25 05:10:02,793 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:10:02,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-03-25 05:10:02,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde65bac3/b243fb98918440bd8f823143ec0127a0/FLAGce41d7478 [2021-03-25 05:10:03,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde65bac3/b243fb98918440bd8f823143ec0127a0 [2021-03-25 05:10:03,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:10:03,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:10:03,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:10:03,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:10:03,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:10:03,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d0c838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03, skipping insertion in model container [2021-03-25 05:10:03,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:10:03,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:10:03,425 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/safe032_pso.oepc.i[993,1006] [2021-03-25 05:10:03,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:10:03,683 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:10:03,693 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/safe032_pso.oepc.i[993,1006] [2021-03-25 05:10:03,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:10:03,783 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:10:03,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03 WrapperNode [2021-03-25 05:10:03,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:10:03,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:10:03,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:10:03,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:10:03,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:10:03,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:10:03,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:10:03,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:10:03,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... [2021-03-25 05:10:03,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:10:03,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:10:03,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:10:03,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:10:03,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:10:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:10:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:10:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:10:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:10:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:10:03,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:10:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:10:03,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:10:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 05:10:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 05:10:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:10:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:10:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:10:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:10:03,959 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 05:10:06,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:10:06,984 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 05:10:06,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:10:06 BoogieIcfgContainer [2021-03-25 05:10:06,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:10:06,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:10:06,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:10:06,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:10:06,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:10:03" (1/3) ... [2021-03-25 05:10:06,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475e7dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:10:06, skipping insertion in model container [2021-03-25 05:10:06,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:10:03" (2/3) ... [2021-03-25 05:10:06,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475e7dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:10:06, skipping insertion in model container [2021-03-25 05:10:06,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:10:06" (3/3) ... [2021-03-25 05:10:06,993 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.oepc.i [2021-03-25 05:10:06,998 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:10:07,002 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 05:10:07,002 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:10:07,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,090 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,091 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:10:07,121 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:10:07,137 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 05:10:07,164 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:10:07,164 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:10:07,164 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:10:07,164 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:10:07,164 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:10:07,164 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:10:07,164 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:10:07,164 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:10:07,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 05:10:07,225 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 05:10:07,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:10:07,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 05:10:07,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 05:10:07,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-25 05:10:07,244 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:07,251 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 05:10:07,253 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 05:10:07,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-25 05:10:07,284 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 05:10:07,287 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:10:07,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 05:10:07,292 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-25 05:10:08,025 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:10:08,442 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 05:10:08,562 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 05:10:10,112 WARN L205 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 05:10:10,392 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 05:10:11,785 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 05:10:12,412 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 05:10:12,867 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-25 05:10:12,867 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-25 05:10:12,869 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5626 [2021-03-25 05:10:12,880 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 05:10:12,881 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:10:12,881 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:12,881 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:12,882 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-25 05:10:12,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:12,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424059319] [2021-03-25 05:10:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:13,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:13,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:13,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:13,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:13,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424059319] [2021-03-25 05:10:13,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:13,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:10:13,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146115834] [2021-03-25 05:10:13,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:10:13,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:10:13,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:10:13,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-25 05:10:13,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:13,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:13,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-25 05:10:13,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:13,367 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-25 05:10:13,367 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:10:13,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-25 05:10:13,372 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-25 05:10:13,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-25 05:10:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:10:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:10:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-25 05:10:13,390 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-25 05:10:13,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-25 05:10:13,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-25 05:10:13,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:13,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-25 05:10:13,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:13,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:13,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:13,411 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-25 05:10:13,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-25 05:10:13,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 05:10:13,415 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-25 05:10:13,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-25 05:10:13,418 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 05:10:13,418 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:13,418 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 05:10:13,418 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 05:10:13,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-25 05:10:13,432 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-25 05:10:13,432 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:10:13,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 05:10:13,434 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-25 05:10:13,838 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 05:10:14,173 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 05:10:15,447 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-25 05:10:16,104 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 05:10:16,753 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 05:10:16,872 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 05:10:17,218 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 05:10:17,531 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 05:10:18,440 WARN L205 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-25 05:10:19,354 WARN L205 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-25 05:10:19,665 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-25 05:10:19,666 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 05:10:19,666 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6248 [2021-03-25 05:10:19,666 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 05:10:19,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:19,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:19,667 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:19,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:10:19,667 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-25 05:10:19,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:19,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984110133] [2021-03-25 05:10:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:19,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:19,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:19,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:19,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:19,811 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 05:10:19,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:10:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:19,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984110133] [2021-03-25 05:10:19,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:19,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:10:19,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092153916] [2021-03-25 05:10:19,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:10:19,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:19,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:10:19,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:10:19,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 174 [2021-03-25 05:10:19,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:19,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:19,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 174 [2021-03-25 05:10:19,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:19,859 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-03-25 05:10:19,860 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:10:19,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2021-03-25 05:10:19,860 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 1 selfloop transitions, 2 changer transitions 3/26 dead transitions. [2021-03-25 05:10:19,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 74 flow [2021-03-25 05:10:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:10:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:10:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2021-03-25 05:10:19,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8701149425287357 [2021-03-25 05:10:19,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 757 transitions. [2021-03-25 05:10:19,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 757 transitions. [2021-03-25 05:10:19,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:19,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 757 transitions. [2021-03-25 05:10:19,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:19,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:19,867 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:19,867 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 757 transitions. [2021-03-25 05:10:19,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 74 flow [2021-03-25 05:10:19,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:10:19,868 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 60 flow [2021-03-25 05:10:19,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-03-25 05:10:19,869 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -11 predicate places. [2021-03-25 05:10:19,869 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:19,869 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 60 flow [2021-03-25 05:10:19,869 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 60 flow [2021-03-25 05:10:19,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-25 05:10:19,874 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 05:10:19,874 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 05:10:19,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:10:19,874 INFO L142 LiptonReduction]: Number of co-enabled transitions 204 [2021-03-25 05:10:20,423 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 05:10:20,555 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 05:10:20,918 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 05:10:21,057 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 05:10:21,060 INFO L154 LiptonReduction]: Checked pairs total: 738 [2021-03-25 05:10:21,061 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:10:21,061 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1192 [2021-03-25 05:10:21,062 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-25 05:10:21,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,063 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:21,063 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:21,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:10:21,063 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1131497842, now seen corresponding path program 1 times [2021-03-25 05:10:21,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:21,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908001180] [2021-03-25 05:10:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:21,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:21,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:21,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:21,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:21,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908001180] [2021-03-25 05:10:21,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:21,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:10:21,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812658134] [2021-03-25 05:10:21,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:10:21,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:21,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:10:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:10:21,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 176 [2021-03-25 05:10:21,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:21,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 176 [2021-03-25 05:10:21,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:21,200 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 05:10:21,200 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 05:10:21,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 05:10:21,202 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-25 05:10:21,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-25 05:10:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:10:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:10:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-25 05:10:21,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8712121212121212 [2021-03-25 05:10:21,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-25 05:10:21,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-25 05:10:21,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:21,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-25 05:10:21,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,208 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 460 transitions. [2021-03-25 05:10:21,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-25 05:10:21,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:10:21,209 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-25 05:10:21,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-25 05:10:21,209 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -15 predicate places. [2021-03-25 05:10:21,209 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:21,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-25 05:10:21,210 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-25 05:10:21,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2021-03-25 05:10:21,218 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 05:10:21,219 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 05:10:21,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-25 05:10:21,219 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-25 05:10:21,221 INFO L154 LiptonReduction]: Checked pairs total: 220 [2021-03-25 05:10:21,221 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:21,221 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 05:10:21,222 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-25 05:10:21,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:21,223 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:21,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:10:21,223 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:21,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1371931757, now seen corresponding path program 1 times [2021-03-25 05:10:21,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:21,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7237817] [2021-03-25 05:10:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:21,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:21,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:10:21,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:21,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:10:21,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:21,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:10:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:21,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7237817] [2021-03-25 05:10:21,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:21,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:10:21,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391563931] [2021-03-25 05:10:21,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:10:21,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:10:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:10:21,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-25 05:10:21,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:21,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-25 05:10:21,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:21,561 INFO L129 PetriNetUnfolder]: 154/315 cut-off events. [2021-03-25 05:10:21,561 INFO L130 PetriNetUnfolder]: For 61/62 co-relation queries the response was YES. [2021-03-25 05:10:21,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 315 events. 154/315 cut-off events. For 61/62 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1491 event pairs, 22 based on Foata normal form. 7/313 useless extension candidates. Maximal degree in co-relation 656. Up to 179 conditions per place. [2021-03-25 05:10:21,564 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 16 selfloop transitions, 11 changer transitions 0/40 dead transitions. [2021-03-25 05:10:21,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 164 flow [2021-03-25 05:10:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:10:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:10:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2021-03-25 05:10:21,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7431818181818182 [2021-03-25 05:10:21,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2021-03-25 05:10:21,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2021-03-25 05:10:21,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:21,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2021-03-25 05:10:21,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,571 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,571 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 5 states and 654 transitions. [2021-03-25 05:10:21,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 164 flow [2021-03-25 05:10:21,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:10:21,573 INFO L241 Difference]: Finished difference. Result has 38 places, 32 transitions, 145 flow [2021-03-25 05:10:21,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2021-03-25 05:10:21,573 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-25 05:10:21,573 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:21,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 145 flow [2021-03-25 05:10:21,573 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 145 flow [2021-03-25 05:10:21,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 145 flow [2021-03-25 05:10:21,597 INFO L129 PetriNetUnfolder]: 59/153 cut-off events. [2021-03-25 05:10:21,597 INFO L130 PetriNetUnfolder]: For 167/181 co-relation queries the response was YES. [2021-03-25 05:10:21,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 153 events. 59/153 cut-off events. For 167/181 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 744 event pairs, 15 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 402. Up to 83 conditions per place. [2021-03-25 05:10:21,599 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-25 05:10:21,602 INFO L154 LiptonReduction]: Checked pairs total: 99 [2021-03-25 05:10:21,602 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:21,602 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-25 05:10:21,604 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 145 flow [2021-03-25 05:10:21,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:21,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:21,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:10:21,605 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash 616966057, now seen corresponding path program 1 times [2021-03-25 05:10:21,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:21,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526619317] [2021-03-25 05:10:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:21,728 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:10:21,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:10:21,755 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:10:21,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:10:21,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:21,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:21,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526619317] [2021-03-25 05:10:21,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:21,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:10:21,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526874333] [2021-03-25 05:10:21,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:10:21,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:10:21,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:10:21,769 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 176 [2021-03-25 05:10:21,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:21,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 176 [2021-03-25 05:10:21,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:21,911 INFO L129 PetriNetUnfolder]: 171/385 cut-off events. [2021-03-25 05:10:21,911 INFO L130 PetriNetUnfolder]: For 355/385 co-relation queries the response was YES. [2021-03-25 05:10:21,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 385 events. 171/385 cut-off events. For 355/385 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2104 event pairs, 59 based on Foata normal form. 9/382 useless extension candidates. Maximal degree in co-relation 1123. Up to 209 conditions per place. [2021-03-25 05:10:21,915 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 18 selfloop transitions, 13 changer transitions 0/44 dead transitions. [2021-03-25 05:10:21,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 266 flow [2021-03-25 05:10:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:10:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:10:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2021-03-25 05:10:21,918 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.765625 [2021-03-25 05:10:21,918 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2021-03-25 05:10:21,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2021-03-25 05:10:21,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:21,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2021-03-25 05:10:21,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,921 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 145 flow. Second operand 4 states and 539 transitions. [2021-03-25 05:10:21,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 266 flow [2021-03-25 05:10:21,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:10:21,925 INFO L241 Difference]: Finished difference. Result has 42 places, 41 transitions, 254 flow [2021-03-25 05:10:21,925 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2021-03-25 05:10:21,925 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2021-03-25 05:10:21,925 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:21,926 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 41 transitions, 254 flow [2021-03-25 05:10:21,926 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 41 transitions, 254 flow [2021-03-25 05:10:21,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 254 flow [2021-03-25 05:10:21,964 INFO L129 PetriNetUnfolder]: 65/186 cut-off events. [2021-03-25 05:10:21,964 INFO L130 PetriNetUnfolder]: For 288/340 co-relation queries the response was YES. [2021-03-25 05:10:21,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 186 events. 65/186 cut-off events. For 288/340 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 910 event pairs, 18 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 589. Up to 94 conditions per place. [2021-03-25 05:10:21,966 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-25 05:10:21,976 INFO L154 LiptonReduction]: Checked pairs total: 232 [2021-03-25 05:10:21,976 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:21,976 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-25 05:10:21,977 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 254 flow [2021-03-25 05:10:21,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:21,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:21,978 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:21,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:10:21,978 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash -573876835, now seen corresponding path program 1 times [2021-03-25 05:10:21,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:21,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066143791] [2021-03-25 05:10:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:22,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:22,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:22,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:10:22,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:10:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:22,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066143791] [2021-03-25 05:10:22,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:22,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:10:22,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324421059] [2021-03-25 05:10:22,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:10:22,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:10:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:10:22,082 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-25 05:10:22,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:22,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-25 05:10:22,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:22,277 INFO L129 PetriNetUnfolder]: 174/408 cut-off events. [2021-03-25 05:10:22,278 INFO L130 PetriNetUnfolder]: For 734/752 co-relation queries the response was YES. [2021-03-25 05:10:22,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 408 events. 174/408 cut-off events. For 734/752 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2364 event pairs, 11 based on Foata normal form. 10/414 useless extension candidates. Maximal degree in co-relation 1382. Up to 199 conditions per place. [2021-03-25 05:10:22,281 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 27 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2021-03-25 05:10:22,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 454 flow [2021-03-25 05:10:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:10:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:10:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2021-03-25 05:10:22,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7376893939393939 [2021-03-25 05:10:22,284 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2021-03-25 05:10:22,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2021-03-25 05:10:22,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:22,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2021-03-25 05:10:22,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,288 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,288 INFO L185 Difference]: Start difference. First operand has 42 places, 41 transitions, 254 flow. Second operand 6 states and 779 transitions. [2021-03-25 05:10:22,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 454 flow [2021-03-25 05:10:22,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 453 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:10:22,294 INFO L241 Difference]: Finished difference. Result has 49 places, 50 transitions, 397 flow [2021-03-25 05:10:22,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2021-03-25 05:10:22,294 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2021-03-25 05:10:22,294 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:22,294 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 50 transitions, 397 flow [2021-03-25 05:10:22,294 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 50 transitions, 397 flow [2021-03-25 05:10:22,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 50 transitions, 397 flow [2021-03-25 05:10:22,326 INFO L129 PetriNetUnfolder]: 56/179 cut-off events. [2021-03-25 05:10:22,326 INFO L130 PetriNetUnfolder]: For 351/379 co-relation queries the response was YES. [2021-03-25 05:10:22,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 179 events. 56/179 cut-off events. For 351/379 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 938 event pairs, 2 based on Foata normal form. 6/179 useless extension candidates. Maximal degree in co-relation 706. Up to 87 conditions per place. [2021-03-25 05:10:22,329 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 05:10:22,338 INFO L154 LiptonReduction]: Checked pairs total: 341 [2021-03-25 05:10:22,338 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:22,338 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-25 05:10:22,341 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 397 flow [2021-03-25 05:10:22,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,341 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:22,341 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:22,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:10:22,341 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash 64897231, now seen corresponding path program 1 times [2021-03-25 05:10:22,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:22,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775221314] [2021-03-25 05:10:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:22,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:22,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:10:22,482 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-03-25 05:10:22,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 05:10:22,498 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-03-25 05:10:22,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 05:10:22,500 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 05:10:22,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 05:10:22,525 INFO L142 QuantifierPusher]: treesize reduction 8, result has 76.5 percent of original size [2021-03-25 05:10:22,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 05:10:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:22,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775221314] [2021-03-25 05:10:22,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:22,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:22,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385533272] [2021-03-25 05:10:22,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:10:22,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:10:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:10:22,578 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 176 [2021-03-25 05:10:22,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:22,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 176 [2021-03-25 05:10:22,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:22,730 INFO L129 PetriNetUnfolder]: 174/408 cut-off events. [2021-03-25 05:10:22,730 INFO L130 PetriNetUnfolder]: For 1177/1205 co-relation queries the response was YES. [2021-03-25 05:10:22,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1694 conditions, 408 events. 174/408 cut-off events. For 1177/1205 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2350 event pairs, 16 based on Foata normal form. 8/412 useless extension candidates. Maximal degree in co-relation 1672. Up to 241 conditions per place. [2021-03-25 05:10:22,734 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 35 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2021-03-25 05:10:22,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 578 flow [2021-03-25 05:10:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:10:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:10:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2021-03-25 05:10:22,737 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7514204545454546 [2021-03-25 05:10:22,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2021-03-25 05:10:22,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2021-03-25 05:10:22,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:22,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2021-03-25 05:10:22,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,739 INFO L185 Difference]: Start difference. First operand has 49 places, 50 transitions, 397 flow. Second operand 4 states and 529 transitions. [2021-03-25 05:10:22,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 578 flow [2021-03-25 05:10:22,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 555 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-25 05:10:22,746 INFO L241 Difference]: Finished difference. Result has 52 places, 56 transitions, 474 flow [2021-03-25 05:10:22,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2021-03-25 05:10:22,746 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2021-03-25 05:10:22,746 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:22,746 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 56 transitions, 474 flow [2021-03-25 05:10:22,746 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 56 transitions, 474 flow [2021-03-25 05:10:22,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 56 transitions, 474 flow [2021-03-25 05:10:22,793 INFO L129 PetriNetUnfolder]: 112/311 cut-off events. [2021-03-25 05:10:22,793 INFO L130 PetriNetUnfolder]: For 767/809 co-relation queries the response was YES. [2021-03-25 05:10:22,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 311 events. 112/311 cut-off events. For 767/809 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1785 event pairs, 5 based on Foata normal form. 3/301 useless extension candidates. Maximal degree in co-relation 1226. Up to 146 conditions per place. [2021-03-25 05:10:22,797 INFO L142 LiptonReduction]: Number of co-enabled transitions 438 [2021-03-25 05:10:22,831 INFO L154 LiptonReduction]: Checked pairs total: 314 [2021-03-25 05:10:22,832 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:22,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-03-25 05:10:22,835 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 474 flow [2021-03-25 05:10:22,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:22,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:22,835 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:22,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:10:22,835 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 929898411, now seen corresponding path program 1 times [2021-03-25 05:10:22,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:22,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70018694] [2021-03-25 05:10:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:22,931 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:10:22,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:10:22,960 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:10:22,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:10:22,964 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 05:10:22,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 05:10:22,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:22,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 05:10:23,010 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.9 percent of original size [2021-03-25 05:10:23,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 05:10:23,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:23,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:10:23,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:23,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:10:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:23,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70018694] [2021-03-25 05:10:23,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:23,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 05:10:23,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890315849] [2021-03-25 05:10:23,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 05:10:23,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:23,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 05:10:23,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-25 05:10:23,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-25 05:10:23,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 474 flow. Second operand has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:23,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:23,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-25 05:10:23,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:23,321 INFO L129 PetriNetUnfolder]: 206/472 cut-off events. [2021-03-25 05:10:23,321 INFO L130 PetriNetUnfolder]: For 1445/1525 co-relation queries the response was YES. [2021-03-25 05:10:23,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 472 events. 206/472 cut-off events. For 1445/1525 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2868 event pairs, 13 based on Foata normal form. 27/490 useless extension candidates. Maximal degree in co-relation 2041. Up to 243 conditions per place. [2021-03-25 05:10:23,326 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 32 selfloop transitions, 29 changer transitions 0/74 dead transitions. [2021-03-25 05:10:23,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 764 flow [2021-03-25 05:10:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:10:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:10:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2021-03-25 05:10:23,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7420454545454546 [2021-03-25 05:10:23,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2021-03-25 05:10:23,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2021-03-25 05:10:23,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:23,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2021-03-25 05:10:23,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:23,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:23,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:23,333 INFO L185 Difference]: Start difference. First operand has 52 places, 56 transitions, 474 flow. Second operand 5 states and 653 transitions. [2021-03-25 05:10:23,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 764 flow [2021-03-25 05:10:23,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 728 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 05:10:23,340 INFO L241 Difference]: Finished difference. Result has 55 places, 67 transitions, 649 flow [2021-03-25 05:10:23,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=649, PETRI_PLACES=55, PETRI_TRANSITIONS=67} [2021-03-25 05:10:23,340 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2021-03-25 05:10:23,340 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:23,340 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 67 transitions, 649 flow [2021-03-25 05:10:23,340 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 67 transitions, 649 flow [2021-03-25 05:10:23,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 67 transitions, 649 flow [2021-03-25 05:10:23,398 INFO L129 PetriNetUnfolder]: 137/377 cut-off events. [2021-03-25 05:10:23,398 INFO L130 PetriNetUnfolder]: For 1401/1532 co-relation queries the response was YES. [2021-03-25 05:10:23,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 377 events. 137/377 cut-off events. For 1401/1532 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2265 event pairs, 4 based on Foata normal form. 33/398 useless extension candidates. Maximal degree in co-relation 1665. Up to 174 conditions per place. [2021-03-25 05:10:23,403 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-25 05:10:23,454 INFO L154 LiptonReduction]: Checked pairs total: 621 [2021-03-25 05:10:23,455 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:23,455 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-03-25 05:10:23,457 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 67 transitions, 649 flow [2021-03-25 05:10:23,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:23,457 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:23,457 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:23,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 05:10:23,458 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash 975100131, now seen corresponding path program 2 times [2021-03-25 05:10:23,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:23,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854007094] [2021-03-25 05:10:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:23,609 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:10:23,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:10:23,635 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:10:23,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:10:23,637 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-25 05:10:23,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 05:10:23,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:23,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 05:10:23,703 INFO L142 QuantifierPusher]: treesize reduction 8, result has 90.1 percent of original size [2021-03-25 05:10:23,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-25 05:10:23,752 INFO L142 QuantifierPusher]: treesize reduction 18, result has 81.3 percent of original size [2021-03-25 05:10:23,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-03-25 05:10:23,812 INFO L142 QuantifierPusher]: treesize reduction 6, result has 80.0 percent of original size [2021-03-25 05:10:23,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 05:10:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:23,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854007094] [2021-03-25 05:10:23,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:23,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 05:10:23,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629340631] [2021-03-25 05:10:23,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 05:10:23,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 05:10:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 05:10:23,844 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 176 [2021-03-25 05:10:23,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 67 transitions, 649 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:23,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:23,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 176 [2021-03-25 05:10:23,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:24,328 INFO L129 PetriNetUnfolder]: 264/568 cut-off events. [2021-03-25 05:10:24,328 INFO L130 PetriNetUnfolder]: For 2559/2678 co-relation queries the response was YES. [2021-03-25 05:10:24,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 568 events. 264/568 cut-off events. For 2559/2678 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3320 event pairs, 3 based on Foata normal form. 62/618 useless extension candidates. Maximal degree in co-relation 2828. Up to 334 conditions per place. [2021-03-25 05:10:24,335 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 52 selfloop transitions, 51 changer transitions 0/116 dead transitions. [2021-03-25 05:10:24,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 116 transitions, 1366 flow [2021-03-25 05:10:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 05:10:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 05:10:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1146 transitions. [2021-03-25 05:10:24,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7234848484848485 [2021-03-25 05:10:24,339 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1146 transitions. [2021-03-25 05:10:24,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1146 transitions. [2021-03-25 05:10:24,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:24,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1146 transitions. [2021-03-25 05:10:24,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:24,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:24,346 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:24,346 INFO L185 Difference]: Start difference. First operand has 55 places, 67 transitions, 649 flow. Second operand 9 states and 1146 transitions. [2021-03-25 05:10:24,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 116 transitions, 1366 flow [2021-03-25 05:10:24,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 116 transitions, 1294 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-25 05:10:24,355 INFO L241 Difference]: Finished difference. Result has 66 places, 109 transitions, 1240 flow [2021-03-25 05:10:24,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1240, PETRI_PLACES=66, PETRI_TRANSITIONS=109} [2021-03-25 05:10:24,355 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2021-03-25 05:10:24,355 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:24,355 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 109 transitions, 1240 flow [2021-03-25 05:10:24,356 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 109 transitions, 1240 flow [2021-03-25 05:10:24,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 109 transitions, 1240 flow [2021-03-25 05:10:24,443 INFO L129 PetriNetUnfolder]: 223/513 cut-off events. [2021-03-25 05:10:24,443 INFO L130 PetriNetUnfolder]: For 2730/2926 co-relation queries the response was YES. [2021-03-25 05:10:24,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 513 events. 223/513 cut-off events. For 2730/2926 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3124 event pairs, 4 based on Foata normal form. 79/582 useless extension candidates. Maximal degree in co-relation 2555. Up to 228 conditions per place. [2021-03-25 05:10:24,451 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-25 05:10:24,555 INFO L154 LiptonReduction]: Checked pairs total: 2695 [2021-03-25 05:10:24,556 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:10:24,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 201 [2021-03-25 05:10:24,556 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 108 transitions, 1231 flow [2021-03-25 05:10:24,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:24,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:24,557 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:24,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 05:10:24,557 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash -799893853, now seen corresponding path program 3 times [2021-03-25 05:10:24,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:24,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339448156] [2021-03-25 05:10:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:24,656 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 05:10:24,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 05:10:24,692 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-25 05:10:24,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 05:10:24,737 INFO L142 QuantifierPusher]: treesize reduction 54, result has 56.8 percent of original size [2021-03-25 05:10:24,740 INFO L147 QuantifierPusher]: treesize reduction 9, result has 87.3 percent of original size 62 [2021-03-25 05:10:24,789 INFO L142 QuantifierPusher]: treesize reduction 37, result has 49.3 percent of original size [2021-03-25 05:10:24,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 05:10:24,825 INFO L142 QuantifierPusher]: treesize reduction 38, result has 64.2 percent of original size [2021-03-25 05:10:24,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 05:10:24,880 INFO L142 QuantifierPusher]: treesize reduction 26, result has 64.9 percent of original size [2021-03-25 05:10:24,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 05:10:24,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:24,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:10:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:24,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339448156] [2021-03-25 05:10:24,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:24,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 05:10:24,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765131548] [2021-03-25 05:10:24,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 05:10:24,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 05:10:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 05:10:24,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 176 [2021-03-25 05:10:24,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 108 transitions, 1231 flow. Second operand has 9 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:24,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:24,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 176 [2021-03-25 05:10:24,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:25,331 INFO L129 PetriNetUnfolder]: 263/568 cut-off events. [2021-03-25 05:10:25,331 INFO L130 PetriNetUnfolder]: For 3106/3283 co-relation queries the response was YES. [2021-03-25 05:10:25,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3198 conditions, 568 events. 263/568 cut-off events. For 3106/3283 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3322 event pairs, 9 based on Foata normal form. 54/611 useless extension candidates. Maximal degree in co-relation 3167. Up to 258 conditions per place. [2021-03-25 05:10:25,340 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 64 selfloop transitions, 43 changer transitions 0/120 dead transitions. [2021-03-25 05:10:25,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 1582 flow [2021-03-25 05:10:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:10:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:10:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2021-03-25 05:10:25,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6840909090909091 [2021-03-25 05:10:25,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2021-03-25 05:10:25,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2021-03-25 05:10:25,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:25,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2021-03-25 05:10:25,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,346 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,346 INFO L185 Difference]: Start difference. First operand has 66 places, 108 transitions, 1231 flow. Second operand 5 states and 602 transitions. [2021-03-25 05:10:25,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 1582 flow [2021-03-25 05:10:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 120 transitions, 1516 flow, removed 33 selfloop flow, removed 0 redundant places. [2021-03-25 05:10:25,360 INFO L241 Difference]: Finished difference. Result has 71 places, 113 transitions, 1369 flow [2021-03-25 05:10:25,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1369, PETRI_PLACES=71, PETRI_TRANSITIONS=113} [2021-03-25 05:10:25,361 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2021-03-25 05:10:25,361 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:25,361 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 113 transitions, 1369 flow [2021-03-25 05:10:25,361 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 113 transitions, 1369 flow [2021-03-25 05:10:25,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 113 transitions, 1369 flow [2021-03-25 05:10:25,450 INFO L129 PetriNetUnfolder]: 237/548 cut-off events. [2021-03-25 05:10:25,450 INFO L130 PetriNetUnfolder]: For 3523/3716 co-relation queries the response was YES. [2021-03-25 05:10:25,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 548 events. 237/548 cut-off events. For 3523/3716 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3370 event pairs, 4 based on Foata normal form. 96/639 useless extension candidates. Maximal degree in co-relation 2820. Up to 218 conditions per place. [2021-03-25 05:10:25,459 INFO L142 LiptonReduction]: Number of co-enabled transitions 754 [2021-03-25 05:10:25,532 INFO L154 LiptonReduction]: Checked pairs total: 1570 [2021-03-25 05:10:25,532 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:25,532 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 171 [2021-03-25 05:10:25,534 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 113 transitions, 1369 flow [2021-03-25 05:10:25,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:25,535 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:25,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 05:10:25,535 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1156489321, now seen corresponding path program 1 times [2021-03-25 05:10:25,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:25,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042080765] [2021-03-25 05:10:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:25,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:25,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:25,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:25,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:25,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042080765] [2021-03-25 05:10:25,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:25,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:10:25,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413509885] [2021-03-25 05:10:25,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:10:25,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:10:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:10:25,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 176 [2021-03-25 05:10:25,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 113 transitions, 1369 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:25,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 176 [2021-03-25 05:10:25,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:25,755 INFO L129 PetriNetUnfolder]: 286/671 cut-off events. [2021-03-25 05:10:25,755 INFO L130 PetriNetUnfolder]: For 4560/4693 co-relation queries the response was YES. [2021-03-25 05:10:25,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3639 conditions, 671 events. 286/671 cut-off events. For 4560/4693 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4346 event pairs, 0 based on Foata normal form. 80/735 useless extension candidates. Maximal degree in co-relation 3605. Up to 290 conditions per place. [2021-03-25 05:10:25,762 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 3 selfloop transitions, 3 changer transitions 22/113 dead transitions. [2021-03-25 05:10:25,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 113 transitions, 1381 flow [2021-03-25 05:10:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:10:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:10:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-25 05:10:25,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8693181818181818 [2021-03-25 05:10:25,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-25 05:10:25,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-25 05:10:25,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:25,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-25 05:10:25,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,767 INFO L185 Difference]: Start difference. First operand has 71 places, 113 transitions, 1369 flow. Second operand 3 states and 459 transitions. [2021-03-25 05:10:25,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 113 transitions, 1381 flow [2021-03-25 05:10:25,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 1349 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 05:10:25,782 INFO L241 Difference]: Finished difference. Result has 73 places, 91 transitions, 1080 flow [2021-03-25 05:10:25,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1080, PETRI_PLACES=73, PETRI_TRANSITIONS=91} [2021-03-25 05:10:25,783 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2021-03-25 05:10:25,783 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:25,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 91 transitions, 1080 flow [2021-03-25 05:10:25,783 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 91 transitions, 1080 flow [2021-03-25 05:10:25,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 91 transitions, 1080 flow [2021-03-25 05:10:25,868 INFO L129 PetriNetUnfolder]: 202/487 cut-off events. [2021-03-25 05:10:25,868 INFO L130 PetriNetUnfolder]: For 3084/3258 co-relation queries the response was YES. [2021-03-25 05:10:25,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 487 events. 202/487 cut-off events. For 3084/3258 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2961 event pairs, 0 based on Foata normal form. 91/567 useless extension candidates. Maximal degree in co-relation 2542. Up to 231 conditions per place. [2021-03-25 05:10:25,877 INFO L142 LiptonReduction]: Number of co-enabled transitions 528 [2021-03-25 05:10:25,926 INFO L154 LiptonReduction]: Checked pairs total: 715 [2021-03-25 05:10:25,926 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:25,927 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-25 05:10:25,927 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 91 transitions, 1080 flow [2021-03-25 05:10:25,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:25,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:25,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:25,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 05:10:25,928 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1725558743, now seen corresponding path program 1 times [2021-03-25 05:10:25,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:25,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338382810] [2021-03-25 05:10:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:26,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:26,017 INFO L142 QuantifierPusher]: treesize reduction 29, result has 56.1 percent of original size [2021-03-25 05:10:26,018 INFO L147 QuantifierPusher]: treesize reduction 8, result has 78.4 percent of original size 29 [2021-03-25 05:10:26,022 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-25 05:10:26,023 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-25 05:10:26,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:26,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:26,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:26,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338382810] [2021-03-25 05:10:26,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:26,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:26,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26417780] [2021-03-25 05:10:26,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:10:26,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:10:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:10:26,081 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-25 05:10:26,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 91 transitions, 1080 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:26,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:26,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-25 05:10:26,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:26,395 INFO L129 PetriNetUnfolder]: 265/634 cut-off events. [2021-03-25 05:10:26,395 INFO L130 PetriNetUnfolder]: For 4454/4702 co-relation queries the response was YES. [2021-03-25 05:10:26,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3614 conditions, 634 events. 265/634 cut-off events. For 4454/4702 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4221 event pairs, 0 based on Foata normal form. 153/775 useless extension candidates. Maximal degree in co-relation 3579. Up to 297 conditions per place. [2021-03-25 05:10:26,402 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 68 selfloop transitions, 44 changer transitions 5/130 dead transitions. [2021-03-25 05:10:26,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 130 transitions, 1764 flow [2021-03-25 05:10:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 05:10:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 05:10:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1163 transitions. [2021-03-25 05:10:26,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7342171717171717 [2021-03-25 05:10:26,406 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1163 transitions. [2021-03-25 05:10:26,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1163 transitions. [2021-03-25 05:10:26,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:26,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1163 transitions. [2021-03-25 05:10:26,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.22222222222223) internal successors, (1163), 9 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:26,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:26,411 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:26,411 INFO L185 Difference]: Start difference. First operand has 73 places, 91 transitions, 1080 flow. Second operand 9 states and 1163 transitions. [2021-03-25 05:10:26,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 130 transitions, 1764 flow [2021-03-25 05:10:26,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 130 transitions, 1712 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-25 05:10:26,424 INFO L241 Difference]: Finished difference. Result has 79 places, 109 transitions, 1427 flow [2021-03-25 05:10:26,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1427, PETRI_PLACES=79, PETRI_TRANSITIONS=109} [2021-03-25 05:10:26,424 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-25 05:10:26,425 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:26,425 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 109 transitions, 1427 flow [2021-03-25 05:10:26,425 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 109 transitions, 1427 flow [2021-03-25 05:10:26,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 109 transitions, 1427 flow [2021-03-25 05:10:26,514 INFO L129 PetriNetUnfolder]: 205/515 cut-off events. [2021-03-25 05:10:26,514 INFO L130 PetriNetUnfolder]: For 4509/4825 co-relation queries the response was YES. [2021-03-25 05:10:26,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 515 events. 205/515 cut-off events. For 4509/4825 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3348 event pairs, 9 based on Foata normal form. 128/632 useless extension candidates. Maximal degree in co-relation 3003. Up to 252 conditions per place. [2021-03-25 05:10:26,523 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-25 05:10:26,582 INFO L154 LiptonReduction]: Checked pairs total: 1257 [2021-03-25 05:10:26,582 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:26,582 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 157 [2021-03-25 05:10:26,584 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 109 transitions, 1427 flow [2021-03-25 05:10:26,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:26,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:26,584 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:26,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 05:10:26,585 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash 953895351, now seen corresponding path program 2 times [2021-03-25 05:10:26,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:26,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101572117] [2021-03-25 05:10:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:26,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:10:26,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 05:10:26,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:26,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 05:10:26,697 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-03-25 05:10:26,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 05:10:26,711 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-03-25 05:10:26,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 05:10:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:26,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101572117] [2021-03-25 05:10:26,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:26,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:26,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220779059] [2021-03-25 05:10:26,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:10:26,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:10:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:10:26,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 176 [2021-03-25 05:10:26,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 109 transitions, 1427 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:26,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:26,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 176 [2021-03-25 05:10:26,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:27,116 INFO L129 PetriNetUnfolder]: 266/654 cut-off events. [2021-03-25 05:10:27,116 INFO L130 PetriNetUnfolder]: For 5598/5904 co-relation queries the response was YES. [2021-03-25 05:10:27,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4096 conditions, 654 events. 266/654 cut-off events. For 5598/5904 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4467 event pairs, 12 based on Foata normal form. 184/826 useless extension candidates. Maximal degree in co-relation 4060. Up to 306 conditions per place. [2021-03-25 05:10:27,124 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 73 selfloop transitions, 55 changer transitions 3/144 dead transitions. [2021-03-25 05:10:27,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 144 transitions, 2091 flow [2021-03-25 05:10:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 05:10:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 05:10:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1254 transitions. [2021-03-25 05:10:27,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7125 [2021-03-25 05:10:27,129 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1254 transitions. [2021-03-25 05:10:27,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1254 transitions. [2021-03-25 05:10:27,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:27,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1254 transitions. [2021-03-25 05:10:27,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.4) internal successors, (1254), 10 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:27,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 176.0) internal successors, (1936), 11 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:27,135 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 176.0) internal successors, (1936), 11 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:27,135 INFO L185 Difference]: Start difference. First operand has 79 places, 109 transitions, 1427 flow. Second operand 10 states and 1254 transitions. [2021-03-25 05:10:27,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 144 transitions, 2091 flow [2021-03-25 05:10:27,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 144 transitions, 2024 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-25 05:10:27,153 INFO L241 Difference]: Finished difference. Result has 88 places, 124 transitions, 1747 flow [2021-03-25 05:10:27,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1747, PETRI_PLACES=88, PETRI_TRANSITIONS=124} [2021-03-25 05:10:27,154 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2021-03-25 05:10:27,154 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:27,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 124 transitions, 1747 flow [2021-03-25 05:10:27,154 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 124 transitions, 1747 flow [2021-03-25 05:10:27,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 124 transitions, 1747 flow [2021-03-25 05:10:27,276 INFO L129 PetriNetUnfolder]: 233/608 cut-off events. [2021-03-25 05:10:27,277 INFO L130 PetriNetUnfolder]: For 5237/5514 co-relation queries the response was YES. [2021-03-25 05:10:27,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3640 conditions, 608 events. 233/608 cut-off events. For 5237/5514 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4208 event pairs, 2 based on Foata normal form. 103/702 useless extension candidates. Maximal degree in co-relation 3603. Up to 296 conditions per place. [2021-03-25 05:10:27,289 INFO L142 LiptonReduction]: Number of co-enabled transitions 674 [2021-03-25 05:10:27,483 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 05:10:27,908 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2021-03-25 05:10:28,052 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-25 05:10:28,194 INFO L154 LiptonReduction]: Checked pairs total: 3079 [2021-03-25 05:10:28,194 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:10:28,194 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1040 [2021-03-25 05:10:28,195 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 124 transitions, 1755 flow [2021-03-25 05:10:28,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:28,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:28,195 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:28,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 05:10:28,196 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1884938519, now seen corresponding path program 3 times [2021-03-25 05:10:28,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:28,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145187806] [2021-03-25 05:10:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:28,271 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 05:10:28,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 05:10:28,306 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-25 05:10:28,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 05:10:28,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:28,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 05:10:28,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:28,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:10:28,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:28,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 05:10:28,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:28,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 05:10:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:28,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145187806] [2021-03-25 05:10:28,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:28,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 05:10:28,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53127714] [2021-03-25 05:10:28,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 05:10:28,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 05:10:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 05:10:28,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 177 [2021-03-25 05:10:28,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 124 transitions, 1755 flow. Second operand has 8 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:28,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:28,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 177 [2021-03-25 05:10:28,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:28,863 INFO L129 PetriNetUnfolder]: 298/750 cut-off events. [2021-03-25 05:10:28,864 INFO L130 PetriNetUnfolder]: For 6712/6987 co-relation queries the response was YES. [2021-03-25 05:10:28,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 750 events. 298/750 cut-off events. For 6712/6987 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5436 event pairs, 4 based on Foata normal form. 192/928 useless extension candidates. Maximal degree in co-relation 4869. Up to 356 conditions per place. [2021-03-25 05:10:28,873 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 73 selfloop transitions, 74 changer transitions 7/167 dead transitions. [2021-03-25 05:10:28,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 167 transitions, 2607 flow [2021-03-25 05:10:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-25 05:10:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-25 05:10:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1820 transitions. [2021-03-25 05:10:28,878 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7344632768361582 [2021-03-25 05:10:28,878 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1820 transitions. [2021-03-25 05:10:28,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1820 transitions. [2021-03-25 05:10:28,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:28,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1820 transitions. [2021-03-25 05:10:28,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 130.0) internal successors, (1820), 14 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:28,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 177.0) internal successors, (2655), 15 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:28,886 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 177.0) internal successors, (2655), 15 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:28,887 INFO L185 Difference]: Start difference. First operand has 88 places, 124 transitions, 1755 flow. Second operand 14 states and 1820 transitions. [2021-03-25 05:10:28,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 167 transitions, 2607 flow [2021-03-25 05:10:28,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 167 transitions, 2574 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 05:10:28,913 INFO L241 Difference]: Finished difference. Result has 104 places, 143 transitions, 2219 flow [2021-03-25 05:10:28,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2219, PETRI_PLACES=104, PETRI_TRANSITIONS=143} [2021-03-25 05:10:28,913 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 57 predicate places. [2021-03-25 05:10:28,913 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:28,913 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 143 transitions, 2219 flow [2021-03-25 05:10:28,914 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 143 transitions, 2219 flow [2021-03-25 05:10:28,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 143 transitions, 2219 flow [2021-03-25 05:10:29,033 INFO L129 PetriNetUnfolder]: 254/653 cut-off events. [2021-03-25 05:10:29,033 INFO L130 PetriNetUnfolder]: For 7610/8058 co-relation queries the response was YES. [2021-03-25 05:10:29,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 653 events. 254/653 cut-off events. For 7610/8058 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4653 event pairs, 6 based on Foata normal form. 151/792 useless extension candidates. Maximal degree in co-relation 4295. Up to 318 conditions per place. [2021-03-25 05:10:29,043 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-25 05:10:29,130 INFO L154 LiptonReduction]: Checked pairs total: 1858 [2021-03-25 05:10:29,130 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:29,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 217 [2021-03-25 05:10:29,130 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 143 transitions, 2219 flow [2021-03-25 05:10:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:29,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:29,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 05:10:29,131 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:29,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1090445204, now seen corresponding path program 1 times [2021-03-25 05:10:29,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:29,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371630184] [2021-03-25 05:10:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:29,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:29,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:29,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:29,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:10:29,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:10:29,240 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.3 percent of original size [2021-03-25 05:10:29,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-03-25 05:10:29,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:10:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:29,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371630184] [2021-03-25 05:10:29,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:29,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:29,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979472229] [2021-03-25 05:10:29,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:10:29,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:10:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:10:29,296 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 177 [2021-03-25 05:10:29,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 143 transitions, 2219 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:29,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 177 [2021-03-25 05:10:29,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:29,602 INFO L129 PetriNetUnfolder]: 292/737 cut-off events. [2021-03-25 05:10:29,602 INFO L130 PetriNetUnfolder]: For 8569/8747 co-relation queries the response was YES. [2021-03-25 05:10:29,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5510 conditions, 737 events. 292/737 cut-off events. For 8569/8747 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5345 event pairs, 4 based on Foata normal form. 59/782 useless extension candidates. Maximal degree in co-relation 5466. Up to 358 conditions per place. [2021-03-25 05:10:29,610 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 58 selfloop transitions, 67 changer transitions 14/152 dead transitions. [2021-03-25 05:10:29,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 152 transitions, 2657 flow [2021-03-25 05:10:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:10:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:10:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2021-03-25 05:10:29,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7137476459510358 [2021-03-25 05:10:29,613 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 758 transitions. [2021-03-25 05:10:29,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions. [2021-03-25 05:10:29,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:29,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions. [2021-03-25 05:10:29,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,617 INFO L185 Difference]: Start difference. First operand has 104 places, 143 transitions, 2219 flow. Second operand 6 states and 758 transitions. [2021-03-25 05:10:29,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 152 transitions, 2657 flow [2021-03-25 05:10:29,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 152 transitions, 2551 flow, removed 33 selfloop flow, removed 5 redundant places. [2021-03-25 05:10:29,648 INFO L241 Difference]: Finished difference. Result has 106 places, 136 transitions, 2223 flow [2021-03-25 05:10:29,648 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2119, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2223, PETRI_PLACES=106, PETRI_TRANSITIONS=136} [2021-03-25 05:10:29,648 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2021-03-25 05:10:29,648 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:29,648 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 136 transitions, 2223 flow [2021-03-25 05:10:29,649 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 136 transitions, 2223 flow [2021-03-25 05:10:29,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 136 transitions, 2223 flow [2021-03-25 05:10:29,744 INFO L129 PetriNetUnfolder]: 194/557 cut-off events. [2021-03-25 05:10:29,744 INFO L130 PetriNetUnfolder]: For 8237/8572 co-relation queries the response was YES. [2021-03-25 05:10:29,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3893 conditions, 557 events. 194/557 cut-off events. For 8237/8572 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4078 event pairs, 5 based on Foata normal form. 141/685 useless extension candidates. Maximal degree in co-relation 3849. Up to 250 conditions per place. [2021-03-25 05:10:29,751 INFO L142 LiptonReduction]: Number of co-enabled transitions 718 [2021-03-25 05:10:29,798 INFO L154 LiptonReduction]: Checked pairs total: 1727 [2021-03-25 05:10:29,798 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:29,799 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 151 [2021-03-25 05:10:29,799 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 136 transitions, 2223 flow [2021-03-25 05:10:29,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:29,800 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:29,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 05:10:29,800 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1110306501, now seen corresponding path program 1 times [2021-03-25 05:10:29,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:29,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994499475] [2021-03-25 05:10:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:29,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:29,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:29,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:29,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:29,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994499475] [2021-03-25 05:10:29,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:29,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:10:29,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549349390] [2021-03-25 05:10:29,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:10:29,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:29,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:10:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:10:29,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 177 [2021-03-25 05:10:29,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 136 transitions, 2223 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:29,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:29,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 177 [2021-03-25 05:10:29,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:30,058 INFO L129 PetriNetUnfolder]: 377/892 cut-off events. [2021-03-25 05:10:30,058 INFO L130 PetriNetUnfolder]: For 9057/9374 co-relation queries the response was YES. [2021-03-25 05:10:30,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 892 events. 377/892 cut-off events. For 9057/9374 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 6491 event pairs, 122 based on Foata normal form. 281/1110 useless extension candidates. Maximal degree in co-relation 4012. Up to 523 conditions per place. [2021-03-25 05:10:30,065 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 14 selfloop transitions, 8 changer transitions 1/96 dead transitions. [2021-03-25 05:10:30,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 96 transitions, 1416 flow [2021-03-25 05:10:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:10:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:10:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-25 05:10:30,069 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564971751412429 [2021-03-25 05:10:30,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-25 05:10:30,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-25 05:10:30,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:30,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-25 05:10:30,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:30,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:30,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:30,073 INFO L185 Difference]: Start difference. First operand has 106 places, 136 transitions, 2223 flow. Second operand 5 states and 758 transitions. [2021-03-25 05:10:30,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 96 transitions, 1416 flow [2021-03-25 05:10:30,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 1349 flow, removed 8 selfloop flow, removed 14 redundant places. [2021-03-25 05:10:30,092 INFO L241 Difference]: Finished difference. Result has 95 places, 92 transitions, 1349 flow [2021-03-25 05:10:30,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1349, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2021-03-25 05:10:30,092 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2021-03-25 05:10:30,092 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:30,092 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 92 transitions, 1349 flow [2021-03-25 05:10:30,093 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 92 transitions, 1349 flow [2021-03-25 05:10:30,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 1349 flow [2021-03-25 05:10:30,226 INFO L129 PetriNetUnfolder]: 385/915 cut-off events. [2021-03-25 05:10:30,226 INFO L130 PetriNetUnfolder]: For 7891/8226 co-relation queries the response was YES. [2021-03-25 05:10:30,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 915 events. 385/915 cut-off events. For 7891/8226 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 6811 event pairs, 114 based on Foata normal form. 101/937 useless extension candidates. Maximal degree in co-relation 4703. Up to 521 conditions per place. [2021-03-25 05:10:30,235 INFO L142 LiptonReduction]: Number of co-enabled transitions 654 [2021-03-25 05:10:30,423 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 05:10:30,810 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-25 05:10:30,941 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 05:10:31,906 WARN L205 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-25 05:10:32,325 WARN L205 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 05:10:34,641 WARN L205 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-25 05:10:35,701 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-25 05:10:36,539 WARN L205 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 165 [2021-03-25 05:10:36,781 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 05:10:38,534 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 365 DAG size of output: 243 [2021-03-25 05:10:39,066 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-25 05:10:39,900 WARN L205 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 172 [2021-03-25 05:10:40,126 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-25 05:10:42,019 WARN L205 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 377 DAG size of output: 270 [2021-03-25 05:10:42,687 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2021-03-25 05:10:42,698 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-25 05:10:42,698 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 05:10:42,698 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12606 [2021-03-25 05:10:42,698 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 1370 flow [2021-03-25 05:10:42,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:42,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:42,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:42,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 05:10:42,699 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2076255121, now seen corresponding path program 1 times [2021-03-25 05:10:42,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:42,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496816136] [2021-03-25 05:10:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:42,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:42,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:10:42,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:42,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:10:42,806 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-03-25 05:10:42,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-25 05:10:42,848 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 05:10:42,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 05:10:42,872 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size [2021-03-25 05:10:42,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 05:10:42,904 INFO L142 QuantifierPusher]: treesize reduction 4, result has 84.0 percent of original size [2021-03-25 05:10:42,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 05:10:42,929 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.8 percent of original size [2021-03-25 05:10:42,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 05:10:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:42,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496816136] [2021-03-25 05:10:42,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:42,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 05:10:42,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940791592] [2021-03-25 05:10:42,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 05:10:42,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 05:10:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-25 05:10:42,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 181 [2021-03-25 05:10:42,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 1370 flow. Second operand has 9 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:42,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:42,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 181 [2021-03-25 05:10:42,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:43,539 INFO L129 PetriNetUnfolder]: 556/1258 cut-off events. [2021-03-25 05:10:43,539 INFO L130 PetriNetUnfolder]: For 13514/14035 co-relation queries the response was YES. [2021-03-25 05:10:43,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7034 conditions, 1258 events. 556/1258 cut-off events. For 13514/14035 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 9692 event pairs, 162 based on Foata normal form. 166/1306 useless extension candidates. Maximal degree in co-relation 6990. Up to 732 conditions per place. [2021-03-25 05:10:43,550 INFO L132 encePairwiseOnDemand]: 170/181 looper letters, 58 selfloop transitions, 31 changer transitions 8/117 dead transitions. [2021-03-25 05:10:43,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 117 transitions, 1969 flow [2021-03-25 05:10:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 05:10:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 05:10:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1190 transitions. [2021-03-25 05:10:43,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6574585635359116 [2021-03-25 05:10:43,555 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1190 transitions. [2021-03-25 05:10:43,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1190 transitions. [2021-03-25 05:10:43,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:43,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1190 transitions. [2021-03-25 05:10:43,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:43,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:43,561 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:43,561 INFO L185 Difference]: Start difference. First operand has 95 places, 92 transitions, 1370 flow. Second operand 10 states and 1190 transitions. [2021-03-25 05:10:43,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 117 transitions, 1969 flow [2021-03-25 05:10:43,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 117 transitions, 1910 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-25 05:10:43,586 INFO L241 Difference]: Finished difference. Result has 105 places, 104 transitions, 1643 flow [2021-03-25 05:10:43,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1643, PETRI_PLACES=105, PETRI_TRANSITIONS=104} [2021-03-25 05:10:43,586 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2021-03-25 05:10:43,586 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:43,586 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 104 transitions, 1643 flow [2021-03-25 05:10:43,587 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 104 transitions, 1643 flow [2021-03-25 05:10:43,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 104 transitions, 1643 flow [2021-03-25 05:10:43,711 INFO L129 PetriNetUnfolder]: 400/986 cut-off events. [2021-03-25 05:10:43,712 INFO L130 PetriNetUnfolder]: For 9674/10158 co-relation queries the response was YES. [2021-03-25 05:10:43,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 986 events. 400/986 cut-off events. For 9674/10158 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 7706 event pairs, 116 based on Foata normal form. 154/1055 useless extension candidates. Maximal degree in co-relation 5177. Up to 555 conditions per place. [2021-03-25 05:10:43,723 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-25 05:10:43,730 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:10:43,730 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:43,730 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-25 05:10:43,730 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 1643 flow [2021-03-25 05:10:43,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:43,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:43,731 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:43,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 05:10:43,731 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1659326808, now seen corresponding path program 1 times [2021-03-25 05:10:43,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:43,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590783307] [2021-03-25 05:10:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:43,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:43,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:43,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:43,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:43,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:43,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:43,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:43,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:43,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590783307] [2021-03-25 05:10:43,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:43,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:10:43,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074178350] [2021-03-25 05:10:43,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:10:43,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:10:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:10:43,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2021-03-25 05:10:43,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 1643 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:43,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:43,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2021-03-25 05:10:43,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:43,996 INFO L129 PetriNetUnfolder]: 238/736 cut-off events. [2021-03-25 05:10:43,997 INFO L130 PetriNetUnfolder]: For 9370/10831 co-relation queries the response was YES. [2021-03-25 05:10:44,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 736 events. 238/736 cut-off events. For 9370/10831 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 5946 event pairs, 18 based on Foata normal form. 635/1321 useless extension candidates. Maximal degree in co-relation 3963. Up to 448 conditions per place. [2021-03-25 05:10:44,003 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 15 changer transitions 3/100 dead transitions. [2021-03-25 05:10:44,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 1540 flow [2021-03-25 05:10:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:10:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:10:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-03-25 05:10:44,007 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8595106550907656 [2021-03-25 05:10:44,007 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-03-25 05:10:44,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-03-25 05:10:44,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:44,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-03-25 05:10:44,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,011 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,011 INFO L185 Difference]: Start difference. First operand has 104 places, 104 transitions, 1643 flow. Second operand 7 states and 1089 transitions. [2021-03-25 05:10:44,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 1540 flow [2021-03-25 05:10:44,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 1433 flow, removed 26 selfloop flow, removed 10 redundant places. [2021-03-25 05:10:44,030 INFO L241 Difference]: Finished difference. Result has 102 places, 97 transitions, 1428 flow [2021-03-25 05:10:44,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1428, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2021-03-25 05:10:44,030 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2021-03-25 05:10:44,030 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:44,030 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 1428 flow [2021-03-25 05:10:44,030 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 1428 flow [2021-03-25 05:10:44,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 1428 flow [2021-03-25 05:10:44,130 INFO L129 PetriNetUnfolder]: 214/699 cut-off events. [2021-03-25 05:10:44,130 INFO L130 PetriNetUnfolder]: For 7381/7923 co-relation queries the response was YES. [2021-03-25 05:10:44,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 699 events. 214/699 cut-off events. For 7381/7923 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 5845 event pairs, 18 based on Foata normal form. 87/749 useless extension candidates. Maximal degree in co-relation 3979. Up to 412 conditions per place. [2021-03-25 05:10:44,140 INFO L142 LiptonReduction]: Number of co-enabled transitions 756 [2021-03-25 05:10:44,171 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-25 05:10:44,172 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:10:44,172 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 142 [2021-03-25 05:10:44,173 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 1412 flow [2021-03-25 05:10:44,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,173 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:44,173 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:44,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 05:10:44,173 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1047035874, now seen corresponding path program 1 times [2021-03-25 05:10:44,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:44,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885063724] [2021-03-25 05:10:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:44,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:44,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:44,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:44,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:44,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:44,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:10:44,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:44,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:44,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:44,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:10:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:44,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885063724] [2021-03-25 05:10:44,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:44,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:44,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77599434] [2021-03-25 05:10:44,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:10:44,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:44,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:10:44,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:10:44,249 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2021-03-25 05:10:44,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 1412 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:44,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2021-03-25 05:10:44,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:44,379 INFO L129 PetriNetUnfolder]: 112/373 cut-off events. [2021-03-25 05:10:44,379 INFO L130 PetriNetUnfolder]: For 4961/5203 co-relation queries the response was YES. [2021-03-25 05:10:44,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 373 events. 112/373 cut-off events. For 4961/5203 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2411 event pairs, 0 based on Foata normal form. 127/485 useless extension candidates. Maximal degree in co-relation 2411. Up to 200 conditions per place. [2021-03-25 05:10:44,382 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 11 changer transitions 7/93 dead transitions. [2021-03-25 05:10:44,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 93 transitions, 1417 flow [2021-03-25 05:10:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:10:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:10:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1082 transitions. [2021-03-25 05:10:44,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8539857932123125 [2021-03-25 05:10:44,385 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1082 transitions. [2021-03-25 05:10:44,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1082 transitions. [2021-03-25 05:10:44,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:44,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1082 transitions. [2021-03-25 05:10:44,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:44,390 INFO L185 Difference]: Start difference. First operand has 102 places, 95 transitions, 1412 flow. Second operand 7 states and 1082 transitions. [2021-03-25 05:10:44,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 93 transitions, 1417 flow [2021-03-25 05:10:44,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 1365 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-03-25 05:10:44,409 INFO L241 Difference]: Finished difference. Result has 101 places, 86 transitions, 1289 flow [2021-03-25 05:10:44,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1289, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2021-03-25 05:10:44,409 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 54 predicate places. [2021-03-25 05:10:44,409 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:44,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 86 transitions, 1289 flow [2021-03-25 05:10:44,412 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 86 transitions, 1289 flow [2021-03-25 05:10:44,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 86 transitions, 1289 flow [2021-03-25 05:10:44,461 INFO L129 PetriNetUnfolder]: 96/345 cut-off events. [2021-03-25 05:10:44,461 INFO L130 PetriNetUnfolder]: For 3188/3297 co-relation queries the response was YES. [2021-03-25 05:10:44,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 345 events. 96/345 cut-off events. For 3188/3297 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2316 event pairs, 0 based on Foata normal form. 31/367 useless extension candidates. Maximal degree in co-relation 2128. Up to 113 conditions per place. [2021-03-25 05:10:44,465 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 05:10:45,410 WARN L205 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-25 05:10:45,703 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 05:10:48,430 WARN L205 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 338 DAG size of output: 264 [2021-03-25 05:10:49,134 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 05:10:49,506 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 05:10:49,794 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 05:10:50,526 WARN L205 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 05:10:51,267 WARN L205 SmtUtils]: Spent 739.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 05:10:51,274 INFO L154 LiptonReduction]: Checked pairs total: 11 [2021-03-25 05:10:51,274 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 05:10:51,274 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6865 [2021-03-25 05:10:51,274 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 1275 flow [2021-03-25 05:10:51,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:51,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:51,275 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:51,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 05:10:51,275 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash -953634624, now seen corresponding path program 1 times [2021-03-25 05:10:51,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:51,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432571278] [2021-03-25 05:10:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:51,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:51,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:51,356 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 05:10:51,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 05:10:51,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:10:51,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:51,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432571278] [2021-03-25 05:10:51,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:51,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:51,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065218308] [2021-03-25 05:10:51,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:10:51,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:10:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:10:51,427 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 183 [2021-03-25 05:10:51,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 1275 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:51,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:51,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 183 [2021-03-25 05:10:51,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:51,776 INFO L129 PetriNetUnfolder]: 111/342 cut-off events. [2021-03-25 05:10:51,776 INFO L130 PetriNetUnfolder]: For 3526/3625 co-relation queries the response was YES. [2021-03-25 05:10:51,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 342 events. 111/342 cut-off events. For 3526/3625 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2222 event pairs, 0 based on Foata normal form. 57/382 useless extension candidates. Maximal degree in co-relation 2282. Up to 109 conditions per place. [2021-03-25 05:10:51,778 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 40 selfloop transitions, 21 changer transitions 12/91 dead transitions. [2021-03-25 05:10:51,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 91 transitions, 1548 flow [2021-03-25 05:10:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 05:10:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 05:10:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2021-03-25 05:10:51,785 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6715846994535519 [2021-03-25 05:10:51,785 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2021-03-25 05:10:51,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2021-03-25 05:10:51,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:51,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2021-03-25 05:10:51,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.9) internal successors, (1229), 10 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:51,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:51,794 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:51,794 INFO L185 Difference]: Start difference. First operand has 96 places, 83 transitions, 1275 flow. Second operand 10 states and 1229 transitions. [2021-03-25 05:10:51,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 91 transitions, 1548 flow [2021-03-25 05:10:51,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 1495 flow, removed 15 selfloop flow, removed 9 redundant places. [2021-03-25 05:10:51,810 INFO L241 Difference]: Finished difference. Result has 99 places, 79 transitions, 1245 flow [2021-03-25 05:10:51,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1245, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2021-03-25 05:10:51,811 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2021-03-25 05:10:51,811 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:51,811 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 79 transitions, 1245 flow [2021-03-25 05:10:51,811 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 79 transitions, 1245 flow [2021-03-25 05:10:51,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 79 transitions, 1245 flow [2021-03-25 05:10:51,857 INFO L129 PetriNetUnfolder]: 93/291 cut-off events. [2021-03-25 05:10:51,857 INFO L130 PetriNetUnfolder]: For 3000/3088 co-relation queries the response was YES. [2021-03-25 05:10:51,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 291 events. 93/291 cut-off events. For 3000/3088 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1773 event pairs, 0 based on Foata normal form. 38/315 useless extension candidates. Maximal degree in co-relation 1727. Up to 81 conditions per place. [2021-03-25 05:10:51,860 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-25 05:10:51,862 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:10:51,862 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:10:51,862 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-25 05:10:51,862 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 1245 flow [2021-03-25 05:10:51,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:51,863 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:10:51,863 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:10:51,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 05:10:51,863 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:10:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:10:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1266612606, now seen corresponding path program 1 times [2021-03-25 05:10:51,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:10:51,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163152959] [2021-03-25 05:10:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:10:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:10:51,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:51,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:10:51,946 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-25 05:10:51,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 05:10:51,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:51,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:10:52,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:52,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:10:52,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:10:52,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:10:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:10:52,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163152959] [2021-03-25 05:10:52,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:10:52,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:10:52,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429857072] [2021-03-25 05:10:52,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:10:52,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:10:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:10:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:10:52,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 183 [2021-03-25 05:10:52,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 1245 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:52,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:10:52,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 183 [2021-03-25 05:10:52,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:10:52,478 INFO L129 PetriNetUnfolder]: 109/339 cut-off events. [2021-03-25 05:10:52,478 INFO L130 PetriNetUnfolder]: For 3604/3671 co-relation queries the response was YES. [2021-03-25 05:10:52,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 339 events. 109/339 cut-off events. For 3604/3671 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2203 event pairs, 0 based on Foata normal form. 44/365 useless extension candidates. Maximal degree in co-relation 2016. Up to 94 conditions per place. [2021-03-25 05:10:52,481 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 11 selfloop transitions, 23 changer transitions 35/85 dead transitions. [2021-03-25 05:10:52,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 85 transitions, 1474 flow [2021-03-25 05:10:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 05:10:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 05:10:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1186 transitions. [2021-03-25 05:10:52,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6480874316939891 [2021-03-25 05:10:52,485 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1186 transitions. [2021-03-25 05:10:52,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1186 transitions. [2021-03-25 05:10:52,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:10:52,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1186 transitions. [2021-03-25 05:10:52,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.6) internal successors, (1186), 10 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:52,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:52,490 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:10:52,490 INFO L185 Difference]: Start difference. First operand has 94 places, 79 transitions, 1245 flow. Second operand 10 states and 1186 transitions. [2021-03-25 05:10:52,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 85 transitions, 1474 flow [2021-03-25 05:10:52,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 85 transitions, 1384 flow, removed 20 selfloop flow, removed 8 redundant places. [2021-03-25 05:10:52,505 INFO L241 Difference]: Finished difference. Result has 97 places, 50 transitions, 735 flow [2021-03-25 05:10:52,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=735, PETRI_PLACES=97, PETRI_TRANSITIONS=50} [2021-03-25 05:10:52,505 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2021-03-25 05:10:52,505 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:10:52,506 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 50 transitions, 735 flow [2021-03-25 05:10:52,506 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 50 transitions, 735 flow [2021-03-25 05:10:52,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 50 transitions, 735 flow [2021-03-25 05:10:52,530 INFO L129 PetriNetUnfolder]: 14/65 cut-off events. [2021-03-25 05:10:52,531 INFO L130 PetriNetUnfolder]: For 866/874 co-relation queries the response was YES. [2021-03-25 05:10:52,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 65 events. 14/65 cut-off events. For 866/874 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 190 event pairs, 0 based on Foata normal form. 4/68 useless extension candidates. Maximal degree in co-relation 414. Up to 20 conditions per place. [2021-03-25 05:10:52,532 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-25 05:10:54,749 WARN L205 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-25 05:10:55,330 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 05:10:58,959 WARN L205 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-25 05:11:00,511 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-25 05:11:01,860 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 05:11:02,481 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 05:11:05,219 WARN L205 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 05:11:06,437 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 05:11:08,383 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 05:11:09,076 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 05:11:12,113 WARN L205 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:11:13,500 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:11:15,292 WARN L205 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 05:11:16,184 WARN L205 SmtUtils]: Spent 890.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 05:11:19,834 WARN L205 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:11:21,351 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:11:23,669 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 05:11:24,833 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 05:11:29,084 WARN L205 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:11:31,008 WARN L205 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:11:33,394 WARN L205 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:11:34,375 WARN L205 SmtUtils]: Spent 978.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:11:39,024 WARN L205 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:11:41,099 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:11:43,421 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 05:11:44,447 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:11:49,871 WARN L205 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 05:11:51,817 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 05:11:55,404 WARN L205 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 05:11:56,896 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 204 [2021-03-25 05:12:03,878 WARN L205 SmtUtils]: Spent 6.98 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-25 05:12:06,875 WARN L205 SmtUtils]: Spent 2.99 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-25 05:12:07,871 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-25 05:12:07,871 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 05:12:07,871 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75366 [2021-03-25 05:12:07,872 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 48 transitions, 779 flow [2021-03-25 05:12:07,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:07,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:12:07,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:12:07,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 05:12:07,873 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:12:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:12:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1447708870, now seen corresponding path program 2 times [2021-03-25 05:12:07,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:12:07,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41885773] [2021-03-25 05:12:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:12:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:12:07,939 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:12:07,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:12:08,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:12:08,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:12:08,074 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 05:12:08,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 05:12:08,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:12:08,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:12:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:12:08,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41885773] [2021-03-25 05:12:08,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:12:08,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:12:08,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887513957] [2021-03-25 05:12:08,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:12:08,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:12:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:12:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:12:08,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 194 [2021-03-25 05:12:08,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 48 transitions, 779 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:08,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:12:08,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 194 [2021-03-25 05:12:08,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:12:08,594 INFO L129 PetriNetUnfolder]: 20/77 cut-off events. [2021-03-25 05:12:08,595 INFO L130 PetriNetUnfolder]: For 1049/1066 co-relation queries the response was YES. [2021-03-25 05:12:08,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 77 events. 20/77 cut-off events. For 1049/1066 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 271 event pairs, 0 based on Foata normal form. 10/84 useless extension candidates. Maximal degree in co-relation 538. Up to 26 conditions per place. [2021-03-25 05:12:08,596 INFO L132 encePairwiseOnDemand]: 182/194 looper letters, 20 selfloop transitions, 5 changer transitions 13/52 dead transitions. [2021-03-25 05:12:08,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 52 transitions, 927 flow [2021-03-25 05:12:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:12:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:12:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2021-03-25 05:12:08,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6435935198821797 [2021-03-25 05:12:08,602 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2021-03-25 05:12:08,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2021-03-25 05:12:08,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:12:08,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2021-03-25 05:12:08,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:08,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:08,606 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:08,606 INFO L185 Difference]: Start difference. First operand has 93 places, 48 transitions, 779 flow. Second operand 7 states and 874 transitions. [2021-03-25 05:12:08,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 52 transitions, 927 flow [2021-03-25 05:12:08,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 52 transitions, 605 flow, removed 49 selfloop flow, removed 28 redundant places. [2021-03-25 05:12:08,612 INFO L241 Difference]: Finished difference. Result has 72 places, 39 transitions, 388 flow [2021-03-25 05:12:08,612 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2021-03-25 05:12:08,612 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2021-03-25 05:12:08,612 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:12:08,613 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 39 transitions, 388 flow [2021-03-25 05:12:08,613 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 39 transitions, 388 flow [2021-03-25 05:12:08,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 39 transitions, 388 flow [2021-03-25 05:12:08,622 INFO L129 PetriNetUnfolder]: 11/48 cut-off events. [2021-03-25 05:12:08,622 INFO L130 PetriNetUnfolder]: For 175/179 co-relation queries the response was YES. [2021-03-25 05:12:08,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 48 events. 11/48 cut-off events. For 175/179 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 3/50 useless extension candidates. Maximal degree in co-relation 221. Up to 15 conditions per place. [2021-03-25 05:12:08,622 INFO L142 LiptonReduction]: Number of co-enabled transitions 42 [2021-03-25 05:12:08,623 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:12:08,624 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:12:08,624 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 05:12:08,624 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 39 transitions, 388 flow [2021-03-25 05:12:08,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:08,624 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:12:08,624 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:12:08,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 05:12:08,625 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:12:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:12:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash 566243456, now seen corresponding path program 1 times [2021-03-25 05:12:08,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:12:08,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119779558] [2021-03-25 05:12:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:12:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:12:08,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:12:08,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:12:08,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:12:08,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:12:08,730 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 05:12:08,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 05:12:08,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:12:08,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:12:08,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:12:08,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:12:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:12:08,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119779558] [2021-03-25 05:12:08,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:12:08,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:12:08,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767024772] [2021-03-25 05:12:08,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:12:08,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:12:08,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:12:08,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:12:08,873 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 194 [2021-03-25 05:12:08,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 39 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:08,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:12:08,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 194 [2021-03-25 05:12:08,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:12:09,114 INFO L129 PetriNetUnfolder]: 16/64 cut-off events. [2021-03-25 05:12:09,114 INFO L130 PetriNetUnfolder]: For 260/269 co-relation queries the response was YES. [2021-03-25 05:12:09,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 64 events. 16/64 cut-off events. For 260/269 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 176 event pairs, 0 based on Foata normal form. 8/70 useless extension candidates. Maximal degree in co-relation 295. Up to 18 conditions per place. [2021-03-25 05:12:09,115 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 16 selfloop transitions, 2 changer transitions 9/41 dead transitions. [2021-03-25 05:12:09,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 41 transitions, 457 flow [2021-03-25 05:12:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:12:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:12:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2021-03-25 05:12:09,120 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6305841924398625 [2021-03-25 05:12:09,120 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2021-03-25 05:12:09,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2021-03-25 05:12:09,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:12:09,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2021-03-25 05:12:09,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:09,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:09,124 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:09,124 INFO L185 Difference]: Start difference. First operand has 68 places, 39 transitions, 388 flow. Second operand 6 states and 734 transitions. [2021-03-25 05:12:09,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 41 transitions, 457 flow [2021-03-25 05:12:09,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 41 transitions, 405 flow, removed 6 selfloop flow, removed 11 redundant places. [2021-03-25 05:12:09,127 INFO L241 Difference]: Finished difference. Result has 63 places, 32 transitions, 265 flow [2021-03-25 05:12:09,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=63, PETRI_TRANSITIONS=32} [2021-03-25 05:12:09,127 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2021-03-25 05:12:09,127 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:12:09,127 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 32 transitions, 265 flow [2021-03-25 05:12:09,127 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 32 transitions, 265 flow [2021-03-25 05:12:09,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 32 transitions, 265 flow [2021-03-25 05:12:09,135 INFO L129 PetriNetUnfolder]: 9/40 cut-off events. [2021-03-25 05:12:09,135 INFO L130 PetriNetUnfolder]: For 127/131 co-relation queries the response was YES. [2021-03-25 05:12:09,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 40 events. 9/40 cut-off events. For 127/131 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 3/42 useless extension candidates. Maximal degree in co-relation 159. Up to 12 conditions per place. [2021-03-25 05:12:09,135 INFO L142 LiptonReduction]: Number of co-enabled transitions 32 [2021-03-25 05:12:09,136 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:12:09,136 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:12:09,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 05:12:09,137 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 32 transitions, 265 flow [2021-03-25 05:12:09,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:12:09,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:12:09,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:12:09,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 05:12:09,138 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:12:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:12:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1631703184, now seen corresponding path program 1 times [2021-03-25 05:12:09,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:12:09,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653328251] [2021-03-25 05:12:09,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:12:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:12:09,181 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:12:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:12:09,230 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:12:09,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:12:09,271 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:12:09,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 05:12:09,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:12:09 BasicIcfg [2021-03-25 05:12:09,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:12:09,343 INFO L168 Benchmark]: Toolchain (without parser) took 126101.88 ms. Allocated memory was 352.3 MB in the beginning and 1.0 GB in the end (delta: 696.3 MB). Free memory was 315.5 MB in the beginning and 784.5 MB in the end (delta: -469.0 MB). Peak memory consumption was 230.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:12:09,343 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 352.3 MB. Free memory was 333.9 MB in the beginning and 333.8 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:12:09,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.78 ms. Allocated memory is still 352.3 MB. Free memory was 315.3 MB in the beginning and 308.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.0 GB. [2021-03-25 05:12:09,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.94 ms. Allocated memory is still 352.3 MB. Free memory was 308.7 MB in the beginning and 305.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:12:09,343 INFO L168 Benchmark]: Boogie Preprocessor took 34.44 ms. Allocated memory is still 352.3 MB. Free memory was 305.6 MB in the beginning and 302.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 05:12:09,343 INFO L168 Benchmark]: RCFGBuilder took 3118.37 ms. Allocated memory was 352.3 MB in the beginning and 423.6 MB in the end (delta: 71.3 MB). Free memory was 302.4 MB in the beginning and 307.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 172.3 MB. Max. memory is 16.0 GB. [2021-03-25 05:12:09,343 INFO L168 Benchmark]: TraceAbstraction took 122354.29 ms. Allocated memory was 423.6 MB in the beginning and 1.0 GB in the end (delta: 625.0 MB). Free memory was 307.4 MB in the beginning and 784.5 MB in the end (delta: -477.2 MB). Peak memory consumption was 148.8 MB. Max. memory is 16.0 GB. [2021-03-25 05:12:09,344 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.56 ms. Allocated memory is still 352.3 MB. Free memory was 333.9 MB in the beginning and 333.8 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 539.78 ms. Allocated memory is still 352.3 MB. Free memory was 315.3 MB in the beginning and 308.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.94 ms. Allocated memory is still 352.3 MB. Free memory was 308.7 MB in the beginning and 305.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.44 ms. Allocated memory is still 352.3 MB. Free memory was 305.6 MB in the beginning and 302.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3118.37 ms. Allocated memory was 352.3 MB in the beginning and 423.6 MB in the end (delta: 71.3 MB). Free memory was 302.4 MB in the beginning and 307.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 172.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 122354.29 ms. Allocated memory was 423.6 MB in the beginning and 1.0 GB in the end (delta: 625.0 MB). Free memory was 307.4 MB in the beginning and 784.5 MB in the end (delta: -477.2 MB). Peak memory consumption was 148.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5614.2ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1371, positive: 1282, positive conditional: 0, positive unconditional: 1282, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 810, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 810, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1371, positive: 497, positive conditional: 0, positive unconditional: 497, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 810, unknown conditional: 0, unknown unconditional: 810] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6247.3ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 310, positive: 227, positive conditional: 0, positive unconditional: 227, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 310, positive: 193, positive conditional: 0, positive unconditional: 193, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1191.2ms, 36 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 738 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 189, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 99 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.6ms, 42 PlacesBefore, 42 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 232 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 341 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.2ms, 52 PlacesBefore, 52 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 314 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 20, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.3ms, 55 PlacesBefore, 55 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 621 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 41, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 200.0ms, 66 PlacesBefore, 66 PlacesAfterwards, 109 TransitionsBefore, 108 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2695 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 71, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 170.8ms, 71 PlacesBefore, 71 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.3ms, 73 PlacesBefore, 73 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 715 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.4ms, 79 PlacesBefore, 79 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 56, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1040.3ms, 88 PlacesBefore, 88 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3079 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 97, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 216.2ms, 104 PlacesBefore, 104 PlacesAfterwards, 143 TransitionsBefore, 143 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1858 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 205, positive: 159, positive conditional: 0, positive unconditional: 159, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 205, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 149.8ms, 106 PlacesBefore, 106 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 718 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1727 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 65, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12605.2ms, 95 PlacesBefore, 95 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.4ms, 105 PlacesBefore, 104 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 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): 55, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 141.2ms, 102 PlacesBefore, 102 PlacesAfterwards, 97 TransitionsBefore, 95 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 110, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6862.3ms, 101 PlacesBefore, 96 PlacesAfterwards, 86 TransitionsBefore, 83 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 11 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.9ms, 99 PlacesBefore, 94 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 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): 39, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75365.5ms, 97 PlacesBefore, 93 PlacesAfterwards, 50 TransitionsBefore, 48 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 29, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8ms, 72 PlacesBefore, 68 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 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): 35, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 63 PlacesBefore, 56 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 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): 35, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2543; [L850] FCALL, FORK 0 pthread_create(&t2543, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L851] 0 pthread_t t2544; [L852] FCALL, FORK 0 pthread_create(&t2544, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L853] 0 pthread_t t2545; [L854] FCALL, FORK 0 pthread_create(&t2545, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, 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_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L775] 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) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] 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) [L775] 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) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 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 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L798] 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) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] 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) [L798] 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) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 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 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 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 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 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 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 122113.2ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6854.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5709.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 99 SDtfs, 73 SDslu, 47 SDs, 0 SdLazy, 1064 SolverSat, 395 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1999.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 3009.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2223occurred in iteration=15, InterpolantAutomatonStates: 153, 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: 89.7ms SsaConstructionTime, 744.5ms SatisfiabilityAnalysisTime, 3280.0ms InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 3710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...