/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/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:51:48,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:51:48,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:51:48,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:51:48,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:51:48,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:51:48,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:51:48,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:51:48,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:51:48,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:51:48,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:51:48,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:51:48,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:51:48,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:51:48,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:51:48,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:51:48,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:51:48,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:51:48,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:51:48,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:51:48,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:51:48,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:51:48,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:51:48,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:51:48,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:51:48,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:51:48,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:51:48,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:51:48,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:51:48,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:51:48,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:51:48,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:51:48,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:51:48,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:51:48,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:51:48,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:51:48,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:51:48,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:51:48,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:51:48,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:51:48,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:51:48,993 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:51:49,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:51:49,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:51:49,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:51:49,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:51:49,034 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:51:49,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:51:49,034 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:51:49,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:51:49,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:51:49,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:51:49,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:51:49,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:51:49,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:51:49,036 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:51:49,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:51:49,036 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:51:49,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:51:49,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:51:49,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:51:49,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:51:49,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:51:49,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:51:49,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:51:49,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:51:49,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:51:49,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:51:49,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:51:49,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:51:49,038 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:51:49,039 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:51:49,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:51:49,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:51:49,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:51:49,349 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:51:49,350 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:51:49,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-03-25 14:51:49,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd72516f/7b79ecb5f3bf4fa1b9f3bddb116c9ff4/FLAGcac77d796 [2021-03-25 14:51:49,881 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:51:49,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-03-25 14:51:49,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd72516f/7b79ecb5f3bf4fa1b9f3bddb116c9ff4/FLAGcac77d796 [2021-03-25 14:51:49,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd72516f/7b79ecb5f3bf4fa1b9f3bddb116c9ff4 [2021-03-25 14:51:49,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:51:49,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:51:49,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:51:49,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:51:49,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:51:49,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:51:49" (1/1) ... [2021-03-25 14:51:49,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3130102b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:49, skipping insertion in model container [2021-03-25 14:51:49,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:51:49" (1/1) ... [2021-03-25 14:51:49,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:51:49,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:51:50,184 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i[952,965] [2021-03-25 14:51:50,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:51:50,361 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:51:50,371 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i[952,965] [2021-03-25 14:51:50,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:51:50,465 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:51:50,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50 WrapperNode [2021-03-25 14:51:50,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:51:50,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:51:50,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:51:50,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:51:50,472 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:51:50" (1/1) ... [2021-03-25 14:51:50,491 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:51:50" (1/1) ... [2021-03-25 14:51:50,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:51:50,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:51:50,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:51:50,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:51:50,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (1/1) ... [2021-03-25 14:51:50,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:51:50,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:51:50,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:51:50,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:51:50,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (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:51:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:51:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:51:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:51:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:51:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:51:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:51:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:51:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:51:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:51:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:51:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:51:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:51:50,632 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:51:52,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:51:52,316 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:51:52,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:51:52 BoogieIcfgContainer [2021-03-25 14:51:52,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:51:52,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:51:52,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:51:52,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:51:52,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:51:49" (1/3) ... [2021-03-25 14:51:52,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a389c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:51:52, skipping insertion in model container [2021-03-25 14:51:52,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:50" (2/3) ... [2021-03-25 14:51:52,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a389c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:51:52, skipping insertion in model container [2021-03-25 14:51:52,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:51:52" (3/3) ... [2021-03-25 14:51:52,327 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2021-03-25 14:51:52,335 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:51:52,339 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:51:52,340 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:51:52,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,387 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,401 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,403 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:52,406 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:51:52,422 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:51:52,440 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:51:52,440 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:51:52,440 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:51:52,440 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:51:52,440 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:51:52,441 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:51:52,441 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:51:52,441 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:51:52,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 14:51:52,477 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 14:51:52,477 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:51:52,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:51:52,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 14:51:52,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:52,486 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:52,496 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:52,499 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:52,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:52,514 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 14:51:52,514 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:51:52,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:51:52,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-25 14:51:53,432 WARN L205 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-25 14:51:54,077 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 181 [2021-03-25 14:51:55,581 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-25 14:51:56,143 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-25 14:51:57,053 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:51:57,442 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:51:57,550 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:51:58,638 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 14:51:58,903 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 14:51:59,564 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:00,215 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:00,225 INFO L154 LiptonReduction]: Checked pairs total: 1464 [2021-03-25 14:52:00,225 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-25 14:52:00,227 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7742 [2021-03-25 14:52:00,244 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-25 14:52:00,244 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:00,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:00,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:00,245 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1967679308, now seen corresponding path program 1 times [2021-03-25 14:52:00,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:00,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26401664] [2021-03-25 14:52:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:00,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:00,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:00,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:00,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:00,467 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:52:00,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26401664] [2021-03-25 14:52:00,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:00,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:00,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040825269] [2021-03-25 14:52:00,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:00,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:00,488 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-03-25 14:52:00,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:00,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:00,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-03-25 14:52:00,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:00,579 INFO L129 PetriNetUnfolder]: 23/92 cut-off events. [2021-03-25 14:52:00,579 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:00,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 92 events. 23/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 16 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 133. Up to 37 conditions per place. [2021-03-25 14:52:00,583 INFO L132 encePairwiseOnDemand]: 133/137 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-25 14:52:00,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-25 14:52:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-25 14:52:00,600 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2021-03-25 14:52:00,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-25 14:52:00,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-25 14:52:00,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:00,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-25 14:52:00,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:00,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:00,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:00,622 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 356 transitions. [2021-03-25 14:52:00,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-25 14:52:00,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:00,628 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:00,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-25 14:52:00,631 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-25 14:52:00,631 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:00,631 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:00,632 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:00,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-25 14:52:00,648 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:52:00,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:00,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:52:00,648 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 14:52:00,902 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-03-25 14:52:01,453 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 14:52:01,758 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 14:52:02,914 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-03-25 14:52:03,492 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:03,696 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-25 14:52:03,697 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:52:03,697 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3066 [2021-03-25 14:52:03,698 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-25 14:52:03,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:03,698 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:03,698 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:03,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:52:03,699 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:03,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:03,699 INFO L82 PathProgramCache]: Analyzing trace with hash 434742666, now seen corresponding path program 1 times [2021-03-25 14:52:03,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:03,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935588146] [2021-03-25 14:52:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:03,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:03,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:03,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:03,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:03,805 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:52:03,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:03,815 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:52:03,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935588146] [2021-03-25 14:52:03,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:03,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:03,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633787166] [2021-03-25 14:52:03,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:03,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:03,818 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 142 [2021-03-25 14:52:03,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:03,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:03,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 142 [2021-03-25 14:52:03,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:03,836 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:52:03,836 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:03,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:03,837 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 1 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2021-03-25 14:52:03,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 48 flow [2021-03-25 14:52:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2021-03-25 14:52:03,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8474178403755869 [2021-03-25 14:52:03,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2021-03-25 14:52:03,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2021-03-25 14:52:03,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:03,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2021-03-25 14:52:03,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:03,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:03,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:03,852 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 361 transitions. [2021-03-25 14:52:03,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 48 flow [2021-03-25 14:52:03,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 44 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:03,853 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:03,854 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2021-03-25 14:52:03,854 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 14:52:03,854 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:03,854 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:03,855 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:03,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:03,858 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:52:03,858 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:03,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:03,859 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-25 14:52:03,982 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:04,098 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:04,245 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:04,357 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:04,614 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 14:52:04,736 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 14:52:04,983 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 14:52:05,111 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 14:52:05,113 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-25 14:52:05,113 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:52:05,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1259 [2021-03-25 14:52:05,114 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-25 14:52:05,115 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:52:05,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:05,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:05,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:52:05,115 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash 942494911, now seen corresponding path program 1 times [2021-03-25 14:52:05,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:05,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756509134] [2021-03-25 14:52:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:05,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:05,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:05,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:05,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:05,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:05,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:05,219 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:52:05,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756509134] [2021-03-25 14:52:05,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:05,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:05,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638428396] [2021-03-25 14:52:05,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:05,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:05,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:05,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2021-03-25 14:52:05,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:05,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2021-03-25 14:52:05,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:05,246 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:52:05,246 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-25 14:52:05,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:52:05,246 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2021-03-25 14:52:05,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2021-03-25 14:52:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2021-03-25 14:52:05,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2021-03-25 14:52:05,249 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2021-03-25 14:52:05,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2021-03-25 14:52:05,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:05,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2021-03-25 14:52:05,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,252 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 475 transitions. [2021-03-25 14:52:05,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2021-03-25 14:52:05,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:05,253 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:05,253 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2021-03-25 14:52:05,253 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -9 predicate places. [2021-03-25 14:52:05,253 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:05,253 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:05,254 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:05,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:05,256 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:52:05,257 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:52:05,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:05,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 14:52:05,578 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-25 14:52:05,579 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:05,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 326 [2021-03-25 14:52:05,580 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow [2021-03-25 14:52:05,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:05,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:05,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:52:05,581 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1529641860, now seen corresponding path program 1 times [2021-03-25 14:52:05,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:05,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528995947] [2021-03-25 14:52:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:05,730 INFO L142 QuantifierPusher]: treesize reduction 17, result has 46.9 percent of original size [2021-03-25 14:52:05,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:52:05,744 INFO L142 QuantifierPusher]: treesize reduction 17, result has 46.9 percent of original size [2021-03-25 14:52:05,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:52:05,788 INFO L142 QuantifierPusher]: treesize reduction 18, result has 40.0 percent of original size [2021-03-25 14:52:05,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 14:52:05,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:05,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 14:52:05,806 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:52:05,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528995947] [2021-03-25 14:52:05,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:05,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:05,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834106387] [2021-03-25 14:52:05,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:05,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:05,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:05,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:05,810 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 145 [2021-03-25 14:52:05,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:05,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 145 [2021-03-25 14:52:05,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:05,909 INFO L129 PetriNetUnfolder]: 55/110 cut-off events. [2021-03-25 14:52:05,910 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2021-03-25 14:52:05,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 110 events. 55/110 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 320 event pairs, 20 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 258. Up to 92 conditions per place. [2021-03-25 14:52:05,913 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 13 selfloop transitions, 4 changer transitions 0/21 dead transitions. [2021-03-25 14:52:05,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 98 flow [2021-03-25 14:52:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 382 transitions. [2021-03-25 14:52:05,915 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6586206896551724 [2021-03-25 14:52:05,915 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 382 transitions. [2021-03-25 14:52:05,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 382 transitions. [2021-03-25 14:52:05,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:05,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 382 transitions. [2021-03-25 14:52:05,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.5) internal successors, (382), 4 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:52:05,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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:52:05,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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:52:05,919 INFO L185 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 4 states and 382 transitions. [2021-03-25 14:52:05,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 98 flow [2021-03-25 14:52:05,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 86 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:52:05,921 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:05,921 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-03-25 14:52:05,921 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 14:52:05,921 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:05,921 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:05,922 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:05,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:05,927 INFO L129 PetriNetUnfolder]: 3/21 cut-off events. [2021-03-25 14:52:05,927 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:52:05,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 21 events. 3/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 1 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-25 14:52:05,928 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-25 14:52:05,930 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-25 14:52:05,930 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:05,930 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:52:05,935 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:05,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:05,936 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:05,936 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:05,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:52:05,936 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2037445189, now seen corresponding path program 1 times [2021-03-25 14:52:05,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:05,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367991289] [2021-03-25 14:52:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:06,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:06,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:06,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:06,028 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:52:06,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367991289] [2021-03-25 14:52:06,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:06,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:06,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541392931] [2021-03-25 14:52:06,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:06,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:06,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:06,031 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 145 [2021-03-25 14:52:06,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:06,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:06,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 145 [2021-03-25 14:52:06,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:06,066 INFO L129 PetriNetUnfolder]: 10/42 cut-off events. [2021-03-25 14:52:06,066 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:52:06,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 42 events. 10/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 114 event pairs, 4 based on Foata normal form. 5/45 useless extension candidates. Maximal degree in co-relation 87. Up to 19 conditions per place. [2021-03-25 14:52:06,067 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 4 selfloop transitions, 5 changer transitions 3/23 dead transitions. [2021-03-25 14:52:06,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 97 flow [2021-03-25 14:52:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2021-03-25 14:52:06,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8055172413793104 [2021-03-25 14:52:06,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2021-03-25 14:52:06,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2021-03-25 14:52:06,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:06,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2021-03-25 14:52:06,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 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:52:06,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:06,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:06,074 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 59 flow. Second operand 5 states and 584 transitions. [2021-03-25 14:52:06,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 97 flow [2021-03-25 14:52:06,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:06,076 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:06,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2021-03-25 14:52:06,076 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2021-03-25 14:52:06,076 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:06,077 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:06,077 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:06,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:06,087 INFO L129 PetriNetUnfolder]: 7/38 cut-off events. [2021-03-25 14:52:06,087 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-03-25 14:52:06,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 38 events. 7/38 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 3 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 91. Up to 13 conditions per place. [2021-03-25 14:52:06,091 INFO L142 LiptonReduction]: Number of co-enabled transitions 66 [2021-03-25 14:52:06,105 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-25 14:52:06,106 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:06,106 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 14:52:06,107 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:06,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:06,109 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:06,109 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:06,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:52:06,109 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1540542662, now seen corresponding path program 1 times [2021-03-25 14:52:06,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:06,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151608221] [2021-03-25 14:52:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:06,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:06,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:06,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:06,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:06,232 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:52:06,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151608221] [2021-03-25 14:52:06,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:06,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:06,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259649109] [2021-03-25 14:52:06,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:06,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:06,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 145 [2021-03-25 14:52:06,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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:52:06,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:06,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 145 [2021-03-25 14:52:06,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:06,283 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-25 14:52:06,283 INFO L130 PetriNetUnfolder]: For 30/40 co-relation queries the response was YES. [2021-03-25 14:52:06,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 28 events. 3/28 cut-off events. For 30/40 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 14/42 useless extension candidates. Maximal degree in co-relation 79. Up to 12 conditions per place. [2021-03-25 14:52:06,284 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 2 selfloop transitions, 8 changer transitions 2/23 dead transitions. [2021-03-25 14:52:06,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 129 flow [2021-03-25 14:52:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:52:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:52:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2021-03-25 14:52:06,289 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-25 14:52:06,289 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2021-03-25 14:52:06,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2021-03-25 14:52:06,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:06,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2021-03-25 14:52:06,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:52:06,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:52:06,294 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:52:06,295 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 91 flow. Second operand 7 states and 812 transitions. [2021-03-25 14:52:06,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 129 flow [2021-03-25 14:52:06,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 23 transitions, 123 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:06,298 INFO L241 Difference]: Finished difference. Result has 38 places, 21 transitions, 118 flow [2021-03-25 14:52:06,298 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2021-03-25 14:52:06,298 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2021-03-25 14:52:06,298 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:06,299 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 118 flow [2021-03-25 14:52:06,299 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 118 flow [2021-03-25 14:52:06,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 118 flow [2021-03-25 14:52:06,304 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-03-25 14:52:06,305 INFO L130 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2021-03-25 14:52:06,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 25 events. 2/25 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2021-03-25 14:52:06,305 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-25 14:52:06,588 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:52:06,717 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:52:07,469 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 189 [2021-03-25 14:52:07,715 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 14:52:09,170 WARN L205 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 343 DAG size of output: 265 [2021-03-25 14:52:09,687 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-25 14:52:09,691 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-25 14:52:09,691 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:52:09,691 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3393 [2021-03-25 14:52:09,692 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 16 transitions, 96 flow [2021-03-25 14:52:09,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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:52:09,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:09,692 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:09,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:52:09,693 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1404694880, now seen corresponding path program 1 times [2021-03-25 14:52:09,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:09,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061745769] [2021-03-25 14:52:09,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:09,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:09,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:52:09,780 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.2 percent of original size [2021-03-25 14:52:09,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:52:09,802 INFO L142 QuantifierPusher]: treesize reduction 29, result has 58.0 percent of original size [2021-03-25 14:52:09,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 14:52:09,833 INFO L142 QuantifierPusher]: treesize reduction 29, result has 59.7 percent of original size [2021-03-25 14:52:09,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 14:52:09,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:09,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:52:09,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:09,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:52:09,902 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:52:09,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061745769] [2021-03-25 14:52:09,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:09,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:52:09,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62183214] [2021-03-25 14:52:09,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:52:09,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:52:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:52:09,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 148 [2021-03-25 14:52:09,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 16 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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:52:09,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:09,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 148 [2021-03-25 14:52:09,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:10,029 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-25 14:52:10,029 INFO L130 PetriNetUnfolder]: For 140/145 co-relation queries the response was YES. [2021-03-25 14:52:10,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 27 events. 3/27 cut-off events. For 140/145 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 6/33 useless extension candidates. Maximal degree in co-relation 97. Up to 12 conditions per place. [2021-03-25 14:52:10,030 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 4 selfloop transitions, 5 changer transitions 3/19 dead transitions. [2021-03-25 14:52:10,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 19 transitions, 136 flow [2021-03-25 14:52:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:52:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:52:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 845 transitions. [2021-03-25 14:52:10,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7136824324324325 [2021-03-25 14:52:10,034 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 845 transitions. [2021-03-25 14:52:10,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 845 transitions. [2021-03-25 14:52:10,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:10,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 845 transitions. [2021-03-25 14:52:10,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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:52:10,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:52:10,038 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:52:10,038 INFO L185 Difference]: Start difference. First operand has 34 places, 16 transitions, 96 flow. Second operand 8 states and 845 transitions. [2021-03-25 14:52:10,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 19 transitions, 136 flow [2021-03-25 14:52:10,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 19 transitions, 105 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-25 14:52:10,040 INFO L241 Difference]: Finished difference. Result has 32 places, 15 transitions, 78 flow [2021-03-25 14:52:10,040 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2021-03-25 14:52:10,040 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-03-25 14:52:10,041 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:10,041 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 15 transitions, 78 flow [2021-03-25 14:52:10,041 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 15 transitions, 78 flow [2021-03-25 14:52:10,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 15 transitions, 78 flow [2021-03-25 14:52:10,045 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2021-03-25 14:52:10,045 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-25 14:52:10,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 20 events. 2/20 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 49. Up to 7 conditions per place. [2021-03-25 14:52:10,045 INFO L142 LiptonReduction]: Number of co-enabled transitions 8 [2021-03-25 14:52:10,256 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 14:52:10,643 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-25 14:52:10,767 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:52:10,769 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:52:10,769 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:10,769 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 729 [2021-03-25 14:52:10,769 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 15 transitions, 79 flow [2021-03-25 14:52:10,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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:52:10,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:10,770 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:10,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:52:10,770 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 433911784, now seen corresponding path program 1 times [2021-03-25 14:52:10,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:10,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464739366] [2021-03-25 14:52:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:52:10,797 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:52:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:52:10,821 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:52:10,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:52:10,844 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:52:10,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:52:10,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:52:10 BasicIcfg [2021-03-25 14:52:10,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:52:10,910 INFO L168 Benchmark]: Toolchain (without parser) took 20981.41 ms. Allocated memory was 255.9 MB in the beginning and 589.3 MB in the end (delta: 333.4 MB). Free memory was 234.8 MB in the beginning and 397.8 MB in the end (delta: -163.0 MB). Peak memory consumption was 168.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:10,911 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:52:10,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.17 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.4 MB in the beginning and 299.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:10,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.10 ms. Allocated memory is still 339.7 MB. Free memory was 299.4 MB in the beginning and 296.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:10,915 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 339.7 MB. Free memory was 296.4 MB in the beginning and 294.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:10,915 INFO L168 Benchmark]: RCFGBuilder took 1763.60 ms. Allocated memory is still 339.7 MB. Free memory was 294.3 MB in the beginning and 232.1 MB in the end (delta: 62.2 MB). Peak memory consumption was 63.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:10,916 INFO L168 Benchmark]: TraceAbstraction took 18588.20 ms. Allocated memory was 339.7 MB in the beginning and 589.3 MB in the end (delta: 249.6 MB). Free memory was 232.1 MB in the beginning and 397.8 MB in the end (delta: -165.7 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:10,921 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 533.17 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.4 MB in the beginning and 299.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 58.10 ms. Allocated memory is still 339.7 MB. Free memory was 299.4 MB in the beginning and 296.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 339.7 MB. Free memory was 296.4 MB in the beginning and 294.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1763.60 ms. Allocated memory is still 339.7 MB. Free memory was 294.3 MB in the beginning and 232.1 MB in the end (delta: 62.2 MB). Peak memory consumption was 63.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18588.20 ms. Allocated memory was 339.7 MB in the beginning and 589.3 MB in the end (delta: 249.6 MB). Free memory was 232.1 MB in the beginning and 397.8 MB in the end (delta: -165.7 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7725.9ms, 83 PlacesBefore, 35 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 774, positive: 727, positive conditional: 0, positive unconditional: 727, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 584, positive: 561, positive conditional: 0, positive unconditional: 561, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, positive: 561, positive conditional: 0, positive unconditional: 561, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, positive: 558, positive conditional: 0, positive unconditional: 558, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 299, negative conditional: 0, negative unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 774, positive: 166, positive conditional: 0, positive unconditional: 166, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 584, unknown conditional: 0, unknown unconditional: 584] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3064.4ms, 33 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1258.5ms, 25 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 119, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 325.1ms, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3ms, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 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: 17, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.0ms, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3392.1ms, 38 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 16 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 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: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 728.1ms, 32 PlacesBefore, 30 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18409.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 555.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7801.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24 SDtfs, 11 SDslu, 15 SDs, 0 SdLazy, 114 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 168.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 250.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=6, InterpolantAutomatonStates: 34, 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: 29.0ms SsaConstructionTime, 315.5ms SatisfiabilityAnalysisTime, 646.3ms InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...