/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:40:27,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:40:27,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:40:27,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:40:27,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:40:27,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:40:27,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:40:27,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:40:27,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:40:28,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:40:28,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:40:28,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:40:28,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:40:28,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:40:28,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:40:28,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:40:28,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:40:28,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:40:28,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:40:28,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:40:28,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:40:28,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:40:28,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:40:28,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:40:28,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:40:28,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:40:28,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:40:28,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:40:28,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:40:28,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:40:28,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:40:28,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:40:28,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:40:28,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:40:28,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:40:28,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:40:28,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:40:28,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:40:28,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:40:28,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:40:28,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:40:28,043 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-RepeatedSemanticLbe.epf [2021-03-25 14:40:28,068 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:40:28,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:40:28,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:40:28,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:40:28,071 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:40:28,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:40:28,071 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:40:28,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:40:28,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:40:28,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:40:28,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:40:28,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:40:28,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:40:28,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:40:28,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:40:28,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:40:28,074 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:40:28,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:40:28,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:40:28,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:40:28,326 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:40:28,327 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:40:28,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-03-25 14:40:28,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799b4278f/73f36b093da249f6a90b34b9af9c0eb1/FLAG510ae1920 [2021-03-25 14:40:28,835 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:40:28,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2021-03-25 14:40:28,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799b4278f/73f36b093da249f6a90b34b9af9c0eb1/FLAG510ae1920 [2021-03-25 14:40:28,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799b4278f/73f36b093da249f6a90b34b9af9c0eb1 [2021-03-25 14:40:28,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:40:28,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:40:28,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:40:28,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:40:28,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:40:28,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:40:28" (1/1) ... [2021-03-25 14:40:28,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68bd0b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:28, skipping insertion in model container [2021-03-25 14:40:28,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:40:28" (1/1) ... [2021-03-25 14:40:28,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:40:28,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:40:29,064 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/rfi000_rmo.opt.i[948,961] [2021-03-25 14:40:29,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:40:29,247 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:40:29,259 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/rfi000_rmo.opt.i[948,961] [2021-03-25 14:40:29,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:40:29,343 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:40:29,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29 WrapperNode [2021-03-25 14:40:29,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:40:29,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:40:29,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:40:29,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:40:29,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:40:29,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:40:29,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:40:29,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:40:29,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... [2021-03-25 14:40:29,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:40:29,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:40:29,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:40:29,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:40:29,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:40:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:40:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:40:29,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:40:29,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:40:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:40:29,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:40:29,516 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:40:30,826 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:40:30,826 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:40:30,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:40:30 BoogieIcfgContainer [2021-03-25 14:40:30,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:40:30,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:40:30,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:40:30,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:40:30,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:40:28" (1/3) ... [2021-03-25 14:40:30,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7918c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:40:30, skipping insertion in model container [2021-03-25 14:40:30,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:29" (2/3) ... [2021-03-25 14:40:30,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7918c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:40:30, skipping insertion in model container [2021-03-25 14:40:30,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:40:30" (3/3) ... [2021-03-25 14:40:30,832 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt.i [2021-03-25 14:40:30,836 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:40:30,839 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:40:30,840 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:40:30,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:30,872 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:40:30,884 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:40:30,897 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:40:30,897 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:40:30,897 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:40:30,897 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:40:30,897 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:40:30,897 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:40:30,898 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:40:30,898 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:40:30,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-25 14:40:30,924 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-25 14:40:30,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:30,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-25 14:40:30,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-25 14:40:30,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-25 14:40:30,930 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:30,938 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-25 14:40:30,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-25 14:40:30,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-25 14:40:30,951 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-25 14:40:30,951 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:30,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-25 14:40:30,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-25 14:40:31,777 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 14:40:31,993 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:40:33,059 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:40:33,567 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:40:34,059 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:40:34,341 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:40:35,503 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-25 14:40:35,826 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:40:36,434 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:40:37,118 WARN L205 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:40:37,133 INFO L154 LiptonReduction]: Checked pairs total: 1826 [2021-03-25 14:40:37,133 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-25 14:40:37,135 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6205 [2021-03-25 14:40:37,164 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 14:40:37,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:37,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:37,165 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:37,165 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:37,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:37,169 INFO L82 PathProgramCache]: Analyzing trace with hash -481716019, now seen corresponding path program 1 times [2021-03-25 14:40:37,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:37,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070323113] [2021-03-25 14:40:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:37,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:37,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:37,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:37,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:37,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070323113] [2021-03-25 14:40:37,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:37,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:40:37,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798171167] [2021-03-25 14:40:37,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:40:37,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:40:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:40:37,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 140 [2021-03-25 14:40:37,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:37,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:37,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 140 [2021-03-25 14:40:37,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:37,479 INFO L129 PetriNetUnfolder]: 23/95 cut-off events. [2021-03-25 14:40:37,480 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:37,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 95 events. 23/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 9 based on Foata normal form. 6/88 useless extension candidates. Maximal degree in co-relation 134. Up to 37 conditions per place. [2021-03-25 14:40:37,482 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 5/34 dead transitions. [2021-03-25 14:40:37,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 96 flow [2021-03-25 14:40:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:40:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:40:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2021-03-25 14:40:37,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2021-03-25 14:40:37,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2021-03-25 14:40:37,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2021-03-25 14:40:37,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:37,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2021-03-25 14:40:37,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:37,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:37,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:37,511 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 368 transitions. [2021-03-25 14:40:37,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 96 flow [2021-03-25 14:40:37,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:37,514 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 60 flow [2021-03-25 14:40:37,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-25 14:40:37,516 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-03-25 14:40:37,517 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:37,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 60 flow [2021-03-25 14:40:37,518 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 60 flow [2021-03-25 14:40:37,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 60 flow [2021-03-25 14:40:37,522 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 14:40:37,523 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:37,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:40:37,523 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-25 14:40:38,197 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:40:38,452 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:40:38,976 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:40:39,486 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:40:40,047 INFO L154 LiptonReduction]: Checked pairs total: 592 [2021-03-25 14:40:40,047 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 14:40:40,047 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2530 [2021-03-25 14:40:40,048 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 48 flow [2021-03-25 14:40:40,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:40,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:40,048 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:40,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:40:40,049 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1314646513, now seen corresponding path program 1 times [2021-03-25 14:40:40,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:40,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601678953] [2021-03-25 14:40:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:40,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:40,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:40,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:40,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:40,153 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:40:40,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:40:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:40,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601678953] [2021-03-25 14:40:40,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:40,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:40:40,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255095049] [2021-03-25 14:40:40,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:40:40,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:40:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:40:40,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 146 [2021-03-25 14:40:40,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:40,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:40,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 146 [2021-03-25 14:40:40,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:40,182 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 14:40:40,182 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:40,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:40:40,183 INFO L132 encePairwiseOnDemand]: 143/146 looper letters, 1 selfloop transitions, 2 changer transitions 1/20 dead transitions. [2021-03-25 14:40:40,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 54 flow [2021-03-25 14:40:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:40:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:40:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2021-03-25 14:40:40,185 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515981735159818 [2021-03-25 14:40:40,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2021-03-25 14:40:40,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2021-03-25 14:40:40,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:40,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2021-03-25 14:40:40,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:40,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:40,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:40,187 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 48 flow. Second operand 3 states and 373 transitions. [2021-03-25 14:40:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 54 flow [2021-03-25 14:40:40,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:40,188 INFO L241 Difference]: Finished difference. Result has 28 places, 19 transitions, 50 flow [2021-03-25 14:40:40,188 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2021-03-25 14:40:40,188 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -11 predicate places. [2021-03-25 14:40:40,188 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:40,188 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 50 flow [2021-03-25 14:40:40,189 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 50 flow [2021-03-25 14:40:40,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 19 transitions, 50 flow [2021-03-25 14:40:40,193 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 14:40:40,193 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:40,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:40:40,193 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-25 14:40:40,697 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-25 14:40:40,806 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:40:41,036 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-25 14:40:41,141 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:40:41,143 INFO L154 LiptonReduction]: Checked pairs total: 465 [2021-03-25 14:40:41,143 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:40:41,143 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 955 [2021-03-25 14:40:41,144 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 46 flow [2021-03-25 14:40:41,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,144 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:41,144 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:41,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:40:41,144 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:41,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1307109435, now seen corresponding path program 1 times [2021-03-25 14:40:41,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:41,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861829421] [2021-03-25 14:40:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:41,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:41,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:41,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861829421] [2021-03-25 14:40:41,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:41,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:40:41,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831391756] [2021-03-25 14:40:41,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:40:41,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:40:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:40:41,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 148 [2021-03-25 14:40:41,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:41,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 148 [2021-03-25 14:40:41,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:41,253 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-03-25 14:40:41,253 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 14:40:41,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 38 events. 3/38 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 106 event pairs, 0 based on Foata normal form. 4/41 useless extension candidates. Maximal degree in co-relation 61. Up to 11 conditions per place. [2021-03-25 14:40:41,254 INFO L132 encePairwiseOnDemand]: 145/148 looper letters, 6 selfloop transitions, 2 changer transitions 1/20 dead transitions. [2021-03-25 14:40:41,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 73 flow [2021-03-25 14:40:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:40:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:40:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2021-03-25 14:40:41,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8603603603603603 [2021-03-25 14:40:41,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2021-03-25 14:40:41,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2021-03-25 14:40:41,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:41,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2021-03-25 14:40:41,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,259 INFO L185 Difference]: Start difference. First operand has 25 places, 17 transitions, 46 flow. Second operand 3 states and 382 transitions. [2021-03-25 14:40:41,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 73 flow [2021-03-25 14:40:41,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:41,260 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 50 flow [2021-03-25 14:40:41,260 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2021-03-25 14:40:41,260 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -13 predicate places. [2021-03-25 14:40:41,260 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:41,261 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 50 flow [2021-03-25 14:40:41,261 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 50 flow [2021-03-25 14:40:41,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 50 flow [2021-03-25 14:40:41,269 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:40:41,270 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:40:41,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:40:41,270 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-25 14:40:41,382 INFO L154 LiptonReduction]: Checked pairs total: 213 [2021-03-25 14:40:41,382 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:40:41,382 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-03-25 14:40:41,385 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 48 flow [2021-03-25 14:40:41,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:41,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:41,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:40:41,386 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash 969606344, now seen corresponding path program 1 times [2021-03-25 14:40:41,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:41,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791156604] [2021-03-25 14:40:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:41,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:41,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791156604] [2021-03-25 14:40:41,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:41,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:40:41,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222128160] [2021-03-25 14:40:41,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:40:41,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:40:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:40:41,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 149 [2021-03-25 14:40:41,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:41,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 149 [2021-03-25 14:40:41,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:41,485 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 14:40:41,485 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2021-03-25 14:40:41,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 16 events. 0/16 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:40:41,486 INFO L132 encePairwiseOnDemand]: 146/149 looper letters, 1 selfloop transitions, 2 changer transitions 0/16 dead transitions. [2021-03-25 14:40:41,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 16 transitions, 54 flow [2021-03-25 14:40:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:40:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:40:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2021-03-25 14:40:41,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8747203579418344 [2021-03-25 14:40:41,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2021-03-25 14:40:41,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2021-03-25 14:40:41,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:41,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2021-03-25 14:40:41,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,491 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 48 flow. Second operand 3 states and 391 transitions. [2021-03-25 14:40:41,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 16 transitions, 54 flow [2021-03-25 14:40:41,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 16 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:41,495 INFO L241 Difference]: Finished difference. Result has 26 places, 16 transitions, 52 flow [2021-03-25 14:40:41,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2021-03-25 14:40:41,495 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -13 predicate places. [2021-03-25 14:40:41,495 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:41,496 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 52 flow [2021-03-25 14:40:41,496 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 16 transitions, 52 flow [2021-03-25 14:40:41,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 16 transitions, 52 flow [2021-03-25 14:40:41,500 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 14:40:41,500 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:40:41,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 16 events. 0/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:40:41,501 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-25 14:40:41,501 INFO L154 LiptonReduction]: Checked pairs total: 101 [2021-03-25 14:40:41,501 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:41,501 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 14:40:41,502 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 16 transitions, 52 flow [2021-03-25 14:40:41,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:41,503 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:41,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:40:41,503 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -644607626, now seen corresponding path program 1 times [2021-03-25 14:40:41,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:41,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257114708] [2021-03-25 14:40:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:41,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:41,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:41,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:41,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257114708] [2021-03-25 14:40:41,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:41,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:40:41,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999808245] [2021-03-25 14:40:41,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:40:41,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:40:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:40:41,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 149 [2021-03-25 14:40:41,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:41,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 149 [2021-03-25 14:40:41,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:41,607 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2021-03-25 14:40:41,607 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 14:40:41,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 28 events. 1/28 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 50. Up to 5 conditions per place. [2021-03-25 14:40:41,607 INFO L132 encePairwiseOnDemand]: 146/149 looper letters, 5 selfloop transitions, 1 changer transitions 2/18 dead transitions. [2021-03-25 14:40:41,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 18 transitions, 76 flow [2021-03-25 14:40:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:40:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:40:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2021-03-25 14:40:41,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8070469798657718 [2021-03-25 14:40:41,610 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2021-03-25 14:40:41,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2021-03-25 14:40:41,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:41,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2021-03-25 14:40:41,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,612 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,613 INFO L185 Difference]: Start difference. First operand has 26 places, 16 transitions, 52 flow. Second operand 4 states and 481 transitions. [2021-03-25 14:40:41,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 18 transitions, 76 flow [2021-03-25 14:40:41,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 65 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 14:40:41,613 INFO L241 Difference]: Finished difference. Result has 28 places, 16 transitions, 51 flow [2021-03-25 14:40:41,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=51, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2021-03-25 14:40:41,614 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -11 predicate places. [2021-03-25 14:40:41,614 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:41,614 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 51 flow [2021-03-25 14:40:41,614 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 51 flow [2021-03-25 14:40:41,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 16 transitions, 51 flow [2021-03-25 14:40:41,616 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 14:40:41,617 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 14:40:41,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 20 events. 0/20 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:40:41,617 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-25 14:40:41,618 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-25 14:40:41,618 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:41,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-03-25 14:40:41,620 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 16 transitions, 51 flow [2021-03-25 14:40:41,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:41,620 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:41,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:40:41,620 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash -668618366, now seen corresponding path program 2 times [2021-03-25 14:40:41,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:41,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748172649] [2021-03-25 14:40:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:41,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:40:41,775 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-03-25 14:40:41,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-25 14:40:41,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:40:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:41,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748172649] [2021-03-25 14:40:41,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:41,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:40:41,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534938996] [2021-03-25 14:40:41,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:40:41,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:40:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:40:41,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 149 [2021-03-25 14:40:41,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 16 transitions, 51 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:41,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 149 [2021-03-25 14:40:41,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:41,841 INFO L129 PetriNetUnfolder]: 17/58 cut-off events. [2021-03-25 14:40:41,842 INFO L130 PetriNetUnfolder]: For 41/42 co-relation queries the response was YES. [2021-03-25 14:40:41,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 58 events. 17/58 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 6 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 120. Up to 36 conditions per place. [2021-03-25 14:40:41,842 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 7 selfloop transitions, 4 changer transitions 0/20 dead transitions. [2021-03-25 14:40:41,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 20 transitions, 81 flow [2021-03-25 14:40:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:40:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:40:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2021-03-25 14:40:41,844 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7315436241610739 [2021-03-25 14:40:41,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2021-03-25 14:40:41,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2021-03-25 14:40:41,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:41,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2021-03-25 14:40:41,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,847 INFO L185 Difference]: Start difference. First operand has 27 places, 16 transitions, 51 flow. Second operand 4 states and 436 transitions. [2021-03-25 14:40:41,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 20 transitions, 81 flow [2021-03-25 14:40:41,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 78 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:41,867 INFO L241 Difference]: Finished difference. Result has 29 places, 18 transitions, 69 flow [2021-03-25 14:40:41,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=69, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2021-03-25 14:40:41,868 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -10 predicate places. [2021-03-25 14:40:41,868 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:41,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 18 transitions, 69 flow [2021-03-25 14:40:41,868 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 18 transitions, 69 flow [2021-03-25 14:40:41,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 18 transitions, 69 flow [2021-03-25 14:40:41,871 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-25 14:40:41,871 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 14:40:41,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 28 events. 3/28 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2021-03-25 14:40:41,872 INFO L142 LiptonReduction]: Number of co-enabled transitions 72 [2021-03-25 14:40:41,873 INFO L154 LiptonReduction]: Checked pairs total: 77 [2021-03-25 14:40:41,873 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:41,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-25 14:40:41,873 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 69 flow [2021-03-25 14:40:41,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:41,874 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:41,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:40:41,874 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 109855528, now seen corresponding path program 1 times [2021-03-25 14:40:41,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:41,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847322969] [2021-03-25 14:40:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:41,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:41,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:40:41,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:40:41,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:41,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:40:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:41,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847322969] [2021-03-25 14:40:41,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:41,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:40:41,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244523534] [2021-03-25 14:40:41,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:40:41,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:40:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:40:41,923 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2021-03-25 14:40:41,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:41,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2021-03-25 14:40:41,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:41,960 INFO L129 PetriNetUnfolder]: 16/64 cut-off events. [2021-03-25 14:40:41,960 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-03-25 14:40:41,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 64 events. 16/64 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 203 event pairs, 7 based on Foata normal form. 2/65 useless extension candidates. Maximal degree in co-relation 152. Up to 31 conditions per place. [2021-03-25 14:40:41,963 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 7 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2021-03-25 14:40:41,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 101 flow [2021-03-25 14:40:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:40:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:40:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2021-03-25 14:40:41,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8036912751677853 [2021-03-25 14:40:41,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2021-03-25 14:40:41,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2021-03-25 14:40:41,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:41,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2021-03-25 14:40:41,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,968 INFO L185 Difference]: Start difference. First operand has 29 places, 18 transitions, 69 flow. Second operand 4 states and 479 transitions. [2021-03-25 14:40:41,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 101 flow [2021-03-25 14:40:41,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:41,970 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 90 flow [2021-03-25 14:40:41,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-03-25 14:40:41,970 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2021-03-25 14:40:41,970 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:41,970 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 90 flow [2021-03-25 14:40:41,970 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 90 flow [2021-03-25 14:40:41,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 90 flow [2021-03-25 14:40:41,978 INFO L129 PetriNetUnfolder]: 5/35 cut-off events. [2021-03-25 14:40:41,978 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-03-25 14:40:41,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 35 events. 5/35 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 85. Up to 14 conditions per place. [2021-03-25 14:40:41,979 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-25 14:40:41,995 INFO L154 LiptonReduction]: Checked pairs total: 76 [2021-03-25 14:40:41,995 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:41,995 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-25 14:40:41,995 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 90 flow [2021-03-25 14:40:41,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:41,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:41,996 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:41,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:40:41,996 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1024627123, now seen corresponding path program 1 times [2021-03-25 14:40:41,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:41,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290850499] [2021-03-25 14:40:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:42,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:42,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:42,057 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:40:42,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:40:42,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:42,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:42,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290850499] [2021-03-25 14:40:42,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:42,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:40:42,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398157434] [2021-03-25 14:40:42,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:40:42,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:42,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:40:42,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:40:42,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2021-03-25 14:40:42,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:42,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2021-03-25 14:40:42,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:42,093 INFO L129 PetriNetUnfolder]: 11/60 cut-off events. [2021-03-25 14:40:42,093 INFO L130 PetriNetUnfolder]: For 47/50 co-relation queries the response was YES. [2021-03-25 14:40:42,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 60 events. 11/60 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 186 event pairs, 3 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 146. Up to 25 conditions per place. [2021-03-25 14:40:42,094 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 4 selfloop transitions, 5 changer transitions 3/27 dead transitions. [2021-03-25 14:40:42,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 128 flow [2021-03-25 14:40:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:40:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:40:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2021-03-25 14:40:42,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8174496644295302 [2021-03-25 14:40:42,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2021-03-25 14:40:42,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2021-03-25 14:40:42,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:42,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2021-03-25 14:40:42,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,098 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 90 flow. Second operand 5 states and 609 transitions. [2021-03-25 14:40:42,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 128 flow [2021-03-25 14:40:42,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 120 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:42,100 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 119 flow [2021-03-25 14:40:42,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-25 14:40:42,100 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2021-03-25 14:40:42,100 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:42,100 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 119 flow [2021-03-25 14:40:42,101 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 119 flow [2021-03-25 14:40:42,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 119 flow [2021-03-25 14:40:42,106 INFO L129 PetriNetUnfolder]: 8/55 cut-off events. [2021-03-25 14:40:42,106 INFO L130 PetriNetUnfolder]: For 54/59 co-relation queries the response was YES. [2021-03-25 14:40:42,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 55 events. 8/55 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 169 event pairs, 3 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 149. Up to 17 conditions per place. [2021-03-25 14:40:42,107 INFO L142 LiptonReduction]: Number of co-enabled transitions 82 [2021-03-25 14:40:42,258 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:40:42,611 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:40:42,717 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:40:42,719 INFO L154 LiptonReduction]: Checked pairs total: 50 [2021-03-25 14:40:42,720 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:40:42,720 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 620 [2021-03-25 14:40:42,720 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 122 flow [2021-03-25 14:40:42,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:42,720 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:42,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:40:42,721 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 32282907, now seen corresponding path program 1 times [2021-03-25 14:40:42,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:42,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758002858] [2021-03-25 14:40:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:42,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:42,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:42,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:42,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:42,790 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:40:42,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:40:42,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:42,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:42,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758002858] [2021-03-25 14:40:42,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:42,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:40:42,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972235469] [2021-03-25 14:40:42,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:40:42,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:42,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:40:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:40:42,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 150 [2021-03-25 14:40:42,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:42,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 150 [2021-03-25 14:40:42,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:42,829 INFO L129 PetriNetUnfolder]: 4/41 cut-off events. [2021-03-25 14:40:42,829 INFO L130 PetriNetUnfolder]: For 46/75 co-relation queries the response was YES. [2021-03-25 14:40:42,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 41 events. 4/41 cut-off events. For 46/75 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 105 event pairs, 0 based on Foata normal form. 21/61 useless extension candidates. Maximal degree in co-relation 123. Up to 16 conditions per place. [2021-03-25 14:40:42,829 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 2 selfloop transitions, 8 changer transitions 2/27 dead transitions. [2021-03-25 14:40:42,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 27 transitions, 160 flow [2021-03-25 14:40:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:40:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:40:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2021-03-25 14:40:42,831 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8133333333333334 [2021-03-25 14:40:42,831 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2021-03-25 14:40:42,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2021-03-25 14:40:42,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:42,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2021-03-25 14:40:42,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,834 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:42,834 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 122 flow. Second operand 7 states and 854 transitions. [2021-03-25 14:40:42,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 27 transitions, 160 flow [2021-03-25 14:40:42,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 27 transitions, 147 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:42,836 INFO L241 Difference]: Finished difference. Result has 43 places, 25 transitions, 142 flow [2021-03-25 14:40:42,836 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2021-03-25 14:40:42,836 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2021-03-25 14:40:42,836 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:42,836 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 25 transitions, 142 flow [2021-03-25 14:40:42,836 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 25 transitions, 142 flow [2021-03-25 14:40:42,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 25 transitions, 142 flow [2021-03-25 14:40:42,839 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-03-25 14:40:42,839 INFO L130 PetriNetUnfolder]: For 49/53 co-relation queries the response was YES. [2021-03-25 14:40:42,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 38 events. 3/38 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 111. Up to 14 conditions per place. [2021-03-25 14:40:42,840 INFO L142 LiptonReduction]: Number of co-enabled transitions 60 [2021-03-25 14:40:43,092 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:40:43,218 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:40:43,851 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 193 [2021-03-25 14:40:44,061 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2021-03-25 14:40:45,351 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 348 DAG size of output: 271 [2021-03-25 14:40:45,829 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 253 [2021-03-25 14:40:45,832 INFO L154 LiptonReduction]: Checked pairs total: 81 [2021-03-25 14:40:45,832 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:40:45,833 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2997 [2021-03-25 14:40:45,836 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 122 flow [2021-03-25 14:40:45,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:45,837 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:45,837 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:45,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:40:45,837 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1281658368, now seen corresponding path program 1 times [2021-03-25 14:40:45,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:45,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547631889] [2021-03-25 14:40:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:45,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:45,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:40:45,886 INFO L142 QuantifierPusher]: treesize reduction 9, result has 74.3 percent of original size [2021-03-25 14:40:45,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 14:40:45,903 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 14:40:45,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:40:45,928 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-25 14:40:45,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 14:40:45,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:45,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:40:45,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:45,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:40:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:45,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547631889] [2021-03-25 14:40:45,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:45,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:40:45,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411227104] [2021-03-25 14:40:45,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:40:45,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:45,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:40:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:40:45,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 152 [2021-03-25 14:40:45,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:45,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:45,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 152 [2021-03-25 14:40:45,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:46,145 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 14:40:46,145 INFO L130 PetriNetUnfolder]: For 141/145 co-relation queries the response was YES. [2021-03-25 14:40:46,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 35 events. 3/35 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 5/40 useless extension candidates. Maximal degree in co-relation 123. Up to 13 conditions per place. [2021-03-25 14:40:46,146 INFO L132 encePairwiseOnDemand]: 145/152 looper letters, 5 selfloop transitions, 4 changer transitions 3/22 dead transitions. [2021-03-25 14:40:46,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 22 transitions, 155 flow [2021-03-25 14:40:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:40:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:40:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 762 transitions. [2021-03-25 14:40:46,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7161654135338346 [2021-03-25 14:40:46,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 762 transitions. [2021-03-25 14:40:46,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 762 transitions. [2021-03-25 14:40:46,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:46,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 762 transitions. [2021-03-25 14:40:46,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:46,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 152.0) internal successors, (1216), 8 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:46,155 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 152.0) internal successors, (1216), 8 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:46,155 INFO L185 Difference]: Start difference. First operand has 40 places, 21 transitions, 122 flow. Second operand 7 states and 762 transitions. [2021-03-25 14:40:46,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 22 transitions, 155 flow [2021-03-25 14:40:46,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 22 transitions, 124 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-25 14:40:46,156 INFO L241 Difference]: Finished difference. Result has 36 places, 18 transitions, 88 flow [2021-03-25 14:40:46,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2021-03-25 14:40:46,157 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2021-03-25 14:40:46,157 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:46,157 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 18 transitions, 88 flow [2021-03-25 14:40:46,157 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 18 transitions, 88 flow [2021-03-25 14:40:46,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 88 flow [2021-03-25 14:40:46,161 INFO L129 PetriNetUnfolder]: 2/27 cut-off events. [2021-03-25 14:40:46,161 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-25 14:40:46,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 27 events. 2/27 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 66. Up to 8 conditions per place. [2021-03-25 14:40:46,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 12 [2021-03-25 14:40:46,352 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:40:46,750 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:40:46,869 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:40:46,892 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-25 14:40:46,893 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:40:46,893 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 736 [2021-03-25 14:40:46,893 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 92 flow [2021-03-25 14:40:46,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:40:46,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:46,893 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:46,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:40:46,894 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -298080613, now seen corresponding path program 1 times [2021-03-25 14:40:46,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:46,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430745327] [2021-03-25 14:40:46,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:40:46,924 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:40:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:40:46,944 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:40:46,974 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:40:46,974 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:40:46,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:40:47,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:40:47 BasicIcfg [2021-03-25 14:40:47,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:40:47,040 INFO L168 Benchmark]: Toolchain (without parser) took 18169.28 ms. Allocated memory was 255.9 MB in the beginning and 788.5 MB in the end (delta: 532.7 MB). Free memory was 234.9 MB in the beginning and 616.1 MB in the end (delta: -381.2 MB). Peak memory consumption was 149.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:47,040 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:40:47,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.98 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 234.4 MB in the beginning and 350.5 MB in the end (delta: -116.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:47,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.44 ms. Allocated memory is still 390.1 MB. Free memory was 350.5 MB in the beginning and 347.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:47,041 INFO L168 Benchmark]: Boogie Preprocessor took 42.09 ms. Allocated memory is still 390.1 MB. Free memory was 347.8 MB in the beginning and 345.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:47,041 INFO L168 Benchmark]: RCFGBuilder took 1383.35 ms. Allocated memory is still 390.1 MB. Free memory was 345.7 MB in the beginning and 353.0 MB in the end (delta: -7.3 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:47,041 INFO L168 Benchmark]: TraceAbstraction took 16211.04 ms. Allocated memory was 390.1 MB in the beginning and 788.5 MB in the end (delta: 398.5 MB). Free memory was 353.0 MB in the beginning and 616.1 MB in the end (delta: -263.1 MB). Peak memory consumption was 134.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:47,045 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 471.98 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 234.4 MB in the beginning and 350.5 MB in the end (delta: -116.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.44 ms. Allocated memory is still 390.1 MB. Free memory was 350.5 MB in the beginning and 347.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.09 ms. Allocated memory is still 390.1 MB. Free memory was 347.8 MB in the beginning and 345.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1383.35 ms. Allocated memory is still 390.1 MB. Free memory was 345.7 MB in the beginning and 353.0 MB in the end (delta: -7.3 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16211.04 ms. Allocated memory was 390.1 MB in the beginning and 788.5 MB in the end (delta: 398.5 MB). Free memory was 353.0 MB in the beginning and 616.1 MB in the end (delta: -263.1 MB). Peak memory consumption was 134.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6193.0ms, 86 PlacesBefore, 39 PlacesAfterwards, 81 TransitionsBefore, 33 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1023, positive: 960, positive conditional: 0, positive unconditional: 960, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 713, positive: 679, positive conditional: 0, positive unconditional: 679, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 713, positive: 679, positive conditional: 0, positive unconditional: 679, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 713, positive: 678, positive conditional: 0, positive unconditional: 678, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 288, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 277, negative conditional: 0, negative unconditional: 277, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1023, positive: 281, positive conditional: 0, positive unconditional: 281, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 713, unknown conditional: 0, unknown unconditional: 713] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2529.1ms, 37 PlacesBefore, 27 PlacesAfterwards, 26 TransitionsBefore, 20 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 3 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 592 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 343, negative conditional: 0, negative unconditional: 343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 226, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 954.4ms, 28 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 465 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.7ms, 26 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2ms, 26 PlacesBefore, 26 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 101 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7ms, 28 PlacesBefore, 27 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3ms, 29 PlacesBefore, 29 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.8ms, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 76 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 619.0ms, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 50 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2996.4ms, 43 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 21 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 81 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 735.4ms, 36 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1595; [L801] FCALL, FORK 0 pthread_create(&t1595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1596; [L803] FCALL, FORK 0 pthread_create(&t1596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16080.5ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 564.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6261.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 34 SDtfs, 17 SDslu, 14 SDs, 0 SdLazy, 136 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 158.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 263.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=9, InterpolantAutomatonStates: 43, 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: 39.7ms SsaConstructionTime, 309.9ms SatisfiabilityAnalysisTime, 663.1ms InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...