/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:37:29,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:37:29,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:37:29,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:37:29,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:37:29,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:37:29,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:37:29,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:37:29,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:37:29,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:37:29,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:37:29,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:37:29,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:37:29,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:37:29,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:37:29,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:37:29,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:37:29,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:37:29,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:37:29,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:37:29,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:37:29,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:37:29,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:37:29,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:37:29,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:37:29,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:37:29,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:37:29,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:37:29,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:37:29,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:37:29,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:37:29,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:37:29,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:37:29,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:37:29,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:37:29,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:37:29,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:37:29,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:37:29,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:37:29,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:37:29,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:37:29,233 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:37:29,252 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:37:29,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:37:29,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:37:29,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:37:29,255 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:37:29,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:37:29,255 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:37:29,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:37:29,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:37:29,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:37:29,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:37:29,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:37:29,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:37:29,256 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:37:29,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:37:29,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:37:29,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:37:29,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:37:29,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:37:29,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:37:29,258 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:37:29,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:37:29,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:37:29,258 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:37:29,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:37:29,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:37:29,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:37:29,476 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:37:29,477 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:37:29,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2021-03-26 00:37:29,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9278f42/5d0535a2b90f4292a4535816f58121a6/FLAG18d2432ca [2021-03-26 00:37:29,916 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:37:29,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2021-03-26 00:37:29,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9278f42/5d0535a2b90f4292a4535816f58121a6/FLAG18d2432ca [2021-03-26 00:37:30,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9278f42/5d0535a2b90f4292a4535816f58121a6 [2021-03-26 00:37:30,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:37:30,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:37:30,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:37:30,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:37:30,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:37:30,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713ae5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30, skipping insertion in model container [2021-03-26 00:37:30,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:37:30,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:37:30,413 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/safe008_pso.oepc.i[950,963] [2021-03-26 00:37:30,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:37:30,559 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:37:30,566 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/safe008_pso.oepc.i[950,963] [2021-03-26 00:37:30,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:37:30,631 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:37:30,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30 WrapperNode [2021-03-26 00:37:30,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:37:30,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:37:30,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:37:30,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:37:30,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:37:30,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:37:30,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:37:30,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:37:30,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... [2021-03-26 00:37:30,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:37:30,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:37:30,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:37:30,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:37:30,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:37:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:37:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:37:30,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:37:30,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:37:30,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:37:30,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:37:30,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:37:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:37:30,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:37:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:37:30,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:37:30,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:37:30,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:37:30,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:37:30,749 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:37:31,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:37:31,957 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:37:31,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:37:31 BoogieIcfgContainer [2021-03-26 00:37:31,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:37:31,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:37:31,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:37:31,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:37:31,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:37:30" (1/3) ... [2021-03-26 00:37:31,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed83d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:37:31, skipping insertion in model container [2021-03-26 00:37:31,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:37:30" (2/3) ... [2021-03-26 00:37:31,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed83d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:37:31, skipping insertion in model container [2021-03-26 00:37:31,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:37:31" (3/3) ... [2021-03-26 00:37:31,964 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2021-03-26 00:37:31,969 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:37:31,971 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:37:31,972 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:37:31,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:31,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,000 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,000 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,011 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,014 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,020 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,020 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:37:32,021 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:37:32,032 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:37:32,044 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:37:32,044 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:37:32,044 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:37:32,044 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:37:32,045 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:37:32,045 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:37:32,045 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:37:32,045 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:37:32,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 00:37:32,072 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 00:37:32,072 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:32,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:37:32,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 00:37:32,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:32,078 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:32,086 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:32,088 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:32,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-26 00:37:32,100 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 00:37:32,100 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:32,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:37:32,103 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 00:37:32,864 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 00:37:33,222 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 00:37:34,467 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 00:37:35,020 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:37:35,886 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:37:36,229 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:37:36,342 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:37:37,279 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:37:37,536 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:37:38,106 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:37:38,660 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:37:38,785 INFO L154 LiptonReduction]: Checked pairs total: 3189 [2021-03-26 00:37:38,785 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:37:38,786 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6708 [2021-03-26 00:37:38,792 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:37:38,793 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:38,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:38,793 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:38,793 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash -351657079, now seen corresponding path program 1 times [2021-03-26 00:37:38,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:38,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148522861] [2021-03-26 00:37:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:38,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:38,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:38,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:38,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:38,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148522861] [2021-03-26 00:37:38,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:38,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:37:38,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036796353] [2021-03-26 00:37:38,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:37:38,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:38,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:37:38,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:37:38,980 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 162 [2021-03-26 00:37:38,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:38,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:38,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 162 [2021-03-26 00:37:38,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:39,070 INFO L129 PetriNetUnfolder]: 69/188 cut-off events. [2021-03-26 00:37:39,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:39,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 188 events. 69/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 906 event pairs, 13 based on Foata normal form. 11/181 useless extension candidates. Maximal degree in co-relation 294. Up to 89 conditions per place. [2021-03-26 00:37:39,072 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 9 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2021-03-26 00:37:39,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 121 flow [2021-03-26 00:37:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:37:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:37:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 00:37:39,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8847736625514403 [2021-03-26 00:37:39,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 00:37:39,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 00:37:39,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:39,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 00:37:39,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:39,107 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-26 00:37:39,107 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-26 00:37:39,108 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 430 transitions. [2021-03-26 00:37:39,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 121 flow [2021-03-26 00:37:39,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:37:39,111 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 80 flow [2021-03-26 00:37:39,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-26 00:37:39,113 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 00:37:39,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:39,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 80 flow [2021-03-26 00:37:39,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 80 flow [2021-03-26 00:37:39,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 00:37:39,119 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:37:39,119 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:39,120 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 5. Compared 38 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-26 00:37:39,120 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:37:39,486 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:37:39,764 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:37:40,345 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:37:40,891 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:37:41,771 INFO L154 LiptonReduction]: Checked pairs total: 1218 [2021-03-26 00:37:41,771 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:37:41,771 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2658 [2021-03-26 00:37:41,773 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:37:41,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:41,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:41,773 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, 1] [2021-03-26 00:37:41,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:37:41,773 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1437678712, now seen corresponding path program 1 times [2021-03-26 00:37:41,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:41,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571654631] [2021-03-26 00:37:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:41,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:41,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:41,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:41,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:41,882 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:37:41,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:37:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:41,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571654631] [2021-03-26 00:37:41,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:41,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:41,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777490873] [2021-03-26 00:37:41,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:41,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:41,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:41,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 173 [2021-03-26 00:37:41,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:41,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:41,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 173 [2021-03-26 00:37:41,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:41,898 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 00:37:41,898 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:37:41,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:41,898 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 00:37:41,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 00:37:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:37:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:37:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 00:37:41,900 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805394990366089 [2021-03-26 00:37:41,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 00:37:41,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 00:37:41,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:41,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 00:37:41,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:41,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:41,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:41,902 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 457 transitions. [2021-03-26 00:37:41,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 00:37:41,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:41,904 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 00:37:41,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, 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=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 00:37:41,904 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -16 predicate places. [2021-03-26 00:37:41,904 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:41,904 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:37:41,904 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 00:37:41,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 00:37:41,907 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:37:41,907 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:37:41,907 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 27 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-26 00:37:41,907 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 00:37:42,552 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:37:42,670 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:37:42,926 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:37:43,045 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:37:43,048 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 00:37:43,048 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:37:43,048 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1144 [2021-03-26 00:37:43,049 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:37:43,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,049 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:43,049 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:43,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:37:43,049 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1821539996, now seen corresponding path program 1 times [2021-03-26 00:37:43,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:43,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602247083] [2021-03-26 00:37:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:43,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:43,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602247083] [2021-03-26 00:37:43,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:43,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:37:43,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249052041] [2021-03-26 00:37:43,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:37:43,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:37:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:37:43,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 175 [2021-03-26 00:37:43,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:43,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 175 [2021-03-26 00:37:43,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:43,115 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 00:37:43,115 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:37:43,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:43,115 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 00:37:43,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 21 transitions, 62 flow [2021-03-26 00:37:43,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:37:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:37:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 00:37:43,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2021-03-26 00:37:43,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 00:37:43,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 00:37:43,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:43,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 00:37:43,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,119 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 469 transitions. [2021-03-26 00:37:43,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 21 transitions, 62 flow [2021-03-26 00:37:43,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:43,120 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-26 00:37:43,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-26 00:37:43,120 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -18 predicate places. [2021-03-26 00:37:43,120 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:43,120 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 00:37:43,121 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 00:37:43,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-26 00:37:43,123 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 00:37:43,123 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:37:43,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:43,124 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 00:37:43,214 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-26 00:37:43,214 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:37:43,214 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-26 00:37:43,215 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2021-03-26 00:37:43,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,215 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:43,215 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:43,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:37:43,215 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1519628062, now seen corresponding path program 1 times [2021-03-26 00:37:43,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:43,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489920020] [2021-03-26 00:37:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:43,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:43,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:43,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489920020] [2021-03-26 00:37:43,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:43,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:37:43,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060701953] [2021-03-26 00:37:43,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:43,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:43,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:43,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:43,258 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2021-03-26 00:37:43,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 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-26 00:37:43,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:43,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2021-03-26 00:37:43,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:43,276 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:37:43,276 INFO L130 PetriNetUnfolder]: For 11/18 co-relation queries the response was YES. [2021-03-26 00:37:43,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 28 events. 0/28 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 2/30 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:37:43,276 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 1 selfloop transitions, 3 changer transitions 1/22 dead transitions. [2021-03-26 00:37:43,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 22 transitions, 75 flow [2021-03-26 00:37:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2021-03-26 00:37:43,278 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557142857142858 [2021-03-26 00:37:43,278 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2021-03-26 00:37:43,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2021-03-26 00:37:43,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:43,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2021-03-26 00:37:43,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,280 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,281 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 4 states and 599 transitions. [2021-03-26 00:37:43,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 22 transitions, 75 flow [2021-03-26 00:37:43,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 22 transitions, 69 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:43,281 INFO L241 Difference]: Finished difference. Result has 35 places, 21 transitions, 70 flow [2021-03-26 00:37:43,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2021-03-26 00:37:43,281 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -15 predicate places. [2021-03-26 00:37:43,282 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:43,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 21 transitions, 70 flow [2021-03-26 00:37:43,282 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 70 flow [2021-03-26 00:37:43,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 70 flow [2021-03-26 00:37:43,284 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 00:37:43,284 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 00:37:43,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 21 events. 0/21 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:43,284 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 00:37:43,475 INFO L154 LiptonReduction]: Checked pairs total: 379 [2021-03-26 00:37:43,475 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:43,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 193 [2021-03-26 00:37:43,476 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 68 flow [2021-03-26 00:37:43,476 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-26 00:37:43,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:43,476 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:43,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:37:43,476 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1087698197, now seen corresponding path program 1 times [2021-03-26 00:37:43,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:43,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102470313] [2021-03-26 00:37:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:43,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:43,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:43,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102470313] [2021-03-26 00:37:43,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:43,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:37:43,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68705464] [2021-03-26 00:37:43,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:43,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:43,516 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2021-03-26 00:37:43,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:43,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2021-03-26 00:37:43,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:43,531 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 00:37:43,531 INFO L130 PetriNetUnfolder]: For 41/46 co-relation queries the response was YES. [2021-03-26 00:37:43,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 27 events. 0/27 cut-off events. For 41/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 3/30 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:37:43,532 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 1 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2021-03-26 00:37:43,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 21 transitions, 81 flow [2021-03-26 00:37:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2021-03-26 00:37:43,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8735795454545454 [2021-03-26 00:37:43,533 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2021-03-26 00:37:43,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2021-03-26 00:37:43,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:43,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2021-03-26 00:37:43,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,535 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-26 00:37:43,536 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-26 00:37:43,536 INFO L185 Difference]: Start difference. First operand has 34 places, 20 transitions, 68 flow. Second operand 4 states and 615 transitions. [2021-03-26 00:37:43,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 21 transitions, 81 flow [2021-03-26 00:37:43,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 69 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:37:43,537 INFO L241 Difference]: Finished difference. Result has 35 places, 20 transitions, 70 flow [2021-03-26 00:37:43,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2021-03-26 00:37:43,538 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -15 predicate places. [2021-03-26 00:37:43,538 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:43,538 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 20 transitions, 70 flow [2021-03-26 00:37:43,538 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 20 transitions, 70 flow [2021-03-26 00:37:43,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 20 transitions, 70 flow [2021-03-26 00:37:43,541 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 00:37:43,541 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:37:43,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 20 events. 0/20 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:37:43,542 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 00:37:43,562 INFO L154 LiptonReduction]: Checked pairs total: 281 [2021-03-26 00:37:43,563 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:43,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 00:37:43,564 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 68 flow [2021-03-26 00:37:43,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:43,564 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:43,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:37:43,565 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2122284225, now seen corresponding path program 1 times [2021-03-26 00:37:43,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:43,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673245337] [2021-03-26 00:37:43,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:43,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:37:43,653 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 00:37:43,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:37:43,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:43,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:37:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:43,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673245337] [2021-03-26 00:37:43,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:43,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:43,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793052549] [2021-03-26 00:37:43,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:37:43,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:43,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:37:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:37:43,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 177 [2021-03-26 00:37:43,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:43,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 177 [2021-03-26 00:37:43,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:43,753 INFO L129 PetriNetUnfolder]: 47/110 cut-off events. [2021-03-26 00:37:43,753 INFO L130 PetriNetUnfolder]: For 103/105 co-relation queries the response was YES. [2021-03-26 00:37:43,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 110 events. 47/110 cut-off events. For 103/105 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 363 event pairs, 25 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 247. Up to 80 conditions per place. [2021-03-26 00:37:43,754 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 8 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2021-03-26 00:37:43,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 24 transitions, 104 flow [2021-03-26 00:37:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:37:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:37:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2021-03-26 00:37:43,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7598870056497176 [2021-03-26 00:37:43,756 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2021-03-26 00:37:43,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2021-03-26 00:37:43,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:43,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2021-03-26 00:37:43,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,759 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:43,759 INFO L185 Difference]: Start difference. First operand has 34 places, 19 transitions, 68 flow. Second operand 4 states and 538 transitions. [2021-03-26 00:37:43,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 24 transitions, 104 flow [2021-03-26 00:37:43,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 88 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 00:37:43,760 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 80 flow [2021-03-26 00:37:43,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 00:37:43,760 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -17 predicate places. [2021-03-26 00:37:43,760 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:43,761 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 80 flow [2021-03-26 00:37:43,761 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 80 flow [2021-03-26 00:37:43,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 80 flow [2021-03-26 00:37:43,767 INFO L129 PetriNetUnfolder]: 14/51 cut-off events. [2021-03-26 00:37:43,767 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 00:37:43,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 51 events. 14/51 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 149 event pairs, 6 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 95. Up to 29 conditions per place. [2021-03-26 00:37:43,767 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 00:37:43,914 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 00:37:44,183 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 00:37:44,320 INFO L154 LiptonReduction]: Checked pairs total: 144 [2021-03-26 00:37:44,320 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:37:44,320 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 560 [2021-03-26 00:37:44,321 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 84 flow [2021-03-26 00:37:44,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:44,322 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:44,322 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:37:44,322 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1166445272, now seen corresponding path program 1 times [2021-03-26 00:37:44,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:44,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333165095] [2021-03-26 00:37:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:44,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:44,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333165095] [2021-03-26 00:37:44,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:44,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:37:44,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345214872] [2021-03-26 00:37:44,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:37:44,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:37:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:37:44,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-26 00:37:44,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 84 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-26 00:37:44,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:44,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-26 00:37:44,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:44,386 INFO L129 PetriNetUnfolder]: 61/151 cut-off events. [2021-03-26 00:37:44,386 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-03-26 00:37:44,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 151 events. 61/151 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 665 event pairs, 25 based on Foata normal form. 14/150 useless extension candidates. Maximal degree in co-relation 317. Up to 81 conditions per place. [2021-03-26 00:37:44,387 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/32 dead transitions. [2021-03-26 00:37:44,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 136 flow [2021-03-26 00:37:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:37:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:37:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 00:37:44,393 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.846927374301676 [2021-03-26 00:37:44,393 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 00:37:44,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 00:37:44,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:44,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 00:37:44,394 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-26 00:37:44,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,395 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,396 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 84 flow. Second operand 5 states and 758 transitions. [2021-03-26 00:37:44,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 136 flow [2021-03-26 00:37:44,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 127 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:44,398 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 135 flow [2021-03-26 00:37:44,398 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-03-26 00:37:44,398 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2021-03-26 00:37:44,398 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:44,398 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 135 flow [2021-03-26 00:37:44,398 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 135 flow [2021-03-26 00:37:44,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 135 flow [2021-03-26 00:37:44,411 INFO L129 PetriNetUnfolder]: 65/158 cut-off events. [2021-03-26 00:37:44,411 INFO L130 PetriNetUnfolder]: For 93/108 co-relation queries the response was YES. [2021-03-26 00:37:44,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 158 events. 65/158 cut-off events. For 93/108 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 721 event pairs, 31 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 417. Up to 81 conditions per place. [2021-03-26 00:37:44,412 INFO L142 LiptonReduction]: Number of co-enabled transitions 178 [2021-03-26 00:37:44,417 INFO L154 LiptonReduction]: Checked pairs total: 79 [2021-03-26 00:37:44,417 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:44,417 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 00:37:44,419 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 129 flow [2021-03-26 00:37:44,419 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-26 00:37:44,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:44,419 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:44,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:37:44,419 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1105369677, now seen corresponding path program 1 times [2021-03-26 00:37:44,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:44,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827728792] [2021-03-26 00:37:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:44,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:44,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827728792] [2021-03-26 00:37:44,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:44,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:37:44,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387746899] [2021-03-26 00:37:44,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:37:44,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:37:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:37:44,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-26 00:37:44,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:44,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-26 00:37:44,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:44,524 INFO L129 PetriNetUnfolder]: 28/92 cut-off events. [2021-03-26 00:37:44,524 INFO L130 PetriNetUnfolder]: For 69/75 co-relation queries the response was YES. [2021-03-26 00:37:44,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 92 events. 28/92 cut-off events. For 69/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 324 event pairs, 5 based on Foata normal form. 18/104 useless extension candidates. Maximal degree in co-relation 292. Up to 54 conditions per place. [2021-03-26 00:37:44,525 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 11 changer transitions 3/35 dead transitions. [2021-03-26 00:37:44,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 207 flow [2021-03-26 00:37:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:37:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:37:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions. [2021-03-26 00:37:44,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8463687150837989 [2021-03-26 00:37:44,527 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 909 transitions. [2021-03-26 00:37:44,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions. [2021-03-26 00:37:44,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:44,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions. [2021-03-26 00:37:44,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,530 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,530 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 129 flow. Second operand 6 states and 909 transitions. [2021-03-26 00:37:44,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 207 flow [2021-03-26 00:37:44,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:37:44,532 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 193 flow [2021-03-26 00:37:44,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-26 00:37:44,532 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2021-03-26 00:37:44,532 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:44,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 193 flow [2021-03-26 00:37:44,533 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 193 flow [2021-03-26 00:37:44,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 193 flow [2021-03-26 00:37:44,539 INFO L129 PetriNetUnfolder]: 27/91 cut-off events. [2021-03-26 00:37:44,540 INFO L130 PetriNetUnfolder]: For 134/142 co-relation queries the response was YES. [2021-03-26 00:37:44,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 91 events. 27/91 cut-off events. For 134/142 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 341 event pairs, 5 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 304. Up to 51 conditions per place. [2021-03-26 00:37:44,540 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 00:37:44,585 INFO L154 LiptonReduction]: Checked pairs total: 98 [2021-03-26 00:37:44,585 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:37:44,585 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 00:37:44,586 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 185 flow [2021-03-26 00:37:44,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:44,586 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:37:44,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:37:44,586 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:44,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1843067315, now seen corresponding path program 1 times [2021-03-26 00:37:44,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:44,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872587261] [2021-03-26 00:37:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:37:44,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:37:44,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:37:44,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:37:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:37:44,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872587261] [2021-03-26 00:37:44,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:37:44,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:37:44,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084174762] [2021-03-26 00:37:44,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:37:44,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:37:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:37:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:37:44,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-26 00:37:44,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:37:44,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-26 00:37:44,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:37:44,666 INFO L129 PetriNetUnfolder]: 14/55 cut-off events. [2021-03-26 00:37:44,666 INFO L130 PetriNetUnfolder]: For 98/105 co-relation queries the response was YES. [2021-03-26 00:37:44,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 55 events. 14/55 cut-off events. For 98/105 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 1 based on Foata normal form. 12/63 useless extension candidates. Maximal degree in co-relation 195. Up to 30 conditions per place. [2021-03-26 00:37:44,667 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 2 selfloop transitions, 11 changer transitions 3/32 dead transitions. [2021-03-26 00:37:44,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 217 flow [2021-03-26 00:37:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:37:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:37:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-03-26 00:37:44,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8411811652035116 [2021-03-26 00:37:44,670 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-03-26 00:37:44,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-03-26 00:37:44,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:37:44,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-03-26 00:37:44,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,674 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:44,674 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 185 flow. Second operand 7 states and 1054 transitions. [2021-03-26 00:37:44,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 217 flow [2021-03-26 00:37:44,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 190 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 00:37:44,677 INFO L241 Difference]: Finished difference. Result has 45 places, 29 transitions, 170 flow [2021-03-26 00:37:44,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2021-03-26 00:37:44,677 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2021-03-26 00:37:44,677 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:37:44,678 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 170 flow [2021-03-26 00:37:44,678 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 29 transitions, 170 flow [2021-03-26 00:37:44,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 29 transitions, 170 flow [2021-03-26 00:37:44,683 INFO L129 PetriNetUnfolder]: 12/53 cut-off events. [2021-03-26 00:37:44,683 INFO L130 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2021-03-26 00:37:44,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 53 events. 12/53 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 1 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 164. Up to 17 conditions per place. [2021-03-26 00:37:44,683 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-26 00:37:44,937 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:37:45,053 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:37:45,712 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-26 00:37:45,919 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:37:47,148 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 347 DAG size of output: 268 [2021-03-26 00:37:47,591 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2021-03-26 00:37:47,609 INFO L154 LiptonReduction]: Checked pairs total: 91 [2021-03-26 00:37:47,609 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:37:47,609 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2932 [2021-03-26 00:37:47,609 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 154 flow [2021-03-26 00:37:47,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:37:47,610 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:37:47,610 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-26 00:37:47,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:37:47,610 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:37:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:37:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash -499000965, now seen corresponding path program 1 times [2021-03-26 00:37:47,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:37:47,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546390792] [2021-03-26 00:37:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:37:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:37:47,638 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:37:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:37:47,667 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:37:47,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:37:47,687 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:37:47,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:37:47,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:37:47 BasicIcfg [2021-03-26 00:37:47,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:37:47,727 INFO L168 Benchmark]: Toolchain (without parser) took 17442.55 ms. Allocated memory was 255.9 MB in the beginning and 629.1 MB in the end (delta: 373.3 MB). Free memory was 234.9 MB in the beginning and 458.9 MB in the end (delta: -224.0 MB). Peak memory consumption was 148.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:47,727 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:37:47,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.19 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 234.9 MB in the beginning and 323.1 MB in the end (delta: -88.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:47,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.37 ms. Allocated memory is still 362.8 MB. Free memory was 323.1 MB in the beginning and 320.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:47,728 INFO L168 Benchmark]: Boogie Preprocessor took 29.61 ms. Allocated memory is still 362.8 MB. Free memory was 320.3 MB in the beginning and 318.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:47,728 INFO L168 Benchmark]: RCFGBuilder took 1264.37 ms. Allocated memory is still 362.8 MB. Free memory was 318.2 MB in the beginning and 301.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 64.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:47,728 INFO L168 Benchmark]: TraceAbstraction took 15765.96 ms. Allocated memory was 362.8 MB in the beginning and 629.1 MB in the end (delta: 266.3 MB). Free memory was 300.6 MB in the beginning and 458.9 MB in the end (delta: -158.3 MB). Peak memory consumption was 108.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:37:47,729 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 346.19 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 234.9 MB in the beginning and 323.1 MB in the end (delta: -88.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.37 ms. Allocated memory is still 362.8 MB. Free memory was 323.1 MB in the beginning and 320.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.61 ms. Allocated memory is still 362.8 MB. Free memory was 320.3 MB in the beginning and 318.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1264.37 ms. Allocated memory is still 362.8 MB. Free memory was 318.2 MB in the beginning and 301.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 64.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15765.96 ms. Allocated memory was 362.8 MB in the beginning and 629.1 MB in the end (delta: 266.3 MB). Free memory was 300.6 MB in the beginning and 458.9 MB in the end (delta: -158.3 MB). Peak memory consumption was 108.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6696.8ms, 103 PlacesBefore, 50 PlacesAfterwards, 95 TransitionsBefore, 41 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1640, positive: 1555, positive conditional: 1555, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1218, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1218, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1218, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 449, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 433, negative conditional: 0, negative unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1640, positive: 374, positive conditional: 374, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 1218, unknown conditional: 1218, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 70, Positive conditional cache size: 70, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2656.6ms, 47 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 329, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 9, positive unconditional: 33, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 9, positive unconditional: 33, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 3, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 260, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 260, negative conditional: 42, negative unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 329, positive: 200, positive conditional: 200, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 96, Positive conditional cache size: 96, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1143.2ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 291, positive: 231, positive conditional: 231, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 10, negative conditional: 2, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 98, negative conditional: 6, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, positive: 202, positive conditional: 202, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.7ms, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 2, positive unconditional: 15, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 2, positive unconditional: 15, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 89, negative conditional: 5, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 142, Positive conditional cache size: 142, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.9ms, 35 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 379 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 112, positive conditional: 112, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 20, positive unconditional: 5, negative: 6, negative conditional: 4, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 20, positive unconditional: 5, negative: 6, negative conditional: 4, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 4, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 97, negative conditional: 51, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 110, Positive conditional cache size: 110, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.7ms, 35 PlacesBefore, 34 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 281 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 559.6ms, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 144 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 79 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 11, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 11, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.6ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 98 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2931.1ms, 45 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 91 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 14, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 33, Positive conditional cache size: 33, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1967; [L821] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1968; [L823] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 pthread_t t1969; [L825] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15645.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 429.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6745.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 28 SDtfs, 11 SDslu, 12 SDs, 0 SdLazy, 133 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 99.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=8, InterpolantAutomatonStates: 39, 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: 19.9ms SsaConstructionTime, 204.3ms SatisfiabilityAnalysisTime, 387.9ms InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...