/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:23:29,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:23:29,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:23:29,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:23:29,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:23:29,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:23:29,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:23:29,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:23:29,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:23:29,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:23:29,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:23:29,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:23:29,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:23:29,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:23:29,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:23:29,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:23:29,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:23:29,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:23:29,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:23:29,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:23:29,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:23:29,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:23:29,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:23:29,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:23:29,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:23:29,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:23:29,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:23:29,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:23:29,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:23:29,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:23:29,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:23:29,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:23:29,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:23:29,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:23:29,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:23:29,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:23:29,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:23:29,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:23:29,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:23:29,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:23:29,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:23:29,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:23:29,243 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:23:29,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:23:29,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:23:29,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:23:29,245 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:23:29,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:23:29,245 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:23:29,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:23:29,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:23:29,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:23:29,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:23:29,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:23:29,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:23:29,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:23:29,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:23:29,248 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:23:29,248 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:23:29,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:23:29,248 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:23:29,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:23:29,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:23:29,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:23:29,544 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:23:29,545 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:23:29,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2021-03-26 00:23:29,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91654dc54/c82838d794314e48b1161c1da25b74b9/FLAG1c595b24e [2021-03-26 00:23:30,153 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:23:30,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2021-03-26 00:23:30,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91654dc54/c82838d794314e48b1161c1da25b74b9/FLAG1c595b24e [2021-03-26 00:23:30,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91654dc54/c82838d794314e48b1161c1da25b74b9 [2021-03-26 00:23:30,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:23:30,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:23:30,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:23:30,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:23:30,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:23:30,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:23:30" (1/1) ... [2021-03-26 00:23:30,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b43e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:30, skipping insertion in model container [2021-03-26 00:23:30,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:23:30" (1/1) ... [2021-03-26 00:23:30,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:23:30,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:23:30,654 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/mix054_rmo.opt.i[948,961] [2021-03-26 00:23:30,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:23:30,870 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:23:30,883 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/mix054_rmo.opt.i[948,961] [2021-03-26 00:23:30,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:23:31,009 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:23:31,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31 WrapperNode [2021-03-26 00:23:31,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:23:31,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:23:31,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:23:31,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:23:31,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:23:31,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:23:31,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:23:31,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:23:31,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... [2021-03-26 00:23:31,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:23:31,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:23:31,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:23:31,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:23:31,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:23:31,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:23:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:23:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:23:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:23:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:23:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:23:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:23:31,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:23:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:23:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:23:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:23:31,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:23:31,213 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:23:32,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:23:32,793 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:23:32,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:23:32 BoogieIcfgContainer [2021-03-26 00:23:32,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:23:32,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:23:32,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:23:32,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:23:32,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:23:30" (1/3) ... [2021-03-26 00:23:32,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7538aee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:23:32, skipping insertion in model container [2021-03-26 00:23:32,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:31" (2/3) ... [2021-03-26 00:23:32,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7538aee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:23:32, skipping insertion in model container [2021-03-26 00:23:32,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:23:32" (3/3) ... [2021-03-26 00:23:32,802 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2021-03-26 00:23:32,807 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:23:32,810 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:23:32,811 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:23:32,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,838 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,850 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,851 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:32,855 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:23:32,870 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:23:32,898 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:23:32,899 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:23:32,899 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:23:32,899 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:23:32,899 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:23:32,899 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:23:32,899 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:23:32,899 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:23:32,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 00:23:32,946 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 00:23:32,948 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:32,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 00:23:32,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 00:23:32,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-26 00:23:32,964 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:32,977 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 00:23:32,980 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 00:23:32,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-26 00:23:33,007 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 00:23:33,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:33,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 00:23:33,015 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 00:23:34,019 WARN L205 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 00:23:34,345 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 00:23:35,928 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 00:23:36,543 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 00:23:37,515 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:23:37,941 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 00:23:38,090 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:23:39,389 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 00:23:39,712 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 00:23:40,866 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 263 DAG size of output: 262 [2021-03-26 00:23:41,456 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 00:23:41,739 INFO L154 LiptonReduction]: Checked pairs total: 1544 [2021-03-26 00:23:41,739 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-26 00:23:41,741 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8778 [2021-03-26 00:23:41,749 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:23:41,749 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:41,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:41,750 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:41,750 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1685503753, now seen corresponding path program 1 times [2021-03-26 00:23:41,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:41,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027107668] [2021-03-26 00:23:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:41,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:41,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:41,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:41,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:41,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027107668] [2021-03-26 00:23:41,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:41,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:41,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42506379] [2021-03-26 00:23:41,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:23:41,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:23:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:23:41,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2021-03-26 00:23:41,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:41,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:41,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2021-03-26 00:23:41,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:42,068 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 00:23:42,068 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:42,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 335 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 131. Up to 37 conditions per place. [2021-03-26 00:23:42,071 INFO L132 encePairwiseOnDemand]: 132/136 looper letters, 7 selfloop transitions, 2 changer transitions 5/31 dead transitions. [2021-03-26 00:23:42,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 90 flow [2021-03-26 00:23:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:23:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:23:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-26 00:23:42,087 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2021-03-26 00:23:42,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-26 00:23:42,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-26 00:23:42,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:42,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-26 00:23:42,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:42,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:42,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:42,107 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 356 transitions. [2021-03-26 00:23:42,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 90 flow [2021-03-26 00:23:42,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:42,110 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 54 flow [2021-03-26 00:23:42,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 00:23:42,112 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-26 00:23:42,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:42,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 54 flow [2021-03-26 00:23:42,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 54 flow [2021-03-26 00:23:42,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 54 flow [2021-03-26 00:23:42,122 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:23:42,122 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:42,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 23 events. 0/23 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/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:23:42,123 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 00:23:43,072 WARN L205 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-03-26 00:23:43,401 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 00:23:44,023 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 00:23:44,679 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 00:23:45,575 INFO L154 LiptonReduction]: Checked pairs total: 536 [2021-03-26 00:23:45,576 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 00:23:45,576 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3463 [2021-03-26 00:23:45,577 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-03-26 00:23:45,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:45,577 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:45,577 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:45,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:23:45,577 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1168850318, now seen corresponding path program 1 times [2021-03-26 00:23:45,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:45,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244627647] [2021-03-26 00:23:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:45,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:45,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:45,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:45,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:45,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:45,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:23:45,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:45,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:45,723 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:23:45,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:23:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:45,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244627647] [2021-03-26 00:23:45,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:45,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:23:45,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436771302] [2021-03-26 00:23:45,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:45,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:45,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 143 [2021-03-26 00:23:45,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:45,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:45,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 143 [2021-03-26 00:23:45,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:45,782 INFO L129 PetriNetUnfolder]: 24/67 cut-off events. [2021-03-26 00:23:45,782 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 00:23:45,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 67 events. 24/67 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 218 event pairs, 16 based on Foata normal form. 2/67 useless extension candidates. Maximal degree in co-relation 122. Up to 45 conditions per place. [2021-03-26 00:23:45,784 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 8 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2021-03-26 00:23:45,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 80 flow [2021-03-26 00:23:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2021-03-26 00:23:45,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7395104895104895 [2021-03-26 00:23:45,791 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2021-03-26 00:23:45,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2021-03-26 00:23:45,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:45,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2021-03-26 00:23:45,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:45,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:45,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:45,794 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 4 states and 423 transitions. [2021-03-26 00:23:45,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 80 flow [2021-03-26 00:23:45,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:45,795 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 70 flow [2021-03-26 00:23:45,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, 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=70, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-03-26 00:23:45,796 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2021-03-26 00:23:45,796 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:45,796 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 70 flow [2021-03-26 00:23:45,796 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2021-03-26 00:23:45,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2021-03-26 00:23:45,807 INFO L129 PetriNetUnfolder]: 4/29 cut-off events. [2021-03-26 00:23:45,807 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 00:23:45,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 29 events. 4/29 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 2 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 49. Up to 9 conditions per place. [2021-03-26 00:23:45,808 INFO L142 LiptonReduction]: Number of co-enabled transitions 104 [2021-03-26 00:23:46,074 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 00:23:46,187 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:23:46,454 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 00:23:46,581 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:23:46,638 INFO L154 LiptonReduction]: Checked pairs total: 230 [2021-03-26 00:23:46,639 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:46,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 843 [2021-03-26 00:23:46,640 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 68 flow [2021-03-26 00:23:46,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:46,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:46,640 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:46,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:23:46,640 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1021753945, now seen corresponding path program 1 times [2021-03-26 00:23:46,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:46,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019014307] [2021-03-26 00:23:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:46,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:46,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:46,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:46,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:23:46,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:46,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:46,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019014307] [2021-03-26 00:23:46,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:46,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:46,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495979938] [2021-03-26 00:23:46,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:46,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:46,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2021-03-26 00:23:46,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:46,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:46,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2021-03-26 00:23:46,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:46,863 INFO L129 PetriNetUnfolder]: 22/65 cut-off events. [2021-03-26 00:23:46,864 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-03-26 00:23:46,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 65 events. 22/65 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 224 event pairs, 7 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 152. Up to 38 conditions per place. [2021-03-26 00:23:46,865 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 10 selfloop transitions, 6 changer transitions 0/24 dead transitions. [2021-03-26 00:23:46,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 116 flow [2021-03-26 00:23:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2021-03-26 00:23:46,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2021-03-26 00:23:46,868 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2021-03-26 00:23:46,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2021-03-26 00:23:46,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:46,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2021-03-26 00:23:46,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:46,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:46,874 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:46,874 INFO L185 Difference]: Start difference. First operand has 25 places, 19 transitions, 68 flow. Second operand 4 states and 438 transitions. [2021-03-26 00:23:46,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 116 flow [2021-03-26 00:23:46,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:46,875 INFO L241 Difference]: Finished difference. Result has 29 places, 21 transitions, 93 flow [2021-03-26 00:23:46,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2021-03-26 00:23:46,875 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2021-03-26 00:23:46,876 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:46,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 93 flow [2021-03-26 00:23:46,877 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 93 flow [2021-03-26 00:23:46,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 93 flow [2021-03-26 00:23:46,883 INFO L129 PetriNetUnfolder]: 7/37 cut-off events. [2021-03-26 00:23:46,884 INFO L130 PetriNetUnfolder]: For 28/31 co-relation queries the response was YES. [2021-03-26 00:23:46,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 37 events. 7/37 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 3 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-26 00:23:46,885 INFO L142 LiptonReduction]: Number of co-enabled transitions 108 [2021-03-26 00:23:47,213 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:23:47,609 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2021-03-26 00:23:47,739 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-03-26 00:23:47,797 INFO L154 LiptonReduction]: Checked pairs total: 194 [2021-03-26 00:23:47,797 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:47,798 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 922 [2021-03-26 00:23:47,798 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 97 flow [2021-03-26 00:23:47,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:47,799 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:47,799 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:47,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:23:47,799 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1457857980, now seen corresponding path program 1 times [2021-03-26 00:23:47,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:47,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738892149] [2021-03-26 00:23:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:47,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:47,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:47,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:47,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:47,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:47,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:23:47,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:47,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:47,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738892149] [2021-03-26 00:23:47,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:47,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:47,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172093905] [2021-03-26 00:23:47,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:47,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:47,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:47,924 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2021-03-26 00:23:47,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:47,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:47,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2021-03-26 00:23:47,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:47,996 INFO L129 PetriNetUnfolder]: 29/80 cut-off events. [2021-03-26 00:23:47,996 INFO L130 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2021-03-26 00:23:47,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 80 events. 29/80 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 295 event pairs, 8 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 230. Up to 50 conditions per place. [2021-03-26 00:23:48,000 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 11 changer transitions 0/29 dead transitions. [2021-03-26 00:23:48,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 174 flow [2021-03-26 00:23:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2021-03-26 00:23:48,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7889655172413793 [2021-03-26 00:23:48,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2021-03-26 00:23:48,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2021-03-26 00:23:48,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:48,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2021-03-26 00:23:48,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,008 INFO L185 Difference]: Start difference. First operand has 29 places, 21 transitions, 97 flow. Second operand 5 states and 572 transitions. [2021-03-26 00:23:48,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 174 flow [2021-03-26 00:23:48,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 161 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 00:23:48,011 INFO L241 Difference]: Finished difference. Result has 34 places, 28 transitions, 162 flow [2021-03-26 00:23:48,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2021-03-26 00:23:48,011 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-26 00:23:48,011 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:48,011 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 162 flow [2021-03-26 00:23:48,012 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 162 flow [2021-03-26 00:23:48,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 162 flow [2021-03-26 00:23:48,024 INFO L129 PetriNetUnfolder]: 24/71 cut-off events. [2021-03-26 00:23:48,024 INFO L130 PetriNetUnfolder]: For 157/162 co-relation queries the response was YES. [2021-03-26 00:23:48,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 71 events. 24/71 cut-off events. For 157/162 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 248 event pairs, 4 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 218. Up to 27 conditions per place. [2021-03-26 00:23:48,026 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 00:23:48,100 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 00:23:48,100 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:48,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-26 00:23:48,104 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 162 flow [2021-03-26 00:23:48,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:48,104 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:48,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:23:48,105 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash -684222064, now seen corresponding path program 1 times [2021-03-26 00:23:48,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:48,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425132869] [2021-03-26 00:23:48,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:48,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:23:48,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:23:48,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:48,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425132869] [2021-03-26 00:23:48,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:48,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:48,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972992397] [2021-03-26 00:23:48,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:48,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:48,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2021-03-26 00:23:48,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:48,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2021-03-26 00:23:48,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:48,322 INFO L129 PetriNetUnfolder]: 30/80 cut-off events. [2021-03-26 00:23:48,322 INFO L130 PetriNetUnfolder]: For 163/167 co-relation queries the response was YES. [2021-03-26 00:23:48,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 80 events. 30/80 cut-off events. For 163/167 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 278 event pairs, 1 based on Foata normal form. 5/85 useless extension candidates. Maximal degree in co-relation 295. Up to 49 conditions per place. [2021-03-26 00:23:48,323 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 15 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2021-03-26 00:23:48,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 243 flow [2021-03-26 00:23:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2021-03-26 00:23:48,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7406896551724138 [2021-03-26 00:23:48,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2021-03-26 00:23:48,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2021-03-26 00:23:48,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:48,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2021-03-26 00:23:48,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,329 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,329 INFO L185 Difference]: Start difference. First operand has 34 places, 28 transitions, 162 flow. Second operand 5 states and 537 transitions. [2021-03-26 00:23:48,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 243 flow [2021-03-26 00:23:48,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 232 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 00:23:48,332 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 205 flow [2021-03-26 00:23:48,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-26 00:23:48,333 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2021-03-26 00:23:48,333 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:48,333 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 205 flow [2021-03-26 00:23:48,333 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 205 flow [2021-03-26 00:23:48,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 205 flow [2021-03-26 00:23:48,344 INFO L129 PetriNetUnfolder]: 24/71 cut-off events. [2021-03-26 00:23:48,344 INFO L130 PetriNetUnfolder]: For 251/258 co-relation queries the response was YES. [2021-03-26 00:23:48,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 71 events. 24/71 cut-off events. For 251/258 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 253 event pairs, 1 based on Foata normal form. 4/74 useless extension candidates. Maximal degree in co-relation 252. Up to 30 conditions per place. [2021-03-26 00:23:48,345 INFO L142 LiptonReduction]: Number of co-enabled transitions 130 [2021-03-26 00:23:48,348 INFO L154 LiptonReduction]: Checked pairs total: 204 [2021-03-26 00:23:48,348 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:48,348 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 00:23:48,350 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 205 flow [2021-03-26 00:23:48,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:48,350 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:48,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:23:48,351 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -858430204, now seen corresponding path program 2 times [2021-03-26 00:23:48,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:48,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16858663] [2021-03-26 00:23:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:48,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:23:48,441 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-26 00:23:48,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 00:23:48,460 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:23:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:23:48,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:23:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:48,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16858663] [2021-03-26 00:23:48,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:48,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:48,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133623824] [2021-03-26 00:23:48,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:48,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:48,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 145 [2021-03-26 00:23:48,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:48,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 145 [2021-03-26 00:23:48,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:48,563 INFO L129 PetriNetUnfolder]: 26/81 cut-off events. [2021-03-26 00:23:48,563 INFO L130 PetriNetUnfolder]: For 263/266 co-relation queries the response was YES. [2021-03-26 00:23:48,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 81 events. 26/81 cut-off events. For 263/266 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 318 event pairs, 0 based on Foata normal form. 5/86 useless extension candidates. Maximal degree in co-relation 318. Up to 37 conditions per place. [2021-03-26 00:23:48,564 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 17 changer transitions 0/35 dead transitions. [2021-03-26 00:23:48,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 285 flow [2021-03-26 00:23:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:23:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:23:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2021-03-26 00:23:48,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7563218390804598 [2021-03-26 00:23:48,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2021-03-26 00:23:48,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2021-03-26 00:23:48,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:48,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2021-03-26 00:23:48,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,571 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 205 flow. Second operand 6 states and 658 transitions. [2021-03-26 00:23:48,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 285 flow [2021-03-26 00:23:48,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 264 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 00:23:48,577 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 246 flow [2021-03-26 00:23:48,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 00:23:48,577 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2021-03-26 00:23:48,577 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:48,577 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 246 flow [2021-03-26 00:23:48,577 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 246 flow [2021-03-26 00:23:48,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 246 flow [2021-03-26 00:23:48,586 INFO L129 PetriNetUnfolder]: 19/66 cut-off events. [2021-03-26 00:23:48,586 INFO L130 PetriNetUnfolder]: For 287/300 co-relation queries the response was YES. [2021-03-26 00:23:48,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 66 events. 19/66 cut-off events. For 287/300 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 232 event pairs, 1 based on Foata normal form. 3/68 useless extension candidates. Maximal degree in co-relation 267. Up to 29 conditions per place. [2021-03-26 00:23:48,587 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 00:23:48,636 INFO L154 LiptonReduction]: Checked pairs total: 230 [2021-03-26 00:23:48,636 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:48,637 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-26 00:23:48,637 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 246 flow [2021-03-26 00:23:48,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,638 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:48,638 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:48,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:23:48,638 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash 263702402, now seen corresponding path program 1 times [2021-03-26 00:23:48,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:48,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556535828] [2021-03-26 00:23:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:48,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:48,683 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:23:48,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:48,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:48,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556535828] [2021-03-26 00:23:48,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:48,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:48,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119578968] [2021-03-26 00:23:48,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:48,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:48,692 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2021-03-26 00:23:48,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:48,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2021-03-26 00:23:48,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:48,728 INFO L129 PetriNetUnfolder]: 16/69 cut-off events. [2021-03-26 00:23:48,728 INFO L130 PetriNetUnfolder]: For 194/200 co-relation queries the response was YES. [2021-03-26 00:23:48,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 69 events. 16/69 cut-off events. For 194/200 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 260 event pairs, 2 based on Foata normal form. 17/84 useless extension candidates. Maximal degree in co-relation 245. Up to 25 conditions per place. [2021-03-26 00:23:48,729 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 5 selfloop transitions, 6 changer transitions 2/35 dead transitions. [2021-03-26 00:23:48,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 253 flow [2021-03-26 00:23:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2021-03-26 00:23:48,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8124137931034483 [2021-03-26 00:23:48,731 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2021-03-26 00:23:48,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2021-03-26 00:23:48,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:48,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2021-03-26 00:23:48,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,735 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,735 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 246 flow. Second operand 5 states and 589 transitions. [2021-03-26 00:23:48,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 253 flow [2021-03-26 00:23:48,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 228 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:48,737 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 233 flow [2021-03-26 00:23:48,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-03-26 00:23:48,737 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2021-03-26 00:23:48,737 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:48,737 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 233 flow [2021-03-26 00:23:48,738 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 233 flow [2021-03-26 00:23:48,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 233 flow [2021-03-26 00:23:48,746 INFO L129 PetriNetUnfolder]: 11/60 cut-off events. [2021-03-26 00:23:48,746 INFO L130 PetriNetUnfolder]: For 142/150 co-relation queries the response was YES. [2021-03-26 00:23:48,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 60 events. 11/60 cut-off events. For 142/150 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 224 event pairs, 0 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 213. Up to 19 conditions per place. [2021-03-26 00:23:48,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 00:23:48,789 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-26 00:23:48,789 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:48,789 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-26 00:23:48,790 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 233 flow [2021-03-26 00:23:48,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:48,791 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:48,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:23:48,791 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1778551802, now seen corresponding path program 1 times [2021-03-26 00:23:48,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:48,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549984882] [2021-03-26 00:23:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:48,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:48,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:48,842 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:23:48,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:48,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:48,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:48,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549984882] [2021-03-26 00:23:48,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:48,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:23:48,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652202723] [2021-03-26 00:23:48,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:48,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:48,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2021-03-26 00:23:48,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:48,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2021-03-26 00:23:48,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:48,904 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-03-26 00:23:48,904 INFO L130 PetriNetUnfolder]: For 129/153 co-relation queries the response was YES. [2021-03-26 00:23:48,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 47 events. 7/47 cut-off events. For 129/153 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 154 event pairs, 0 based on Foata normal form. 28/75 useless extension candidates. Maximal degree in co-relation 165. Up to 13 conditions per place. [2021-03-26 00:23:48,905 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 2 selfloop transitions, 9 changer transitions 2/34 dead transitions. [2021-03-26 00:23:48,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 34 transitions, 253 flow [2021-03-26 00:23:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:23:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:23:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2021-03-26 00:23:48,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8078817733990148 [2021-03-26 00:23:48,908 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2021-03-26 00:23:48,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2021-03-26 00:23:48,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:48,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2021-03-26 00:23:48,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,912 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:48,912 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 233 flow. Second operand 7 states and 820 transitions. [2021-03-26 00:23:48,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 34 transitions, 253 flow [2021-03-26 00:23:48,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 34 transitions, 234 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:48,916 INFO L241 Difference]: Finished difference. Result has 52 places, 32 transitions, 232 flow [2021-03-26 00:23:48,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2021-03-26 00:23:48,916 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2021-03-26 00:23:48,916 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:48,916 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 232 flow [2021-03-26 00:23:48,917 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 32 transitions, 232 flow [2021-03-26 00:23:48,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 32 transitions, 232 flow [2021-03-26 00:23:48,923 INFO L129 PetriNetUnfolder]: 6/45 cut-off events. [2021-03-26 00:23:48,923 INFO L130 PetriNetUnfolder]: For 124/129 co-relation queries the response was YES. [2021-03-26 00:23:48,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 45 events. 6/45 cut-off events. For 124/129 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 159. Up to 13 conditions per place. [2021-03-26 00:23:48,924 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-26 00:23:49,261 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:23:49,440 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:23:50,114 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 189 [2021-03-26 00:23:50,331 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 00:23:51,767 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 343 DAG size of output: 271 [2021-03-26 00:23:52,305 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-26 00:23:52,309 INFO L154 LiptonReduction]: Checked pairs total: 237 [2021-03-26 00:23:52,309 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:23:52,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3393 [2021-03-26 00:23:52,310 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 212 flow [2021-03-26 00:23:52,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:52,310 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:52,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:52,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:23:52,310 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash 539787335, now seen corresponding path program 1 times [2021-03-26 00:23:52,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:52,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652629189] [2021-03-26 00:23:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:52,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:52,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:52,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:52,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:52,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:52,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:52,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652629189] [2021-03-26 00:23:52,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:52,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:52,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894268065] [2021-03-26 00:23:52,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:52,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:52,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:52,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2021-03-26 00:23:52,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 28 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:52,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:52,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2021-03-26 00:23:52,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:52,395 INFO L129 PetriNetUnfolder]: 9/48 cut-off events. [2021-03-26 00:23:52,396 INFO L130 PetriNetUnfolder]: For 153/154 co-relation queries the response was YES. [2021-03-26 00:23:52,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 48 events. 9/48 cut-off events. For 153/154 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 147 event pairs, 0 based on Foata normal form. 2/50 useless extension candidates. Maximal degree in co-relation 180. Up to 14 conditions per place. [2021-03-26 00:23:52,396 INFO L132 encePairwiseOnDemand]: 144/147 looper letters, 3 selfloop transitions, 1 changer transitions 8/27 dead transitions. [2021-03-26 00:23:52,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 27 transitions, 206 flow [2021-03-26 00:23:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2021-03-26 00:23:52,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.826530612244898 [2021-03-26 00:23:52,398 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2021-03-26 00:23:52,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2021-03-26 00:23:52,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:52,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2021-03-26 00:23:52,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:52,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:52,401 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:52,401 INFO L185 Difference]: Start difference. First operand has 49 places, 28 transitions, 212 flow. Second operand 4 states and 486 transitions. [2021-03-26 00:23:52,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 27 transitions, 206 flow [2021-03-26 00:23:52,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 27 transitions, 181 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-03-26 00:23:52,402 INFO L241 Difference]: Finished difference. Result has 42 places, 19 transitions, 120 flow [2021-03-26 00:23:52,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=19} [2021-03-26 00:23:52,402 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2021-03-26 00:23:52,402 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:52,403 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 19 transitions, 120 flow [2021-03-26 00:23:52,403 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 19 transitions, 120 flow [2021-03-26 00:23:52,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 19 transitions, 120 flow [2021-03-26 00:23:52,407 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-03-26 00:23:52,407 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-03-26 00:23:52,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 26 events. 3/26 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 84. Up to 7 conditions per place. [2021-03-26 00:23:52,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-26 00:23:52,578 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:23:52,939 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:23:53,054 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:23:53,214 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:23:53,434 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2021-03-26 00:23:53,619 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 00:23:53,620 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:23:53,620 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1218 [2021-03-26 00:23:53,620 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 17 transitions, 124 flow [2021-03-26 00:23:53,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:53,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:53,620 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:53,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:23:53,621 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1225975360, now seen corresponding path program 1 times [2021-03-26 00:23:53,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:53,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341846957] [2021-03-26 00:23:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:23:53,642 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:23:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:23:53,664 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:23:53,696 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:23:53,696 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:23:53,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:23:53,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:23:53 BasicIcfg [2021-03-26 00:23:53,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:23:53,771 INFO L168 Benchmark]: Toolchain (without parser) took 23333.69 ms. Allocated memory was 255.9 MB in the beginning and 597.7 MB in the end (delta: 341.8 MB). Free memory was 232.9 MB in the beginning and 510.3 MB in the end (delta: -277.4 MB). Peak memory consumption was 63.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:53,771 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:23:53,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.75 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 232.3 MB in the beginning and 303.4 MB in the end (delta: -71.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:53,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.42 ms. Allocated memory is still 343.9 MB. Free memory was 303.4 MB in the beginning and 300.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:53,775 INFO L168 Benchmark]: Boogie Preprocessor took 55.04 ms. Allocated memory is still 343.9 MB. Free memory was 300.8 MB in the beginning and 298.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:53,775 INFO L168 Benchmark]: RCFGBuilder took 1653.61 ms. Allocated memory is still 343.9 MB. Free memory was 298.7 MB in the beginning and 238.4 MB in the end (delta: 60.4 MB). Peak memory consumption was 61.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:53,775 INFO L168 Benchmark]: TraceAbstraction took 20973.42 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 238.4 MB in the beginning and 510.3 MB in the end (delta: -271.9 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:23:53,776 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.44 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 573.75 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 232.3 MB in the beginning and 303.4 MB in the end (delta: -71.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 73.42 ms. Allocated memory is still 343.9 MB. Free memory was 303.4 MB in the beginning and 300.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.04 ms. Allocated memory is still 343.9 MB. Free memory was 300.8 MB in the beginning and 298.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1653.61 ms. Allocated memory is still 343.9 MB. Free memory was 298.7 MB in the beginning and 238.4 MB in the end (delta: 60.4 MB). Peak memory consumption was 61.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20973.42 ms. Allocated memory was 343.9 MB in the beginning and 597.7 MB in the end (delta: 253.8 MB). Free memory was 238.4 MB in the beginning and 510.3 MB in the end (delta: -271.9 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8760.1ms, 83 PlacesBefore, 36 PlacesAfterwards, 78 TransitionsBefore, 30 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1544 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 817, positive: 762, positive conditional: 762, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 598, positive: 570, positive conditional: 0, positive unconditional: 570, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 598, positive: 570, positive conditional: 0, positive unconditional: 570, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 598, positive: 567, positive conditional: 0, positive unconditional: 567, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 480, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 469, negative conditional: 0, negative unconditional: 469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 817, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 598, unknown conditional: 598, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 44, Positive conditional cache size: 44, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3461.9ms, 34 PlacesBefore, 23 PlacesAfterwards, 23 TransitionsBefore, 16 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 194, positive conditional: 194, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 51, positive conditional: 8, positive unconditional: 43, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 51, positive conditional: 8, positive unconditional: 43, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 431, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 421, negative conditional: 176, negative unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 143, positive conditional: 143, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 70, unknown conditional: 70, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 842.2ms, 26 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 230 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 920.6ms, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 12, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 12, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 200, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 67, Positive conditional cache size: 67, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.7ms, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 8, 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: 11, positive: 11, positive conditional: 8, 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: 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] , 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: 112, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 230 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 5, positive unconditional: 3, 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: 10, positive: 8, positive conditional: 5, positive unconditional: 3, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 46, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 93, Positive conditional cache size: 93, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, 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: 10, positive: 8, positive conditional: 3, positive unconditional: 5, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 101, Positive conditional cache size: 101, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3392.4ms, 52 PlacesBefore, 49 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 103, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 28, 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: 28, positive: 28, positive conditional: 28, 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: 28, positive: 28, positive conditional: 0, positive unconditional: 28, 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: 103, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1216.8ms, 42 PlacesBefore, 35 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 15, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 7, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1451; [L793] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L794] 0 pthread_t t1452; [L795] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1] [L742] 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) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] 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) [L742] 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) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 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 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 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 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] 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) [L770] 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) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 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 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 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 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] 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) [L801] 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) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 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 [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 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 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L812] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20803.4ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 672.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8846.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 18 SDslu, 13 SDs, 0 SdLazy, 160 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 209.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 179.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.8ms SsaConstructionTime, 358.8ms SatisfiabilityAnalysisTime, 622.5ms InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 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...