/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:40:44,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:40:44,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:40:44,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:40:44,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:40:44,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:40:44,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:40:44,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:40:44,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:40:44,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:40:44,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:40:44,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:40:44,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:40:44,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:40:44,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:40:44,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:40:44,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:40:44,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:40:44,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:40:44,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:40:44,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:40:44,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:40:44,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:40:44,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:40:44,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:40:44,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:40:44,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:40:44,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:40:44,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:40:44,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:40:44,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:40:44,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:40:44,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:40:44,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:40:44,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:40:44,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:40:44,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:40:44,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:40:44,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:40:44,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:40:44,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:40:44,325 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:40:44,359 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:40:44,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:40:44,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:40:44,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:40:44,364 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:40:44,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:40:44,364 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:40:44,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:40:44,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:40:44,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:40:44,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:40:44,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:40:44,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:40:44,366 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:40:44,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:40:44,366 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:40:44,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:40:44,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:40:44,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:40:44,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:40:44,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:40:44,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:40:44,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:40:44,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:40:44,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:40:44,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:40:44,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:40:44,368 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:40:44,368 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:40:44,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:40:44,368 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 10:40:44,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:40:44,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:40:44,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:40:44,698 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:40:44,698 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:40:44,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-03-26 10:40:44,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7b9fbb4/b147b23d986940338d191ec60d279ec9/FLAG1dc8d9fb5 [2021-03-26 10:40:45,305 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:40:45,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-03-26 10:40:45,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7b9fbb4/b147b23d986940338d191ec60d279ec9/FLAG1dc8d9fb5 [2021-03-26 10:40:45,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7b9fbb4/b147b23d986940338d191ec60d279ec9 [2021-03-26 10:40:45,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:40:45,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:40:45,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:40:45,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:40:45,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:40:45,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:40:45" (1/1) ... [2021-03-26 10:40:45,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f520d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:45, skipping insertion in model container [2021-03-26 10:40:45,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:40:45" (1/1) ... [2021-03-26 10:40:45,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:40:45,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:40:46,107 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/safe029_pso.oepc.i[950,963] [2021-03-26 10:40:46,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:40:46,313 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:40:46,325 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/safe029_pso.oepc.i[950,963] [2021-03-26 10:40:46,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:40:46,419 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:40:46,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46 WrapperNode [2021-03-26 10:40:46,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:40:46,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:40:46,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:40:46,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:40:46,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:40:46,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:40:46,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:40:46,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:40:46,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (1/1) ... [2021-03-26 10:40:46,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:40:46,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:40:46,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:40:46,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:40:46,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (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 10:40:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:40:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:40:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:40:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:40:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:40:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:40:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:40:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:40:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:40:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:40:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:40:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:40:46,609 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 10:40:48,220 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:40:48,221 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:40:48,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:40:48 BoogieIcfgContainer [2021-03-26 10:40:48,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:40:48,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:40:48,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:40:48,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:40:48,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:40:45" (1/3) ... [2021-03-26 10:40:48,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212cb6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:40:48, skipping insertion in model container [2021-03-26 10:40:48,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:40:46" (2/3) ... [2021-03-26 10:40:48,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212cb6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:40:48, skipping insertion in model container [2021-03-26 10:40:48,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:40:48" (3/3) ... [2021-03-26 10:40:48,231 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-03-26 10:40:48,236 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:40:48,240 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:40:48,241 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:40:48,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,278 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,278 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,279 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:40:48,290 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:40:48,306 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:40:48,333 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:40:48,333 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:40:48,333 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:40:48,333 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:40:48,334 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:40:48,334 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:40:48,334 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:40:48,334 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:40:48,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 10:40:48,370 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 10:40:48,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:48,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:40:48,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 10:40:48,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:48,378 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:48,390 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:48,392 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:48,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-26 10:40:48,407 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 10:40:48,407 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:48,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:40:48,410 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-26 10:40:49,729 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 10:40:50,049 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 10:40:51,351 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 10:40:51,951 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 10:40:52,476 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:40:52,851 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:40:52,961 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:40:54,018 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:40:54,313 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:40:54,875 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:40:55,439 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:40:55,766 INFO L154 LiptonReduction]: Checked pairs total: 1628 [2021-03-26 10:40:55,766 INFO L156 LiptonReduction]: Total number of compositions: 55 [2021-03-26 10:40:55,767 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7390 [2021-03-26 10:40:55,774 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-26 10:40:55,774 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:55,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:40:55,775 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:40:55,775 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:40:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:40:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 730483881, now seen corresponding path program 1 times [2021-03-26 10:40:55,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:40:55,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652759875] [2021-03-26 10:40:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:40:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:40:55,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:55,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:40:55,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:40:55,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:40:55,986 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 10:40:55,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652759875] [2021-03-26 10:40:55,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:40:55,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:40:55,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463366545] [2021-03-26 10:40:55,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:40:55,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:40:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:40:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:40:56,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 134 [2021-03-26 10:40:56,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 10:40:56,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:40:56,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 134 [2021-03-26 10:40:56,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:40:56,094 INFO L129 PetriNetUnfolder]: 23/89 cut-off events. [2021-03-26 10:40:56,094 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:56,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 89 events. 23/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 340 event pairs, 16 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 130. Up to 37 conditions per place. [2021-03-26 10:40:56,097 INFO L132 encePairwiseOnDemand]: 130/134 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-26 10:40:56,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-26 10:40:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:40:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:40:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2021-03-26 10:40:56,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8706467661691543 [2021-03-26 10:40:56,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2021-03-26 10:40:56,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2021-03-26 10:40:56,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:40:56,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2021-03-26 10:40:56,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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 10:40:56,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:40:56,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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 10:40:56,138 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 350 transitions. [2021-03-26 10:40:56,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-26 10:40:56,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:40:56,143 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-26 10:40:56,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 10:40:56,146 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-26 10:40:56,147 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:40:56,147 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-26 10:40:56,148 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-26 10:40:56,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-26 10:40:56,156 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:40:56,156 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:40:56,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:40:56,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:40:56,615 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:40:56,961 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:40:58,209 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-03-26 10:40:58,789 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:40:59,812 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 10:40:59,937 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 10:41:00,161 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 10:41:00,283 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 10:41:00,287 INFO L154 LiptonReduction]: Checked pairs total: 588 [2021-03-26 10:41:00,287 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:41:00,288 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4141 [2021-03-26 10:41:00,289 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-03-26 10:41:00,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 10:41:00,289 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:00,289 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:00,289 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:41:00,289 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1358233529, now seen corresponding path program 1 times [2021-03-26 10:41:00,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:00,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519055227] [2021-03-26 10:41:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:00,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:00,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:00,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:00,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:00,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:00,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:41:00,457 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 10:41:00,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519055227] [2021-03-26 10:41:00,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:00,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:00,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33263050] [2021-03-26 10:41:00,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:00,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:00,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:00,459 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-03-26 10:41:00,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 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 10:41:00,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:00,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-03-26 10:41:00,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:00,474 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 10:41:00,474 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:00,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-26 10:41:00,474 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 3 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2021-03-26 10:41:00,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 56 flow [2021-03-26 10:41:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2021-03-26 10:41:00,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2021-03-26 10:41:00,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2021-03-26 10:41:00,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2021-03-26 10:41:00,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:00,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2021-03-26 10:41:00,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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 10:41:00,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:00,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:00,480 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 352 transitions. [2021-03-26 10:41:00,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 56 flow [2021-03-26 10:41:00,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:41:00,481 INFO L241 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:00,481 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2021-03-26 10:41:00,482 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -11 predicate places. [2021-03-26 10:41:00,482 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:00,482 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:00,482 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:00,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:00,486 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 10:41:00,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:00,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 39. Up to 10 conditions per place. [2021-03-26 10:41:00,487 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-26 10:41:00,716 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-26 10:41:00,716 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:00,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 234 [2021-03-26 10:41:00,717 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:00,717 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 10:41:00,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:00,718 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:00,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:41:00,718 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash 211342155, now seen corresponding path program 1 times [2021-03-26 10:41:00,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:00,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083393918] [2021-03-26 10:41:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:00,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:00,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:00,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:00,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:41:00,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:00,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:41:00,812 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 10:41:00,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083393918] [2021-03-26 10:41:00,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:00,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:00,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163402747] [2021-03-26 10:41:00,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:00,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:00,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:00,815 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 140 [2021-03-26 10:41:00,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 10:41:00,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:00,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 140 [2021-03-26 10:41:00,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:00,891 INFO L129 PetriNetUnfolder]: 117/218 cut-off events. [2021-03-26 10:41:00,891 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-26 10:41:00,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 218 events. 117/218 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 854 event pairs, 89 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 453. Up to 181 conditions per place. [2021-03-26 10:41:00,893 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2021-03-26 10:41:00,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 117 flow [2021-03-26 10:41:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:41:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:41:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2021-03-26 10:41:00,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7125 [2021-03-26 10:41:00,895 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2021-03-26 10:41:00,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2021-03-26 10:41:00,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:00,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2021-03-26 10:41:00,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:00,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:00,901 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:00,901 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 4 states and 399 transitions. [2021-03-26 10:41:00,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 117 flow [2021-03-26 10:41:00,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:00,903 INFO L241 Difference]: Finished difference. Result has 28 places, 20 transitions, 75 flow [2021-03-26 10:41:00,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2021-03-26 10:41:00,903 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -7 predicate places. [2021-03-26 10:41:00,903 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:00,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 75 flow [2021-03-26 10:41:00,903 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 20 transitions, 75 flow [2021-03-26 10:41:00,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 20 transitions, 75 flow [2021-03-26 10:41:00,908 INFO L129 PetriNetUnfolder]: 6/37 cut-off events. [2021-03-26 10:41:00,909 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 10:41:00,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 37 events. 6/37 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 97 event pairs, 3 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 68. Up to 12 conditions per place. [2021-03-26 10:41:00,909 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 10:41:00,939 INFO L154 LiptonReduction]: Checked pairs total: 92 [2021-03-26 10:41:00,940 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:00,940 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-26 10:41:00,941 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 75 flow [2021-03-26 10:41:00,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 10:41:00,941 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:00,941 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:00,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:41:00,941 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1626564954, now seen corresponding path program 1 times [2021-03-26 10:41:00,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:00,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54996639] [2021-03-26 10:41:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:01,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:01,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:01,010 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 10:41:01,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54996639] [2021-03-26 10:41:01,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:01,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:01,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848242947] [2021-03-26 10:41:01,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:01,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:01,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:01,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:01,013 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 140 [2021-03-26 10:41:01,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 10:41:01,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:01,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 140 [2021-03-26 10:41:01,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:01,033 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-26 10:41:01,033 INFO L130 PetriNetUnfolder]: For 40/47 co-relation queries the response was YES. [2021-03-26 10:41:01,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 39 events. 3/39 cut-off events. For 40/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 2 based on Foata normal form. 2/40 useless extension candidates. Maximal degree in co-relation 75. Up to 11 conditions per place. [2021-03-26 10:41:01,034 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 3 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2021-03-26 10:41:01,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 20 transitions, 87 flow [2021-03-26 10:41:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2021-03-26 10:41:01,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8642857142857143 [2021-03-26 10:41:01,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2021-03-26 10:41:01,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2021-03-26 10:41:01,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:01,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2021-03-26 10:41:01,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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 10:41:01,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:01,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:01,044 INFO L185 Difference]: Start difference. First operand has 28 places, 20 transitions, 75 flow. Second operand 3 states and 363 transitions. [2021-03-26 10:41:01,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 20 transitions, 87 flow [2021-03-26 10:41:01,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:01,046 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 83 flow [2021-03-26 10:41:01,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2021-03-26 10:41:01,047 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2021-03-26 10:41:01,047 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:01,047 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 83 flow [2021-03-26 10:41:01,047 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 83 flow [2021-03-26 10:41:01,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 83 flow [2021-03-26 10:41:01,055 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-26 10:41:01,055 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-26 10:41:01,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 39 events. 3/39 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 2 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 73. Up to 11 conditions per place. [2021-03-26 10:41:01,056 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 10:41:01,057 INFO L154 LiptonReduction]: Checked pairs total: 92 [2021-03-26 10:41:01,058 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:01,058 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 10:41:01,061 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 83 flow [2021-03-26 10:41:01,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 10:41:01,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:01,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:01,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:41:01,062 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2038328182, now seen corresponding path program 1 times [2021-03-26 10:41:01,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:01,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418263865] [2021-03-26 10:41:01,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:01,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:41:01,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:41:01,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:41:01,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:41:01,204 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 10:41:01,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418263865] [2021-03-26 10:41:01,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:01,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:01,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945025210] [2021-03-26 10:41:01,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:01,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:01,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:01,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:01,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 140 [2021-03-26 10:41:01,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 83 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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 10:41:01,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:01,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 140 [2021-03-26 10:41:01,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:01,309 INFO L129 PetriNetUnfolder]: 164/322 cut-off events. [2021-03-26 10:41:01,309 INFO L130 PetriNetUnfolder]: For 252/259 co-relation queries the response was YES. [2021-03-26 10:41:01,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 322 events. 164/322 cut-off events. For 252/259 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1457 event pairs, 28 based on Foata normal form. 8/300 useless extension candidates. Maximal degree in co-relation 764. Up to 229 conditions per place. [2021-03-26 10:41:01,311 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 15 selfloop transitions, 6 changer transitions 7/35 dead transitions. [2021-03-26 10:41:01,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 171 flow [2021-03-26 10:41:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2021-03-26 10:41:01,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2021-03-26 10:41:01,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 484 transitions. [2021-03-26 10:41:01,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 484 transitions. [2021-03-26 10:41:01,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:01,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 484 transitions. [2021-03-26 10:41:01,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.8) internal successors, (484), 5 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 10:41:01,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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 10:41:01,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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 10:41:01,317 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 83 flow. Second operand 5 states and 484 transitions. [2021-03-26 10:41:01,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 171 flow [2021-03-26 10:41:01,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:01,320 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 102 flow [2021-03-26 10:41:01,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 10:41:01,320 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2021-03-26 10:41:01,320 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:01,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 102 flow [2021-03-26 10:41:01,320 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 102 flow [2021-03-26 10:41:01,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 102 flow [2021-03-26 10:41:01,327 INFO L129 PetriNetUnfolder]: 7/45 cut-off events. [2021-03-26 10:41:01,327 INFO L130 PetriNetUnfolder]: For 68/71 co-relation queries the response was YES. [2021-03-26 10:41:01,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 45 events. 7/45 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 145 event pairs, 2 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 110. Up to 19 conditions per place. [2021-03-26 10:41:01,328 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 10:41:01,330 INFO L154 LiptonReduction]: Checked pairs total: 53 [2021-03-26 10:41:01,330 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:01,330 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 10:41:01,331 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 102 flow [2021-03-26 10:41:01,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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 10:41:01,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:01,331 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:01,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:41:01,331 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash -977381041, now seen corresponding path program 1 times [2021-03-26 10:41:01,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:01,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156954801] [2021-03-26 10:41:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:01,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:01,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:01,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:01,380 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 10:41:01,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156954801] [2021-03-26 10:41:01,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:01,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:01,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172020270] [2021-03-26 10:41:01,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:01,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:01,384 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-03-26 10:41:01,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 10:41:01,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:01,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-03-26 10:41:01,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:01,422 INFO L129 PetriNetUnfolder]: 20/88 cut-off events. [2021-03-26 10:41:01,423 INFO L130 PetriNetUnfolder]: For 85/88 co-relation queries the response was YES. [2021-03-26 10:41:01,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 88 events. 20/88 cut-off events. For 85/88 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 383 event pairs, 7 based on Foata normal form. 11/96 useless extension candidates. Maximal degree in co-relation 214. Up to 40 conditions per place. [2021-03-26 10:41:01,426 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 4 selfloop transitions, 5 changer transitions 3/28 dead transitions. [2021-03-26 10:41:01,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 140 flow [2021-03-26 10:41:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2021-03-26 10:41:01,430 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8271428571428572 [2021-03-26 10:41:01,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2021-03-26 10:41:01,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2021-03-26 10:41:01,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:01,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2021-03-26 10:41:01,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 10:41:01,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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 10:41:01,434 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 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 10:41:01,434 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 102 flow. Second operand 5 states and 579 transitions. [2021-03-26 10:41:01,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 140 flow [2021-03-26 10:41:01,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:41:01,437 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 131 flow [2021-03-26 10:41:01,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 10:41:01,437 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2021-03-26 10:41:01,438 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:01,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 131 flow [2021-03-26 10:41:01,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 131 flow [2021-03-26 10:41:01,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 131 flow [2021-03-26 10:41:01,448 INFO L129 PetriNetUnfolder]: 12/78 cut-off events. [2021-03-26 10:41:01,448 INFO L130 PetriNetUnfolder]: For 103/107 co-relation queries the response was YES. [2021-03-26 10:41:01,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 78 events. 12/78 cut-off events. For 103/107 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 333 event pairs, 4 based on Foata normal form. 2/78 useless extension candidates. Maximal degree in co-relation 219. Up to 25 conditions per place. [2021-03-26 10:41:01,450 INFO L142 LiptonReduction]: Number of co-enabled transitions 108 [2021-03-26 10:41:01,452 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:41:01,452 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:01,452 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 10:41:01,453 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 131 flow [2021-03-26 10:41:01,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 10:41:01,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:01,453 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:01,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:41:01,454 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:01,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1479044870, now seen corresponding path program 1 times [2021-03-26 10:41:01,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:01,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43339645] [2021-03-26 10:41:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:01,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:01,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:01,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:01,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:01,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:01,546 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 10:41:01,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43339645] [2021-03-26 10:41:01,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:01,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:01,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064458608] [2021-03-26 10:41:01,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:41:01,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:41:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:41:01,548 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-03-26 10:41:01,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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 10:41:01,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:01,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-03-26 10:41:01,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:01,592 INFO L129 PetriNetUnfolder]: 8/60 cut-off events. [2021-03-26 10:41:01,593 INFO L130 PetriNetUnfolder]: For 79/105 co-relation queries the response was YES. [2021-03-26 10:41:01,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 60 events. 8/60 cut-off events. For 79/105 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 0 based on Foata normal form. 35/95 useless extension candidates. Maximal degree in co-relation 182. Up to 24 conditions per place. [2021-03-26 10:41:01,593 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 2 selfloop transitions, 8 changer transitions 6/28 dead transitions. [2021-03-26 10:41:01,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 169 flow [2021-03-26 10:41:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:41:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:41:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2021-03-26 10:41:01,596 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8214285714285714 [2021-03-26 10:41:01,597 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2021-03-26 10:41:01,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2021-03-26 10:41:01,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:01,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2021-03-26 10:41:01,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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 10:41:01,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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 10:41:01,603 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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 10:41:01,603 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 131 flow. Second operand 7 states and 805 transitions. [2021-03-26 10:41:01,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 169 flow [2021-03-26 10:41:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 159 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:01,605 INFO L241 Difference]: Finished difference. Result has 45 places, 22 transitions, 134 flow [2021-03-26 10:41:01,605 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=22} [2021-03-26 10:41:01,605 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2021-03-26 10:41:01,605 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:01,605 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 22 transitions, 134 flow [2021-03-26 10:41:01,606 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 22 transitions, 134 flow [2021-03-26 10:41:01,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 22 transitions, 134 flow [2021-03-26 10:41:01,609 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-03-26 10:41:01,609 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-26 10:41:01,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 25 events. 2/25 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 74. Up to 10 conditions per place. [2021-03-26 10:41:01,609 INFO L142 LiptonReduction]: Number of co-enabled transitions 54 [2021-03-26 10:41:02,244 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 10:41:02,443 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 10:41:03,611 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 332 DAG size of output: 254 [2021-03-26 10:41:04,042 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:41:04,369 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:41:04,598 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:41:05,059 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:41:05,528 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:41:05,554 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-26 10:41:05,554 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:41:05,554 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3949 [2021-03-26 10:41:05,554 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 16 transitions, 110 flow [2021-03-26 10:41:05,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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 10:41:05,555 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:05,555 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:05,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:41:05,555 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1056435828, now seen corresponding path program 1 times [2021-03-26 10:41:05,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:05,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342775058] [2021-03-26 10:41:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:05,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:05,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:41:05,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:05,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:41:05,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:05,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:41:05,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:05,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:05,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:05,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:05,667 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 10:41:05,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342775058] [2021-03-26 10:41:05,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:05,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:05,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400659171] [2021-03-26 10:41:05,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:05,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:05,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 144 [2021-03-26 10:41:05,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 16 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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 10:41:05,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:05,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 144 [2021-03-26 10:41:05,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:05,745 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2021-03-26 10:41:05,746 INFO L130 PetriNetUnfolder]: For 138/142 co-relation queries the response was YES. [2021-03-26 10:41:05,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 23 events. 3/23 cut-off events. For 138/142 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 5/28 useless extension candidates. Maximal degree in co-relation 83. Up to 9 conditions per place. [2021-03-26 10:41:05,746 INFO L132 encePairwiseOnDemand]: 138/144 looper letters, 2 selfloop transitions, 6 changer transitions 3/18 dead transitions. [2021-03-26 10:41:05,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 18 transitions, 137 flow [2021-03-26 10:41:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:41:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:41:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2021-03-26 10:41:05,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2021-03-26 10:41:05,748 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2021-03-26 10:41:05,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2021-03-26 10:41:05,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:05,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2021-03-26 10:41:05,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:05,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 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 10:41:05,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 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 10:41:05,752 INFO L185 Difference]: Start difference. First operand has 39 places, 16 transitions, 110 flow. Second operand 6 states and 604 transitions. [2021-03-26 10:41:05,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 18 transitions, 137 flow [2021-03-26 10:41:05,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 18 transitions, 102 flow, removed 9 selfloop flow, removed 11 redundant places. [2021-03-26 10:41:05,753 INFO L241 Difference]: Finished difference. Result has 31 places, 15 transitions, 91 flow [2021-03-26 10:41:05,753 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=31, PETRI_TRANSITIONS=15} [2021-03-26 10:41:05,754 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2021-03-26 10:41:05,754 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:05,754 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 15 transitions, 91 flow [2021-03-26 10:41:05,754 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 15 transitions, 91 flow [2021-03-26 10:41:05,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 15 transitions, 91 flow [2021-03-26 10:41:05,757 INFO L129 PetriNetUnfolder]: 2/16 cut-off events. [2021-03-26 10:41:05,757 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 10:41:05,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 16 events. 2/16 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 45. Up to 5 conditions per place. [2021-03-26 10:41:05,757 INFO L142 LiptonReduction]: Number of co-enabled transitions 8 [2021-03-26 10:41:05,945 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:41:06,318 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-26 10:41:06,433 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:41:06,435 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:41:06,435 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:41:06,435 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 681 [2021-03-26 10:41:06,436 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 15 transitions, 93 flow [2021-03-26 10:41:06,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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 10:41:06,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:06,436 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:06,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:41:06,436 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:06,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2143395832, now seen corresponding path program 1 times [2021-03-26 10:41:06,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:06,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738484316] [2021-03-26 10:41:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:06,461 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:06,487 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:06,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:41:06,510 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:41:06,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:41:06,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:41:06 BasicIcfg [2021-03-26 10:41:06,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:41:06,549 INFO L168 Benchmark]: Toolchain (without parser) took 20799.62 ms. Allocated memory was 255.9 MB in the beginning and 595.6 MB in the end (delta: 339.7 MB). Free memory was 233.9 MB in the beginning and 342.2 MB in the end (delta: -108.3 MB). Peak memory consumption was 231.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:06,549 INFO L168 Benchmark]: CDTParser took 0.16 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 10:41:06,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.32 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 233.9 MB in the beginning and 301.8 MB in the end (delta: -67.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:06,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.92 ms. Allocated memory is still 341.8 MB. Free memory was 301.8 MB in the beginning and 299.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:06,550 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory is still 341.8 MB. Free memory was 299.0 MB in the beginning and 297.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:06,550 INFO L168 Benchmark]: RCFGBuilder took 1683.71 ms. Allocated memory is still 341.8 MB. Free memory was 297.0 MB in the beginning and 227.9 MB in the end (delta: 69.0 MB). Peak memory consumption was 71.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:06,550 INFO L168 Benchmark]: TraceAbstraction took 18323.00 ms. Allocated memory was 341.8 MB in the beginning and 595.6 MB in the end (delta: 253.8 MB). Free memory was 226.9 MB in the beginning and 342.2 MB in the end (delta: -115.3 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:06,551 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.16 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 669.32 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 233.9 MB in the beginning and 301.8 MB in the end (delta: -67.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.92 ms. Allocated memory is still 341.8 MB. Free memory was 301.8 MB in the beginning and 299.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory is still 341.8 MB. Free memory was 299.0 MB in the beginning and 297.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1683.71 ms. Allocated memory is still 341.8 MB. Free memory was 297.0 MB in the beginning and 227.9 MB in the end (delta: 69.0 MB). Peak memory consumption was 71.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18323.00 ms. Allocated memory was 341.8 MB in the beginning and 595.6 MB in the end (delta: 253.8 MB). Free memory was 226.9 MB in the beginning and 342.2 MB in the end (delta: -115.3 MB). Peak memory consumption was 138.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7373.5ms, 82 PlacesBefore, 35 PlacesAfterwards, 77 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 55 TotalNumberOfCompositions, 1628 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 855, positive: 790, positive conditional: 790, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 855, positive: 790, positive conditional: 0, positive unconditional: 790, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 855, positive: 790, positive conditional: 0, positive unconditional: 790, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 669, positive: 636, positive conditional: 0, positive unconditional: 636, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 669, positive: 634, positive conditional: 0, positive unconditional: 634, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 650, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 642, negative conditional: 0, negative unconditional: 642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 855, positive: 154, positive conditional: 0, positive unconditional: 154, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 636, Positive conditional cache size: 0, Positive unconditional cache size: 636, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4139.6ms, 33 PlacesBefore, 23 PlacesAfterwards, 22 TransitionsBefore, 16 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 588 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, positive: 118, positive conditional: 118, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, positive: 118, positive conditional: 13, positive unconditional: 105, negative: 65, negative conditional: 4, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 118, positive conditional: 13, positive unconditional: 105, negative: 65, negative conditional: 4, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 38, positive conditional: 4, positive unconditional: 34, negative: 15, negative conditional: 2, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 2, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 263, negative conditional: 62, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, positive: 80, positive conditional: 9, positive unconditional: 71, negative: 50, negative conditional: 2, negative unconditional: 48, unknown: 53, unknown conditional: 6, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 674, Positive conditional cache size: 4, Positive unconditional cache size: 670, Negative cache size: 48, Negative conditional cache size: 2, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 233.9ms, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 227, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 227, negative conditional: 0, negative unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 679, Positive conditional cache size: 4, Positive unconditional cache size: 675, Negative cache size: 55, Negative conditional cache size: 2, Negative unconditional cache size: 53, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.2ms, 28 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 92 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, positive: 17, positive conditional: 1, positive unconditional: 16, negative: 9, negative conditional: 2, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 17, positive conditional: 1, positive unconditional: 16, negative: 9, negative conditional: 2, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 15, positive conditional: 1, positive unconditional: 14, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 681, Positive conditional cache size: 4, Positive unconditional cache size: 677, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2ms, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 92 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 13, positive conditional: 1, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 13, positive conditional: 1, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 13, positive conditional: 1, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 681, Positive conditional cache size: 4, Positive unconditional cache size: 677, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2ms, 34 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 53 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 9, positive conditional: 2, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 683, Positive conditional cache size: 5, Positive unconditional cache size: 678, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 683, Positive conditional cache size: 5, Positive unconditional cache size: 678, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3948.1ms, 45 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 16 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 16, negative conditional: 8, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 16, negative conditional: 8, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 13, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 14, negative conditional: 7, negative unconditional: 7, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 689, Positive conditional cache size: 11, Positive unconditional cache size: 678, Negative cache size: 59, Negative conditional cache size: 5, Negative unconditional cache size: 54, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 681.0ms, 31 PlacesBefore, 31 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 689, Positive conditional cache size: 11, Positive unconditional cache size: 678, Negative cache size: 59, Negative conditional cache size: 5, Negative unconditional cache size: 54, Eliminated conditions: 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2477; [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 [L745] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2478; [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18181.4ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 603.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7438.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33 SDtfs, 20 SDslu, 27 SDs, 0 SdLazy, 133 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 180.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 146.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=7, InterpolantAutomatonStates: 36, 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: 25.9ms SsaConstructionTime, 299.6ms SatisfiabilityAnalysisTime, 518.2ms InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...