/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:25:50,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:25:50,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:25:50,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:25:50,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:25:50,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:25:50,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:25:50,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:25:50,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:25:50,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:25:50,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:25:50,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:25:50,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:25:50,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:25:50,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:25:50,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:25:50,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:25:50,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:25:50,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:25:50,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:25:50,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:25:50,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:25:50,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:25:50,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:25:50,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:25:50,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:25:50,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:25:50,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:25:50,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:25:50,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:25:50,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:25:50,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:25:50,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:25:50,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:25:50,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:25:50,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:25:50,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:25:50,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:25:50,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:25:50,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:25:50,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:25:50,338 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-06-11 06:25:50,367 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:25:50,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:25:50,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:25:50,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:25:50,369 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:25:50,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:25:50,369 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:25:50,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:25:50,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:25:50,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:25:50,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:25:50,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:25:50,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:25:50,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:25:50,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:25:50,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:25:50,373 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-06-11 06:25:50,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:25:50,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:25:50,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:25:50,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:25:50,607 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:25:50,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2021-06-11 06:25:50,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586d6b21c/7f88e42c43424fa0b29879c79e0f02b0/FLAG9bef4781f [2021-06-11 06:25:51,028 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:25:51,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2021-06-11 06:25:51,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586d6b21c/7f88e42c43424fa0b29879c79e0f02b0/FLAG9bef4781f [2021-06-11 06:25:51,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586d6b21c/7f88e42c43424fa0b29879c79e0f02b0 [2021-06-11 06:25:51,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:25:51,399 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:25:51,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:25:51,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:25:51,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:25:51,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf4ac72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51, skipping insertion in model container [2021-06-11 06:25:51,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:25:51,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:25:51,537 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i[950,963] [2021-06-11 06:25:51,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:25:51,714 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:25:51,722 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i[950,963] [2021-06-11 06:25:51,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:25:51,784 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:25:51,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51 WrapperNode [2021-06-11 06:25:51,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:25:51,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:25:51,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:25:51,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:25:51,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:25:51,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:25:51,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:25:51,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:25:51,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (1/1) ... [2021-06-11 06:25:51,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:25:51,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:25:51,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:25:51,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:25:51,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (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-06-11 06:25:51,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:25:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:25:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:25:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:25:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:25:51,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:25:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:25:51,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:25:51,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:25:51,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:25:51,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:25:51,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:25:51,913 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:25:53,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:25:53,099 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:25:53,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:25:53 BoogieIcfgContainer [2021-06-11 06:25:53,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:25:53,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:25:53,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:25:53,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:25:53,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:25:51" (1/3) ... [2021-06-11 06:25:53,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33796d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:25:53, skipping insertion in model container [2021-06-11 06:25:53,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:25:51" (2/3) ... [2021-06-11 06:25:53,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33796d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:25:53, skipping insertion in model container [2021-06-11 06:25:53,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:25:53" (3/3) ... [2021-06-11 06:25:53,105 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2021-06-11 06:25:53,109 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:25:53,111 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:25:53,112 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:25:53,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:25:53,143 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:25:53,154 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 06:25:53,166 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:25:53,166 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:25:53,166 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:25:53,166 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:25:53,166 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:25:53,166 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:25:53,166 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:25:53,166 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:25:53,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-06-11 06:25:53,192 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-06-11 06:25:53,192 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:25:53,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-06-11 06:25:53,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-06-11 06:25:53,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-06-11 06:25:53,198 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:25:53,208 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-06-11 06:25:53,212 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-06-11 06:25:53,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-06-11 06:25:53,233 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-06-11 06:25:53,233 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:25:53,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-06-11 06:25:53,236 INFO L151 LiptonReduction]: Number of co-enabled transitions 1046 [2021-06-11 06:25:53,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:53,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:53,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:53,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:53,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:25:53,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:25:53,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:53,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:53,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:53,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:54,134 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-06-11 06:25:54,440 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 06:25:55,654 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-06-11 06:25:56,197 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 06:25:56,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:56,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:25:56,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:25:56,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:56,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:25:56,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:25:56,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,658 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:25:56,659 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:25:56,677 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,831 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:25:56,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:56,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:56,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:57,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:57,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:57,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:57,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:57,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:57,448 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:25:57,825 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 06:25:57,939 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 06:25:57,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:57,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:25:57,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:57,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,959 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:25:57,959 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:25:57,961 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,963 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 06:25:57,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:57,964 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 06:25:57,965 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 06:25:57,965 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:25:57,966 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,968 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 06:25:57,968 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 06:25:57,968 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:25:57,969 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,973 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 06:25:57,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:57,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:58,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:25:58,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 06:25:58,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,245 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:25:58,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:25:58,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:25:58,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:25:58,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:58,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:25:58,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:25:59,101 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 06:25:59,375 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 06:25:59,942 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 06:26:00,508 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 06:26:00,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:00,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:00,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:00,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:01,059 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-06-11 06:26:01,358 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-06-11 06:26:02,003 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-11 06:26:02,643 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-11 06:26:02,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:02,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:26:02,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:02,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:26:02,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:26:03,035 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-11 06:26:03,151 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 06:26:03,402 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-11 06:26:03,509 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 06:26:03,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:03,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:26:03,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:03,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:26:03,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:26:03,743 INFO L163 LiptonReduction]: Checked pairs total: 3170 [2021-06-11 06:26:03,743 INFO L165 LiptonReduction]: Total number of compositions: 79 [2021-06-11 06:26:03,745 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10548 [2021-06-11 06:26:03,757 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2021-06-11 06:26:03,757 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:26:03,757 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:03,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 06:26:03,762 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 893702712, now seen corresponding path program 1 times [2021-06-11 06:26:03,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:03,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114900745] [2021-06-11 06:26:03,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:03,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:03,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:03,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114900745] [2021-06-11 06:26:03,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:03,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:26:03,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617653500] [2021-06-11 06:26:03,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:26:03,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:26:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:26:03,906 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 162 [2021-06-11 06:26:03,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:03,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:03,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 162 [2021-06-11 06:26:03,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:03,957 INFO L129 PetriNetUnfolder]: 23/88 cut-off events. [2021-06-11 06:26:03,957 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:26:03,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 88 events. 23/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 357 event pairs, 3 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 134. Up to 37 conditions per place. [2021-06-11 06:26:03,960 INFO L132 encePairwiseOnDemand]: 156/162 looper letters, 7 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2021-06-11 06:26:03,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 74 flow [2021-06-11 06:26:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:26:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:26:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2021-06-11 06:26:03,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8209876543209876 [2021-06-11 06:26:03,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2021-06-11 06:26:03,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2021-06-11 06:26:03,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:03,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2021-06-11 06:26:03,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:03,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:03,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:03,988 INFO L185 Difference]: Start difference. First operand has 28 places, 23 transitions, 52 flow. Second operand 3 states and 399 transitions. [2021-06-11 06:26:03,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 74 flow [2021-06-11 06:26:03,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:26:03,991 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2021-06-11 06:26:03,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2021-06-11 06:26:03,993 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2021-06-11 06:26:03,993 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:03,993 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 44 flow [2021-06-11 06:26:03,994 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 44 flow [2021-06-11 06:26:03,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 44 flow [2021-06-11 06:26:04,000 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-11 06:26:04,000 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:26:04,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:26:04,000 INFO L151 LiptonReduction]: Number of co-enabled transitions 144 [2021-06-11 06:26:04,110 INFO L163 LiptonReduction]: Checked pairs total: 176 [2021-06-11 06:26:04,110 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:26:04,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-06-11 06:26:04,111 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-06-11 06:26:04,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:04,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:04,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:26:04,111 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash -145107457, now seen corresponding path program 1 times [2021-06-11 06:26:04,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:04,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816283515] [2021-06-11 06:26:04,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:04,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:04,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816283515] [2021-06-11 06:26:04,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:04,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:26:04,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635263566] [2021-06-11 06:26:04,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:26:04,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:26:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:26:04,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 162 [2021-06-11 06:26:04,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:04,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 162 [2021-06-11 06:26:04,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:04,228 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-11 06:26:04,228 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:26:04,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 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-06-11 06:26:04,228 INFO L132 encePairwiseOnDemand]: 159/162 looper letters, 1 selfloop transitions, 2 changer transitions 1/18 dead transitions. [2021-06-11 06:26:04,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 18 transitions, 50 flow [2021-06-11 06:26:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:26:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:26:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2021-06-11 06:26:04,229 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8292181069958847 [2021-06-11 06:26:04,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2021-06-11 06:26:04,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2021-06-11 06:26:04,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:04,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2021-06-11 06:26:04,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,234 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 403 transitions. [2021-06-11 06:26:04,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 18 transitions, 50 flow [2021-06-11 06:26:04,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 18 transitions, 46 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:26:04,235 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 46 flow [2021-06-11 06:26:04,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2021-06-11 06:26:04,235 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2021-06-11 06:26:04,236 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:04,236 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 46 flow [2021-06-11 06:26:04,236 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 46 flow [2021-06-11 06:26:04,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2021-06-11 06:26:04,238 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-06-11 06:26:04,238 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:26:04,238 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-06-11 06:26:04,238 INFO L151 LiptonReduction]: Number of co-enabled transitions 116 [2021-06-11 06:26:04,239 INFO L163 LiptonReduction]: Checked pairs total: 146 [2021-06-11 06:26:04,239 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:26:04,239 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3 [2021-06-11 06:26:04,240 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 46 flow [2021-06-11 06:26:04,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,240 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:04,240 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:04,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:26:04,240 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1773153319, now seen corresponding path program 1 times [2021-06-11 06:26:04,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:04,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328375678] [2021-06-11 06:26:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:04,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:04,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:04,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328375678] [2021-06-11 06:26:04,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:04,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:26:04,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407719377] [2021-06-11 06:26:04,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:26:04,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:04,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:26:04,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:26:04,286 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 162 [2021-06-11 06:26:04,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:04,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 162 [2021-06-11 06:26:04,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:04,300 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-06-11 06:26:04,300 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 06:26:04,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 36 events. 2/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 95 event pairs, 0 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 56. Up to 9 conditions per place. [2021-06-11 06:26:04,301 INFO L132 encePairwiseOnDemand]: 159/162 looper letters, 6 selfloop transitions, 2 changer transitions 1/20 dead transitions. [2021-06-11 06:26:04,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 73 flow [2021-06-11 06:26:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:26:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:26:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2021-06-11 06:26:04,302 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8168724279835391 [2021-06-11 06:26:04,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2021-06-11 06:26:04,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2021-06-11 06:26:04,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:04,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2021-06-11 06:26:04,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,304 INFO L185 Difference]: Start difference. First operand has 25 places, 17 transitions, 46 flow. Second operand 3 states and 397 transitions. [2021-06-11 06:26:04,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 73 flow [2021-06-11 06:26:04,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:26:04,305 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 50 flow [2021-06-11 06:26:04,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2021-06-11 06:26:04,305 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2021-06-11 06:26:04,305 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:04,305 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 50 flow [2021-06-11 06:26:04,306 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 50 flow [2021-06-11 06:26:04,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 50 flow [2021-06-11 06:26:04,308 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-06-11 06:26:04,308 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 06:26:04,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 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-06-11 06:26:04,308 INFO L151 LiptonReduction]: Number of co-enabled transitions 82 [2021-06-11 06:26:04,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:04,403 INFO L163 LiptonReduction]: Checked pairs total: 181 [2021-06-11 06:26:04,404 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:26:04,404 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 99 [2021-06-11 06:26:04,404 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 48 flow [2021-06-11 06:26:04,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:04,405 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:04,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:26:04,405 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:04,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash 124563151, now seen corresponding path program 1 times [2021-06-11 06:26:04,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:04,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314577640] [2021-06-11 06:26:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:04,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:26:04,497 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 06:26:04,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 06:26:04,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:26:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:04,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314577640] [2021-06-11 06:26:04,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:04,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:26:04,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594969441] [2021-06-11 06:26:04,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:26:04,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:26:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:26:04,516 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 163 [2021-06-11 06:26:04,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:04,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 163 [2021-06-11 06:26:04,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:04,568 INFO L129 PetriNetUnfolder]: 15/52 cut-off events. [2021-06-11 06:26:04,569 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-11 06:26:04,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 52 events. 15/52 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 6 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 103. Up to 30 conditions per place. [2021-06-11 06:26:04,571 INFO L132 encePairwiseOnDemand]: 158/163 looper letters, 7 selfloop transitions, 4 changer transitions 0/20 dead transitions. [2021-06-11 06:26:04,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 78 flow [2021-06-11 06:26:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:26:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:26:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2021-06-11 06:26:04,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7116564417177914 [2021-06-11 06:26:04,574 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2021-06-11 06:26:04,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2021-06-11 06:26:04,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:04,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2021-06-11 06:26:04,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,576 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,576 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 48 flow. Second operand 4 states and 464 transitions. [2021-06-11 06:26:04,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 78 flow [2021-06-11 06:26:04,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:26:04,577 INFO L241 Difference]: Finished difference. Result has 27 places, 18 transitions, 65 flow [2021-06-11 06:26:04,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2021-06-11 06:26:04,578 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2021-06-11 06:26:04,578 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:04,578 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 65 flow [2021-06-11 06:26:04,578 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 65 flow [2021-06-11 06:26:04,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 65 flow [2021-06-11 06:26:04,586 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2021-06-11 06:26:04,586 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-11 06:26:04,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 24 events. 3/24 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-06-11 06:26:04,587 INFO L151 LiptonReduction]: Number of co-enabled transitions 80 [2021-06-11 06:26:04,613 INFO L163 LiptonReduction]: Checked pairs total: 65 [2021-06-11 06:26:04,613 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:26:04,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-06-11 06:26:04,614 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 65 flow [2021-06-11 06:26:04,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:04,614 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:04,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:26:04,615 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash 561863140, now seen corresponding path program 1 times [2021-06-11 06:26:04,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:04,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489949777] [2021-06-11 06:26:04,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:04,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:04,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:04,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:04,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489949777] [2021-06-11 06:26:04,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:04,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:26:04,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431658068] [2021-06-11 06:26:04,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:26:04,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:26:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:26:04,664 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 163 [2021-06-11 06:26:04,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:04,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 163 [2021-06-11 06:26:04,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:04,685 INFO L129 PetriNetUnfolder]: 5/39 cut-off events. [2021-06-11 06:26:04,685 INFO L130 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2021-06-11 06:26:04,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 39 events. 5/39 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 1 based on Foata normal form. 4/43 useless extension candidates. Maximal degree in co-relation 84. Up to 15 conditions per place. [2021-06-11 06:26:04,686 INFO L132 encePairwiseOnDemand]: 160/163 looper letters, 6 selfloop transitions, 1 changer transitions 2/21 dead transitions. [2021-06-11 06:26:04,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 21 transitions, 91 flow [2021-06-11 06:26:04,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:26:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:26:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2021-06-11 06:26:04,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7699386503067485 [2021-06-11 06:26:04,687 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2021-06-11 06:26:04,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2021-06-11 06:26:04,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:04,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2021-06-11 06:26:04,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,690 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,690 INFO L185 Difference]: Start difference. First operand has 27 places, 18 transitions, 65 flow. Second operand 4 states and 502 transitions. [2021-06-11 06:26:04,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 21 transitions, 91 flow [2021-06-11 06:26:04,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:26:04,691 INFO L241 Difference]: Finished difference. Result has 30 places, 18 transitions, 67 flow [2021-06-11 06:26:04,691 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2021-06-11 06:26:04,691 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2021-06-11 06:26:04,691 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:04,691 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 67 flow [2021-06-11 06:26:04,691 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 67 flow [2021-06-11 06:26:04,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 18 transitions, 67 flow [2021-06-11 06:26:04,719 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-06-11 06:26:04,719 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-11 06:26:04,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 28 events. 3/28 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2021-06-11 06:26:04,720 INFO L151 LiptonReduction]: Number of co-enabled transitions 72 [2021-06-11 06:26:04,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:04,845 INFO L163 LiptonReduction]: Checked pairs total: 91 [2021-06-11 06:26:04,846 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:26:04,846 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 155 [2021-06-11 06:26:04,846 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 65 flow [2021-06-11 06:26:04,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,847 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:04,847 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:04,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:26:04,847 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 561995548, now seen corresponding path program 2 times [2021-06-11 06:26:04,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:04,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20595215] [2021-06-11 06:26:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:04,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:26:04,891 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-11 06:26:04,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 06:26:04,902 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 06:26:04,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 06:26:04,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:04,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:26:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:04,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20595215] [2021-06-11 06:26:04,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:04,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:26:04,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165815380] [2021-06-11 06:26:04,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:26:04,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:26:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:26:04,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 164 [2021-06-11 06:26:04,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:04,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 164 [2021-06-11 06:26:04,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:04,966 INFO L129 PetriNetUnfolder]: 14/51 cut-off events. [2021-06-11 06:26:04,966 INFO L130 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2021-06-11 06:26:04,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 51 events. 14/51 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 1 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 125. Up to 26 conditions per place. [2021-06-11 06:26:04,966 INFO L132 encePairwiseOnDemand]: 158/164 looper letters, 7 selfloop transitions, 6 changer transitions 0/21 dead transitions. [2021-06-11 06:26:04,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 101 flow [2021-06-11 06:26:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:26:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:26:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2021-06-11 06:26:04,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7036585365853658 [2021-06-11 06:26:04,968 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2021-06-11 06:26:04,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2021-06-11 06:26:04,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:04,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2021-06-11 06:26:04,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,971 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,971 INFO L185 Difference]: Start difference. First operand has 28 places, 17 transitions, 65 flow. Second operand 5 states and 577 transitions. [2021-06-11 06:26:04,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 101 flow [2021-06-11 06:26:04,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 95 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-06-11 06:26:04,972 INFO L241 Difference]: Finished difference. Result has 30 places, 19 transitions, 87 flow [2021-06-11 06:26:04,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2021-06-11 06:26:04,973 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2021-06-11 06:26:04,973 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:04,973 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 87 flow [2021-06-11 06:26:04,973 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 19 transitions, 87 flow [2021-06-11 06:26:04,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 19 transitions, 87 flow [2021-06-11 06:26:04,978 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-06-11 06:26:04,978 INFO L130 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2021-06-11 06:26:04,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 30 events. 5/30 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 74. Up to 13 conditions per place. [2021-06-11 06:26:04,978 INFO L151 LiptonReduction]: Number of co-enabled transitions 74 [2021-06-11 06:26:04,979 INFO L163 LiptonReduction]: Checked pairs total: 42 [2021-06-11 06:26:04,979 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:26:04,979 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-06-11 06:26:04,980 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 87 flow [2021-06-11 06:26:04,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:04,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:04,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:04,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:26:04,981 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1819391679, now seen corresponding path program 1 times [2021-06-11 06:26:04,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:04,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563521459] [2021-06-11 06:26:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:05,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:05,031 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:26:05,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:26:05,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:05,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563521459] [2021-06-11 06:26:05,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:05,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:26:05,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626834347] [2021-06-11 06:26:05,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:26:05,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:26:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:26:05,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 164 [2021-06-11 06:26:05,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:05,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 164 [2021-06-11 06:26:05,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:05,063 INFO L129 PetriNetUnfolder]: 11/52 cut-off events. [2021-06-11 06:26:05,063 INFO L130 PetriNetUnfolder]: For 46/49 co-relation queries the response was YES. [2021-06-11 06:26:05,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 52 events. 11/52 cut-off events. For 46/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 162 event pairs, 3 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 128. Up to 22 conditions per place. [2021-06-11 06:26:05,064 INFO L132 encePairwiseOnDemand]: 159/164 looper letters, 4 selfloop transitions, 5 changer transitions 3/26 dead transitions. [2021-06-11 06:26:05,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 125 flow [2021-06-11 06:26:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:26:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:26:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2021-06-11 06:26:05,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7792682926829269 [2021-06-11 06:26:05,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2021-06-11 06:26:05,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2021-06-11 06:26:05,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:05,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2021-06-11 06:26:05,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,069 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,069 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 87 flow. Second operand 5 states and 639 transitions. [2021-06-11 06:26:05,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 125 flow [2021-06-11 06:26:05,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 115 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-11 06:26:05,070 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 114 flow [2021-06-11 06:26:05,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-06-11 06:26:05,070 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2021-06-11 06:26:05,070 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:05,071 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 114 flow [2021-06-11 06:26:05,071 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 114 flow [2021-06-11 06:26:05,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 114 flow [2021-06-11 06:26:05,077 INFO L129 PetriNetUnfolder]: 8/47 cut-off events. [2021-06-11 06:26:05,077 INFO L130 PetriNetUnfolder]: For 54/57 co-relation queries the response was YES. [2021-06-11 06:26:05,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 47 events. 8/47 cut-off events. For 54/57 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 3 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 132. Up to 15 conditions per place. [2021-06-11 06:26:05,078 INFO L151 LiptonReduction]: Number of co-enabled transitions 80 [2021-06-11 06:26:05,079 INFO L163 LiptonReduction]: Checked pairs total: 7 [2021-06-11 06:26:05,079 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:26:05,079 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 06:26:05,079 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 114 flow [2021-06-11 06:26:05,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,080 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:05,080 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:05,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:26:05,080 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1040660801, now seen corresponding path program 1 times [2021-06-11 06:26:05,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:05,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16673059] [2021-06-11 06:26:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:05,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:05,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:05,115 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:26:05,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:26:05,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:05,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16673059] [2021-06-11 06:26:05,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:05,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:26:05,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109684786] [2021-06-11 06:26:05,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:26:05,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:26:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:26:05,123 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 164 [2021-06-11 06:26:05,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:05,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 164 [2021-06-11 06:26:05,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:05,152 INFO L129 PetriNetUnfolder]: 4/35 cut-off events. [2021-06-11 06:26:05,152 INFO L130 PetriNetUnfolder]: For 42/55 co-relation queries the response was YES. [2021-06-11 06:26:05,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 35 events. 4/35 cut-off events. For 42/55 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 18/53 useless extension candidates. Maximal degree in co-relation 105. Up to 14 conditions per place. [2021-06-11 06:26:05,152 INFO L132 encePairwiseOnDemand]: 159/164 looper letters, 2 selfloop transitions, 8 changer transitions 2/26 dead transitions. [2021-06-11 06:26:05,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 26 transitions, 152 flow [2021-06-11 06:26:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:26:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:26:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2021-06-11 06:26:05,154 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.774390243902439 [2021-06-11 06:26:05,154 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2021-06-11 06:26:05,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2021-06-11 06:26:05,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:05,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2021-06-11 06:26:05,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,158 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,158 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 114 flow. Second operand 7 states and 889 transitions. [2021-06-11 06:26:05,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 26 transitions, 152 flow [2021-06-11 06:26:05,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 140 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-06-11 06:26:05,159 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 135 flow [2021-06-11 06:26:05,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2021-06-11 06:26:05,159 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places. [2021-06-11 06:26:05,159 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:05,159 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 135 flow [2021-06-11 06:26:05,159 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 135 flow [2021-06-11 06:26:05,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 135 flow [2021-06-11 06:26:05,163 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-06-11 06:26:05,163 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-11 06:26:05,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 31 events. 3/31 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 91. Up to 12 conditions per place. [2021-06-11 06:26:05,163 INFO L151 LiptonReduction]: Number of co-enabled transitions 60 [2021-06-11 06:26:05,165 INFO L163 LiptonReduction]: Checked pairs total: 36 [2021-06-11 06:26:05,165 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:26:05,165 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-06-11 06:26:05,165 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 135 flow [2021-06-11 06:26:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,165 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:05,166 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:05,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:26:05,166 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 851255589, now seen corresponding path program 1 times [2021-06-11 06:26:05,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:05,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605400495] [2021-06-11 06:26:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:26:05,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:05,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:05,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:26:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:26:05,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605400495] [2021-06-11 06:26:05,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:26:05,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:26:05,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874588463] [2021-06-11 06:26:05,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:26:05,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:26:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:26:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:26:05,223 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2021-06-11 06:26:05,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:26:05,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2021-06-11 06:26:05,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:26:05,243 INFO L129 PetriNetUnfolder]: 6/57 cut-off events. [2021-06-11 06:26:05,243 INFO L130 PetriNetUnfolder]: For 94/95 co-relation queries the response was YES. [2021-06-11 06:26:05,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 57 events. 6/57 cut-off events. For 94/95 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 0 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 184. Up to 22 conditions per place. [2021-06-11 06:26:05,243 INFO L132 encePairwiseOnDemand]: 161/164 looper letters, 4 selfloop transitions, 1 changer transitions 1/25 dead transitions. [2021-06-11 06:26:05,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 25 transitions, 149 flow [2021-06-11 06:26:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:26:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:26:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2021-06-11 06:26:05,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.760670731707317 [2021-06-11 06:26:05,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2021-06-11 06:26:05,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2021-06-11 06:26:05,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:26:05,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2021-06-11 06:26:05,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,247 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,247 INFO L185 Difference]: Start difference. First operand has 40 places, 24 transitions, 135 flow. Second operand 4 states and 499 transitions. [2021-06-11 06:26:05,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 25 transitions, 149 flow [2021-06-11 06:26:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 25 transitions, 124 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-06-11 06:26:05,249 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 117 flow [2021-06-11 06:26:05,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-06-11 06:26:05,249 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2021-06-11 06:26:05,249 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:26:05,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 117 flow [2021-06-11 06:26:05,250 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 117 flow [2021-06-11 06:26:05,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 117 flow [2021-06-11 06:26:05,254 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-06-11 06:26:05,255 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-11 06:26:05,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 36 events. 3/36 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 84 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 94. Up to 9 conditions per place. [2021-06-11 06:26:05,255 INFO L151 LiptonReduction]: Number of co-enabled transitions 50 [2021-06-11 06:26:05,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:05,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:26:05,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:26:05,406 INFO L163 LiptonReduction]: Checked pairs total: 11 [2021-06-11 06:26:05,406 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 06:26:05,406 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 157 [2021-06-11 06:26:05,407 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 117 flow [2021-06-11 06:26:05,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:26:05,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:26:05,407 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:26:05,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:26:05,407 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:26:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:26:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash -118620677, now seen corresponding path program 2 times [2021-06-11 06:26:05,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:26:05,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537736948] [2021-06-11 06:26:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:26:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:26:05,427 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:26:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:26:05,455 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:26:05,473 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:26:05,473 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:26:05,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:26:05,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:26:05 BasicIcfg [2021-06-11 06:26:05,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:26:05,508 INFO L168 Benchmark]: Toolchain (without parser) took 14108.35 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 306.4 MB in the beginning and 341.1 MB in the end (delta: -34.7 MB). Peak memory consumption was 220.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:26:05,508 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory was 324.4 MB in the beginning and 324.3 MB in the end (delta: 73.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:26:05,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.97 ms. Allocated memory is still 343.9 MB. Free memory was 306.2 MB in the beginning and 305.7 MB in the end (delta: 522.7 kB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-11 06:26:05,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.61 ms. Allocated memory is still 343.9 MB. Free memory was 305.7 MB in the beginning and 302.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:26:05,508 INFO L168 Benchmark]: Boogie Preprocessor took 21.00 ms. Allocated memory is still 343.9 MB. Free memory was 302.5 MB in the beginning and 300.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:26:05,509 INFO L168 Benchmark]: RCFGBuilder took 1262.56 ms. Allocated memory is still 343.9 MB. Free memory was 300.4 MB in the beginning and 264.6 MB in the end (delta: 35.8 MB). Peak memory consumption was 152.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:26:05,509 INFO L168 Benchmark]: TraceAbstraction took 12405.73 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 264.6 MB in the beginning and 341.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 177.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:26:05,509 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory was 324.4 MB in the beginning and 324.3 MB in the end (delta: 73.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 383.97 ms. Allocated memory is still 343.9 MB. Free memory was 306.2 MB in the beginning and 305.7 MB in the end (delta: 522.7 kB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.61 ms. Allocated memory is still 343.9 MB. Free memory was 305.7 MB in the beginning and 302.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.00 ms. Allocated memory is still 343.9 MB. Free memory was 302.5 MB in the beginning and 300.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1262.56 ms. Allocated memory is still 343.9 MB. Free memory was 300.4 MB in the beginning and 264.6 MB in the end (delta: 35.8 MB). Peak memory consumption was 152.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12405.73 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 264.6 MB in the beginning and 341.1 MB in the end (delta: -76.5 MB). Peak memory consumption was 177.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10531.9ms, 86 PlacesBefore, 28 PlacesAfterwards, 81 TransitionsBefore, 23 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 79 TotalNumberOfCompositions, 3170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1603, positive: 1472, positive conditional: 0, positive unconditional: 1472, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 851, positive: 803, positive conditional: 0, positive unconditional: 803, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 851, positive: 803, positive conditional: 0, positive unconditional: 803, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 851, positive: 783, positive conditional: 0, positive unconditional: 783, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 605, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 498, negative conditional: 0, negative unconditional: 498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1603, positive: 669, positive conditional: 0, positive unconditional: 669, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 851, unknown conditional: 0, unknown unconditional: 851] , Statistics on independence cache: Total cache size (in pairs): 1502, Positive cache size: 1454, Positive conditional cache size: 0, Positive unconditional cache size: 1454, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.5ms, 26 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1457, Positive conditional cache size: 0, Positive unconditional cache size: 1457, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3ms, 26 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1509, Positive cache size: 1458, Positive conditional cache size: 0, Positive unconditional cache size: 1458, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.9ms, 26 PlacesBefore, 25 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1574, Positive cache size: 1523, Positive conditional cache size: 0, Positive unconditional cache size: 1523, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.4ms, 27 PlacesBefore, 27 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, 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: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1575, Positive cache size: 1523, Positive conditional cache size: 0, Positive unconditional cache size: 1523, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 154.3ms, 30 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 91 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1640, Positive cache size: 1586, Positive conditional cache size: 0, Positive unconditional cache size: 1586, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3ms, 30 PlacesBefore, 30 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 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: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1640, Positive cache size: 1586, Positive conditional cache size: 0, Positive unconditional cache size: 1586, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 7 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, 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: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1640, Positive cache size: 1586, Positive conditional cache size: 0, Positive unconditional cache size: 1586, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3ms, 41 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 26, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1640, Positive cache size: 1586, Positive conditional cache size: 0, Positive unconditional cache size: 1586, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 156.6ms, 39 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 11 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1790, Positive cache size: 1736, Positive conditional cache size: 0, Positive unconditional cache size: 1736, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12310.2ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 365.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10589.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 29 SDtfs, 11 SDslu, 11 SDs, 0 SdLazy, 109 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 116.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 102.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 19.0ms SsaConstructionTime, 242.3ms SatisfiabilityAnalysisTime, 340.0ms InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...