/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 21:26:47,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 21:26:47,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 21:26:47,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 21:26:47,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 21:26:47,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 21:26:47,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 21:26:47,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 21:26:47,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 21:26:47,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 21:26:47,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 21:26:47,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 21:26:47,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 21:26:47,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 21:26:47,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 21:26:47,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 21:26:47,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 21:26:47,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 21:26:47,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 21:26:47,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 21:26:47,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 21:26:47,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 21:26:47,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 21:26:47,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 21:26:47,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 21:26:47,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 21:26:47,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 21:26:47,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 21:26:47,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 21:26:47,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 21:26:47,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 21:26:47,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 21:26:47,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 21:26:47,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 21:26:47,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 21:26:47,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 21:26:47,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 21:26:47,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 21:26:47,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 21:26:47,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 21:26:47,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 21:26:47,337 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-SemanticLbe.epf [2021-06-10 21:26:47,371 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 21:26:47,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 21:26:47,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 21:26:47,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 21:26:47,374 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 21:26:47,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 21:26:47,374 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 21:26:47,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 21:26:47,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 21:26:47,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 21:26:47,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 21:26:47,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 21:26:47,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 21:26:47,376 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 21:26:47,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 21:26:47,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 21:26:47,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 21:26:47,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 21:26:47,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 21:26:47,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 21:26:47,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 21:26:47,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:26:47,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 21:26:47,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 21:26:47,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 21:26:47,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 21:26:47,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 21:26:47,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 21:26:47,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 21:26:47,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 21:26:47,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 21:26:47,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 21:26:47,686 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 21:26:47,687 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 21:26:47,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2021-06-10 21:26:47,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e712a7a6/ba92ac3cea2844f09f94099bf1f29a76/FLAG933be822e [2021-06-10 21:26:48,298 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 21:26:48,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2021-06-10 21:26:48,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e712a7a6/ba92ac3cea2844f09f94099bf1f29a76/FLAG933be822e [2021-06-10 21:26:48,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e712a7a6/ba92ac3cea2844f09f94099bf1f29a76 [2021-06-10 21:26:48,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 21:26:48,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 21:26:48,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 21:26:48,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 21:26:48,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 21:26:48,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:26:48" (1/1) ... [2021-06-10 21:26:48,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a1fbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:48, skipping insertion in model container [2021-06-10 21:26:48,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:26:48" (1/1) ... [2021-06-10 21:26:48,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 21:26:48,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 21:26:49,029 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/safe023_pso.opt.i[992,1005] [2021-06-10 21:26:49,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:26:49,271 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 21:26:49,281 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/safe023_pso.opt.i[992,1005] [2021-06-10 21:26:49,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:26:49,425 INFO L208 MainTranslator]: Completed translation [2021-06-10 21:26:49,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49 WrapperNode [2021-06-10 21:26:49,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 21:26:49,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 21:26:49,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 21:26:49,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 21:26:49,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 21:26:49,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 21:26:49,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 21:26:49,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 21:26:49,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... [2021-06-10 21:26:49,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 21:26:49,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 21:26:49,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 21:26:49,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 21:26:49,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:26:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 21:26:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 21:26:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 21:26:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 21:26:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 21:26:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 21:26:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 21:26:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 21:26:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 21:26:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 21:26:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 21:26:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 21:26:49,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 21:26:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 21:26:49,631 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 21:26:52,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 21:26:52,538 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 21:26:52,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:26:52 BoogieIcfgContainer [2021-06-10 21:26:52,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 21:26:52,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 21:26:52,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 21:26:52,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 21:26:52,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 09:26:48" (1/3) ... [2021-06-10 21:26:52,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60214f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:26:52, skipping insertion in model container [2021-06-10 21:26:52,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:26:49" (2/3) ... [2021-06-10 21:26:52,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60214f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:26:52, skipping insertion in model container [2021-06-10 21:26:52,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:26:52" (3/3) ... [2021-06-10 21:26:52,545 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_pso.opt.i [2021-06-10 21:26:52,551 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 21:26:52,554 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 21:26:52,554 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 21:26:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,629 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:26:52,670 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 21:26:52,685 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 21:26:52,702 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 21:26:52,702 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 21:26:52,702 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 21:26:52,703 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 21:26:52,703 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 21:26:52,703 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 21:26:52,703 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 21:26:52,703 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 21:26:52,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-06-10 21:26:52,756 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-06-10 21:26:52,756 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:26:52,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-10 21:26:52,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-06-10 21:26:52,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-06-10 21:26:52,772 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 21:26:52,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-06-10 21:26:52,787 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-06-10 21:26:52,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-06-10 21:26:52,819 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-06-10 21:26:52,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:26:52,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-10 21:26:52,824 INFO L151 LiptonReduction]: Number of co-enabled transitions 1786 [2021-06-10 21:26:52,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:52,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:52,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:52,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:26:52,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:26:52,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:52,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:53,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:53,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:26:53,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:26:53,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,800 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:53,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:26:53,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:26:53,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:53,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,050 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 21:26:54,051 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:26:54,073 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:54,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:26:54,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-10 21:26:54,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:54,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:54,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:55,224 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 21:26:55,664 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-10 21:26:55,786 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-10 21:26:55,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:55,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 21:26:55,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:55,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,813 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-10 21:26:55,813 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:26:55,815 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,824 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-10 21:26:55,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:55,826 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-10 21:26:55,827 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-10 21:26:55,827 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:26:55,830 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,835 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-10 21:26:55,836 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-10 21:26:55,836 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:26:55,838 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,846 INFO L147 QuantifierPusher]: treesize reduction 189, result has 28.4 percent of original size 75 [2021-06-10 21:26:55,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:55,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:55,992 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 21:26:55,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:56,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:56,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:56,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:26:56,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:26:56,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:56,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:56,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:56,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:26:56,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 21:26:56,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:56,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:56,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-10 21:26:56,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-10 21:26:56,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:26:56,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-10 21:26:56,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-10 21:26:56,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:56,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,504 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 21:26:56,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:56,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:56,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:56,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:57,422 WARN L205 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2021-06-10 21:26:57,732 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-10 21:26:59,099 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-06-10 21:26:59,696 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-06-10 21:26:59,699 INFO L142 QuantifierPusher]: treesize reduction 14, result has 30.0 percent of original size [2021-06-10 21:26:59,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:26:59,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:26:59,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:00,113 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-06-10 21:27:00,416 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-06-10 21:27:01,212 WARN L205 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-10 21:27:02,001 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-10 21:27:02,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:02,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:02,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:02,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:02,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:02,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:02,901 WARN L205 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2021-06-10 21:27:03,517 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-06-10 21:27:04,851 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-06-10 21:27:05,506 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-10 21:27:05,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:05,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:27:05,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:05,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:05,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:27:05,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:05,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:06,308 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-06-10 21:27:06,711 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-06-10 21:27:07,574 WARN L205 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-06-10 21:27:08,437 WARN L205 SmtUtils]: Spent 862.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-06-10 21:27:08,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:08,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:08,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:08,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:27:08,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:08,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:08,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:27:08,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:08,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:09,263 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-06-10 21:27:09,398 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-10 21:27:09,715 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-06-10 21:27:09,859 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-10 21:27:09,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:09,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:27:09,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:09,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:09,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:27:09,905 INFO L163 LiptonReduction]: Checked pairs total: 5831 [2021-06-10 21:27:09,905 INFO L165 LiptonReduction]: Total number of compositions: 89 [2021-06-10 21:27:09,908 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17136 [2021-06-10 21:27:09,914 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-06-10 21:27:09,914 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:27:09,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:09,914 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-10 21:27:09,915 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1734982330, now seen corresponding path program 1 times [2021-06-10 21:27:09,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:09,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382422263] [2021-06-10 21:27:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:10,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:10,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382422263] [2021-06-10 21:27:10,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:10,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:27:10,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188059235] [2021-06-10 21:27:10,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:27:10,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:27:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:27:10,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2021-06-10 21:27:10,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:10,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2021-06-10 21:27:10,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:10,321 INFO L129 PetriNetUnfolder]: 265/482 cut-off events. [2021-06-10 21:27:10,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:27:10,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 482 events. 265/482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2326 event pairs, 149 based on Foata normal form. 33/468 useless extension candidates. Maximal degree in co-relation 892. Up to 305 conditions per place. [2021-06-10 21:27:10,326 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 15 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2021-06-10 21:27:10,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 113 flow [2021-06-10 21:27:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:27:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:27:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2021-06-10 21:27:10,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-06-10 21:27:10,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2021-06-10 21:27:10,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2021-06-10 21:27:10,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:10,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2021-06-10 21:27:10,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,353 INFO L185 Difference]: Start difference. First operand has 37 places, 29 transitions, 67 flow. Second operand 3 states and 470 transitions. [2021-06-10 21:27:10,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 113 flow [2021-06-10 21:27:10,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 21:27:10,356 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2021-06-10 21:27:10,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-06-10 21:27:10,358 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-10 21:27:10,358 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2021-06-10 21:27:10,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:10,359 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:10,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 21:27:10,359 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash -690590370, now seen corresponding path program 1 times [2021-06-10 21:27:10,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:10,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764131895] [2021-06-10 21:27:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:10,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:10,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764131895] [2021-06-10 21:27:10,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:10,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:27:10,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245203280] [2021-06-10 21:27:10,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:27:10,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:27:10,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:27:10,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 188 [2021-06-10 21:27:10,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:10,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 188 [2021-06-10 21:27:10,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:10,519 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-06-10 21:27:10,519 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:27:10,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-10 21:27:10,519 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 1 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2021-06-10 21:27:10,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-06-10 21:27:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:27:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:27:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-06-10 21:27:10,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8368794326241135 [2021-06-10 21:27:10,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-06-10 21:27:10,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-06-10 21:27:10,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:10,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-06-10 21:27:10,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,526 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 3 states and 472 transitions. [2021-06-10 21:27:10,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-06-10 21:27:10,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:27:10,527 INFO L241 Difference]: Finished difference. Result has 34 places, 22 transitions, 58 flow [2021-06-10 21:27:10,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2021-06-10 21:27:10,528 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-10 21:27:10,528 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 58 flow [2021-06-10 21:27:10,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:10,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:10,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 21:27:10,529 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:10,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:10,529 INFO L82 PathProgramCache]: Analyzing trace with hash -484517677, now seen corresponding path program 1 times [2021-06-10 21:27:10,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:10,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237493867] [2021-06-10 21:27:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:10,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:10,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237493867] [2021-06-10 21:27:10,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:10,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:27:10,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091618741] [2021-06-10 21:27:10,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:27:10,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:27:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:27:10,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 188 [2021-06-10 21:27:10,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:10,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 188 [2021-06-10 21:27:10,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:10,645 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-10 21:27:10,645 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-10 21:27:10,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-10 21:27:10,646 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-06-10 21:27:10,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 64 flow [2021-06-10 21:27:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:27:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:27:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-06-10 21:27:10,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8315602836879432 [2021-06-10 21:27:10,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-06-10 21:27:10,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-06-10 21:27:10,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:10,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-06-10 21:27:10,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,651 INFO L185 Difference]: Start difference. First operand has 34 places, 22 transitions, 58 flow. Second operand 3 states and 469 transitions. [2021-06-10 21:27:10,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 64 flow [2021-06-10 21:27:10,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:27:10,652 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2021-06-10 21:27:10,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-06-10 21:27:10,652 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-06-10 21:27:10,652 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2021-06-10 21:27:10,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:10,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:10,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 21:27:10,653 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2043608347, now seen corresponding path program 1 times [2021-06-10 21:27:10,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:10,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358208304] [2021-06-10 21:27:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:10,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:10,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 21:27:10,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:10,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:10,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:10,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358208304] [2021-06-10 21:27:10,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:10,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:27:10,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979479857] [2021-06-10 21:27:10,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:27:10,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:27:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:27:10,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2021-06-10 21:27:10,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:10,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:10,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2021-06-10 21:27:10,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:11,028 INFO L129 PetriNetUnfolder]: 428/757 cut-off events. [2021-06-10 21:27:11,028 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2021-06-10 21:27:11,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 757 events. 428/757 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4133 event pairs, 31 based on Foata normal form. 30/775 useless extension candidates. Maximal degree in co-relation 1599. Up to 224 conditions per place. [2021-06-10 21:27:11,032 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 27 selfloop transitions, 7 changer transitions 11/54 dead transitions. [2021-06-10 21:27:11,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 229 flow [2021-06-10 21:27:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:27:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:27:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2021-06-10 21:27:11,035 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6870567375886525 [2021-06-10 21:27:11,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2021-06-10 21:27:11,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2021-06-10 21:27:11,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:11,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2021-06-10 21:27:11,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,041 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 6 states and 775 transitions. [2021-06-10 21:27:11,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 229 flow [2021-06-10 21:27:11,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:27:11,043 INFO L241 Difference]: Finished difference. Result has 40 places, 25 transitions, 104 flow [2021-06-10 21:27:11,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2021-06-10 21:27:11,043 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2021-06-10 21:27:11,044 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 104 flow [2021-06-10 21:27:11,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,044 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:11,044 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:11,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 21:27:11,044 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1914121303, now seen corresponding path program 1 times [2021-06-10 21:27:11,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:11,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668818428] [2021-06-10 21:27:11,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:11,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:11,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:11,178 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-06-10 21:27:11,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-06-10 21:27:11,207 INFO L142 QuantifierPusher]: treesize reduction 32, result has 34.7 percent of original size [2021-06-10 21:27:11,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 21:27:11,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 21:27:11,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:27:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:11,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668818428] [2021-06-10 21:27:11,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:11,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 21:27:11,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256507138] [2021-06-10 21:27:11,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 21:27:11,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 21:27:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-10 21:27:11,246 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 188 [2021-06-10 21:27:11,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:11,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 188 [2021-06-10 21:27:11,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:11,447 INFO L129 PetriNetUnfolder]: 138/285 cut-off events. [2021-06-10 21:27:11,448 INFO L130 PetriNetUnfolder]: For 335/376 co-relation queries the response was YES. [2021-06-10 21:27:11,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 285 events. 138/285 cut-off events. For 335/376 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1267 event pairs, 14 based on Foata normal form. 7/282 useless extension candidates. Maximal degree in co-relation 755. Up to 193 conditions per place. [2021-06-10 21:27:11,450 INFO L132 encePairwiseOnDemand]: 179/188 looper letters, 16 selfloop transitions, 12 changer transitions 0/39 dead transitions. [2021-06-10 21:27:11,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 208 flow [2021-06-10 21:27:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:27:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:27:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2021-06-10 21:27:11,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7138297872340426 [2021-06-10 21:27:11,453 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2021-06-10 21:27:11,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2021-06-10 21:27:11,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:11,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2021-06-10 21:27:11,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,457 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 104 flow. Second operand 5 states and 671 transitions. [2021-06-10 21:27:11,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 208 flow [2021-06-10 21:27:11,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 190 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-10 21:27:11,460 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 156 flow [2021-06-10 21:27:11,460 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-06-10 21:27:11,460 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2021-06-10 21:27:11,460 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 156 flow [2021-06-10 21:27:11,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 129.875) internal successors, (1039), 8 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,461 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:11,461 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:11,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 21:27:11,461 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash 957744641, now seen corresponding path program 2 times [2021-06-10 21:27:11,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:11,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850160318] [2021-06-10 21:27:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:11,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:11,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:11,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:11,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-10 21:27:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:11,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850160318] [2021-06-10 21:27:11,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:11,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:27:11,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151131519] [2021-06-10 21:27:11,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:27:11,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:27:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:27:11,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 188 [2021-06-10 21:27:11,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:11,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 188 [2021-06-10 21:27:11,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:11,722 INFO L129 PetriNetUnfolder]: 165/332 cut-off events. [2021-06-10 21:27:11,723 INFO L130 PetriNetUnfolder]: For 349/429 co-relation queries the response was YES. [2021-06-10 21:27:11,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 332 events. 165/332 cut-off events. For 349/429 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1540 event pairs, 38 based on Foata normal form. 18/343 useless extension candidates. Maximal degree in co-relation 1007. Up to 215 conditions per place. [2021-06-10 21:27:11,725 INFO L132 encePairwiseOnDemand]: 178/188 looper letters, 18 selfloop transitions, 18 changer transitions 0/47 dead transitions. [2021-06-10 21:27:11,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 292 flow [2021-06-10 21:27:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:27:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:27:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2021-06-10 21:27:11,728 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6879432624113475 [2021-06-10 21:27:11,728 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 776 transitions. [2021-06-10 21:27:11,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 776 transitions. [2021-06-10 21:27:11,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:11,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 776 transitions. [2021-06-10 21:27:11,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,733 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,733 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 156 flow. Second operand 6 states and 776 transitions. [2021-06-10 21:27:11,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 292 flow [2021-06-10 21:27:11,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-10 21:27:11,735 INFO L241 Difference]: Finished difference. Result has 48 places, 43 transitions, 285 flow [2021-06-10 21:27:11,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2021-06-10 21:27:11,736 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2021-06-10 21:27:11,736 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 285 flow [2021-06-10 21:27:11,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:11,736 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:11,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 21:27:11,736 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1030831981, now seen corresponding path program 1 times [2021-06-10 21:27:11,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:11,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408196974] [2021-06-10 21:27:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:11,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:11,822 INFO L142 QuantifierPusher]: treesize reduction 35, result has 59.8 percent of original size [2021-06-10 21:27:11,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-10 21:27:11,828 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.7 percent of original size [2021-06-10 21:27:11,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-06-10 21:27:11,863 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.3 percent of original size [2021-06-10 21:27:11,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-06-10 21:27:11,904 INFO L142 QuantifierPusher]: treesize reduction 10, result has 87.5 percent of original size [2021-06-10 21:27:11,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-06-10 21:27:11,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:11,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 21:27:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:11,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408196974] [2021-06-10 21:27:11,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:11,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:27:11,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878560202] [2021-06-10 21:27:11,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:27:11,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:27:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:27:11,966 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2021-06-10 21:27:11,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:11,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:11,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2021-06-10 21:27:11,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:12,265 INFO L129 PetriNetUnfolder]: 172/362 cut-off events. [2021-06-10 21:27:12,265 INFO L130 PetriNetUnfolder]: For 688/891 co-relation queries the response was YES. [2021-06-10 21:27:12,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 362 events. 172/362 cut-off events. For 688/891 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1841 event pairs, 15 based on Foata normal form. 34/389 useless extension candidates. Maximal degree in co-relation 1394. Up to 258 conditions per place. [2021-06-10 21:27:12,268 INFO L132 encePairwiseOnDemand]: 179/188 looper letters, 28 selfloop transitions, 19 changer transitions 0/58 dead transitions. [2021-06-10 21:27:12,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 478 flow [2021-06-10 21:27:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2021-06-10 21:27:12,271 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6664133738601824 [2021-06-10 21:27:12,271 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2021-06-10 21:27:12,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2021-06-10 21:27:12,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:12,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2021-06-10 21:27:12,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,276 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,276 INFO L185 Difference]: Start difference. First operand has 48 places, 43 transitions, 285 flow. Second operand 7 states and 877 transitions. [2021-06-10 21:27:12,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 478 flow [2021-06-10 21:27:12,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 21:27:12,279 INFO L241 Difference]: Finished difference. Result has 56 places, 53 transitions, 431 flow [2021-06-10 21:27:12,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2021-06-10 21:27:12,279 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2021-06-10 21:27:12,279 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 431 flow [2021-06-10 21:27:12,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:12,280 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:12,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 21:27:12,280 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash 335762563, now seen corresponding path program 1 times [2021-06-10 21:27:12,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:12,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965652917] [2021-06-10 21:27:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:12,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:12,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965652917] [2021-06-10 21:27:12,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:12,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:27:12,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625337243] [2021-06-10 21:27:12,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:27:12,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:12,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:27:12,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:27:12,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2021-06-10 21:27:12,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:12,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2021-06-10 21:27:12,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:12,444 INFO L129 PetriNetUnfolder]: 158/386 cut-off events. [2021-06-10 21:27:12,444 INFO L130 PetriNetUnfolder]: For 780/904 co-relation queries the response was YES. [2021-06-10 21:27:12,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 386 events. 158/386 cut-off events. For 780/904 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2167 event pairs, 57 based on Foata normal form. 81/451 useless extension candidates. Maximal degree in co-relation 1247. Up to 159 conditions per place. [2021-06-10 21:27:12,448 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 9 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2021-06-10 21:27:12,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 444 flow [2021-06-10 21:27:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:27:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:27:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-06-10 21:27:12,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8063829787234043 [2021-06-10 21:27:12,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-06-10 21:27:12,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-06-10 21:27:12,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:12,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-06-10 21:27:12,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,455 INFO L185 Difference]: Start difference. First operand has 56 places, 53 transitions, 431 flow. Second operand 5 states and 758 transitions. [2021-06-10 21:27:12,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 444 flow [2021-06-10 21:27:12,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 405 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-06-10 21:27:12,459 INFO L241 Difference]: Finished difference. Result has 59 places, 56 transitions, 415 flow [2021-06-10 21:27:12,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2021-06-10 21:27:12,459 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2021-06-10 21:27:12,459 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 415 flow [2021-06-10 21:27:12,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:12,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:12,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 21:27:12,460 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1642019171, now seen corresponding path program 1 times [2021-06-10 21:27:12,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:12,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727104114] [2021-06-10 21:27:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:12,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,571 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-10 21:27:12,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:12,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:12,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727104114] [2021-06-10 21:27:12,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:12,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:27:12,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453346308] [2021-06-10 21:27:12,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:27:12,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:27:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:27:12,582 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2021-06-10 21:27:12,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:12,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2021-06-10 21:27:12,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:12,666 INFO L129 PetriNetUnfolder]: 94/280 cut-off events. [2021-06-10 21:27:12,666 INFO L130 PetriNetUnfolder]: For 769/1091 co-relation queries the response was YES. [2021-06-10 21:27:12,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 280 events. 94/280 cut-off events. For 769/1091 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1554 event pairs, 14 based on Foata normal form. 179/449 useless extension candidates. Maximal degree in co-relation 1088. Up to 123 conditions per place. [2021-06-10 21:27:12,669 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 15 changer transitions 3/64 dead transitions. [2021-06-10 21:27:12,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 497 flow [2021-06-10 21:27:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-06-10 21:27:12,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8062310030395137 [2021-06-10 21:27:12,672 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-06-10 21:27:12,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-06-10 21:27:12,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:12,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-06-10 21:27:12,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,679 INFO L185 Difference]: Start difference. First operand has 59 places, 56 transitions, 415 flow. Second operand 7 states and 1061 transitions. [2021-06-10 21:27:12,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 497 flow [2021-06-10 21:27:12,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 484 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 21:27:12,684 INFO L241 Difference]: Finished difference. Result has 65 places, 61 transitions, 479 flow [2021-06-10 21:27:12,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2021-06-10 21:27:12,684 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2021-06-10 21:27:12,684 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 479 flow [2021-06-10 21:27:12,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,685 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:12,685 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:12,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 21:27:12,685 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1245266915, now seen corresponding path program 1 times [2021-06-10 21:27:12,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:12,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322193597] [2021-06-10 21:27:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:12,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,808 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-10 21:27:12,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:12,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:12,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:12,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:12,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322193597] [2021-06-10 21:27:12,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:12,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:27:12,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739766245] [2021-06-10 21:27:12,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:27:12,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:27:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:27:12,822 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2021-06-10 21:27:12,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 479 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:12,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2021-06-10 21:27:12,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:12,926 INFO L129 PetriNetUnfolder]: 81/250 cut-off events. [2021-06-10 21:27:12,926 INFO L130 PetriNetUnfolder]: For 1153/1516 co-relation queries the response was YES. [2021-06-10 21:27:12,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 250 events. 81/250 cut-off events. For 1153/1516 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1398 event pairs, 8 based on Foata normal form. 155/396 useless extension candidates. Maximal degree in co-relation 1125. Up to 114 conditions per place. [2021-06-10 21:27:12,930 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 2 selfloop transitions, 19 changer transitions 3/65 dead transitions. [2021-06-10 21:27:12,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 557 flow [2021-06-10 21:27:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 21:27:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 21:27:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1358 transitions. [2021-06-10 21:27:12,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8026004728132388 [2021-06-10 21:27:12,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1358 transitions. [2021-06-10 21:27:12,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1358 transitions. [2021-06-10 21:27:12,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:12,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1358 transitions. [2021-06-10 21:27:12,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.88888888888889) internal successors, (1358), 9 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,941 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,941 INFO L185 Difference]: Start difference. First operand has 65 places, 61 transitions, 479 flow. Second operand 9 states and 1358 transitions. [2021-06-10 21:27:12,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 557 flow [2021-06-10 21:27:12,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 495 flow, removed 22 selfloop flow, removed 5 redundant places. [2021-06-10 21:27:12,948 INFO L241 Difference]: Finished difference. Result has 71 places, 62 transitions, 478 flow [2021-06-10 21:27:12,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=478, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2021-06-10 21:27:12,949 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2021-06-10 21:27:12,949 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 478 flow [2021-06-10 21:27:12,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:12,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:12,950 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:12,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 21:27:12,950 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash 942257882, now seen corresponding path program 1 times [2021-06-10 21:27:12,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:12,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400368947] [2021-06-10 21:27:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:13,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:13,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:13,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:13,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:13,100 INFO L142 QuantifierPusher]: treesize reduction 29, result has 59.7 percent of original size [2021-06-10 21:27:13,101 INFO L147 QuantifierPusher]: treesize reduction 8, result has 81.4 percent of original size 35 [2021-06-10 21:27:13,110 INFO L142 QuantifierPusher]: treesize reduction 26, result has 75.2 percent of original size [2021-06-10 21:27:13,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-06-10 21:27:13,162 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-06-10 21:27:13,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:13,177 INFO L142 QuantifierPusher]: treesize reduction 3, result has 84.2 percent of original size [2021-06-10 21:27:13,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:13,196 INFO L142 QuantifierPusher]: treesize reduction 3, result has 75.0 percent of original size [2021-06-10 21:27:13,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 21:27:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:13,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400368947] [2021-06-10 21:27:13,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:13,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 21:27:13,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631905869] [2021-06-10 21:27:13,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 21:27:13,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 21:27:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-10 21:27:13,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 188 [2021-06-10 21:27:13,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 123.375) internal successors, (987), 8 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:13,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 188 [2021-06-10 21:27:13,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:13,561 INFO L129 PetriNetUnfolder]: 110/352 cut-off events. [2021-06-10 21:27:13,561 INFO L130 PetriNetUnfolder]: For 2193/2506 co-relation queries the response was YES. [2021-06-10 21:27:13,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 352 events. 110/352 cut-off events. For 2193/2506 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2315 event pairs, 0 based on Foata normal form. 91/430 useless extension candidates. Maximal degree in co-relation 1501. Up to 95 conditions per place. [2021-06-10 21:27:13,565 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 33 selfloop transitions, 19 changer transitions 5/83 dead transitions. [2021-06-10 21:27:13,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 742 flow [2021-06-10 21:27:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-10 21:27:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-10 21:27:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions. [2021-06-10 21:27:13,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6722074468085106 [2021-06-10 21:27:13,568 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions. [2021-06-10 21:27:13,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions. [2021-06-10 21:27:13,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:13,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions. [2021-06-10 21:27:13,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,574 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,574 INFO L185 Difference]: Start difference. First operand has 71 places, 62 transitions, 478 flow. Second operand 8 states and 1011 transitions. [2021-06-10 21:27:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 742 flow [2021-06-10 21:27:13,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 678 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-06-10 21:27:13,582 INFO L241 Difference]: Finished difference. Result has 71 places, 66 transitions, 521 flow [2021-06-10 21:27:13,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=521, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2021-06-10 21:27:13,582 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2021-06-10 21:27:13,582 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 521 flow [2021-06-10 21:27:13,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.375) internal successors, (987), 8 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:13,583 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:13,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 21:27:13,583 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash -419870930, now seen corresponding path program 2 times [2021-06-10 21:27:13,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:13,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389565594] [2021-06-10 21:27:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:13,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:13,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:27:13,650 INFO L142 QuantifierPusher]: treesize reduction 5, result has 85.3 percent of original size [2021-06-10 21:27:13,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-10 21:27:13,666 INFO L142 QuantifierPusher]: treesize reduction 33, result has 55.4 percent of original size [2021-06-10 21:27:13,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-10 21:27:13,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:13,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:13,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389565594] [2021-06-10 21:27:13,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:13,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:27:13,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149218602] [2021-06-10 21:27:13,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:27:13,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:27:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:27:13,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 188 [2021-06-10 21:27:13,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:13,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 188 [2021-06-10 21:27:13,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:13,908 INFO L129 PetriNetUnfolder]: 117/385 cut-off events. [2021-06-10 21:27:13,909 INFO L130 PetriNetUnfolder]: For 1521/2030 co-relation queries the response was YES. [2021-06-10 21:27:13,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 385 events. 117/385 cut-off events. For 1521/2030 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2649 event pairs, 4 based on Foata normal form. 118/486 useless extension candidates. Maximal degree in co-relation 1524. Up to 102 conditions per place. [2021-06-10 21:27:13,912 INFO L132 encePairwiseOnDemand]: 179/188 looper letters, 27 selfloop transitions, 18 changer transitions 19/90 dead transitions. [2021-06-10 21:27:13,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 829 flow [2021-06-10 21:27:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:27:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:27:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2021-06-10 21:27:13,915 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7216312056737588 [2021-06-10 21:27:13,915 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 814 transitions. [2021-06-10 21:27:13,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 814 transitions. [2021-06-10 21:27:13,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:13,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 814 transitions. [2021-06-10 21:27:13,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,919 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,920 INFO L185 Difference]: Start difference. First operand has 71 places, 66 transitions, 521 flow. Second operand 6 states and 814 transitions. [2021-06-10 21:27:13,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 829 flow [2021-06-10 21:27:13,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 802 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-06-10 21:27:13,925 INFO L241 Difference]: Finished difference. Result has 76 places, 70 transitions, 598 flow [2021-06-10 21:27:13,926 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2021-06-10 21:27:13,926 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2021-06-10 21:27:13,926 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 598 flow [2021-06-10 21:27:13,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:13,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:13,926 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:13,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 21:27:13,927 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1565947982, now seen corresponding path program 3 times [2021-06-10 21:27:13,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:13,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410029438] [2021-06-10 21:27:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:14,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:14,023 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-10 21:27:14,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-10 21:27:14,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:27:14,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:14,047 INFO L142 QuantifierPusher]: treesize reduction 9, result has 88.6 percent of original size [2021-06-10 21:27:14,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-06-10 21:27:14,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:14,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:27:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:14,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410029438] [2021-06-10 21:27:14,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:14,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 21:27:14,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901307455] [2021-06-10 21:27:14,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 21:27:14,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 21:27:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-10 21:27:14,115 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 188 [2021-06-10 21:27:14,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 598 flow. Second operand has 8 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:14,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:14,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 188 [2021-06-10 21:27:14,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:14,364 INFO L129 PetriNetUnfolder]: 105/363 cut-off events. [2021-06-10 21:27:14,364 INFO L130 PetriNetUnfolder]: For 1521/1901 co-relation queries the response was YES. [2021-06-10 21:27:14,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 363 events. 105/363 cut-off events. For 1521/1901 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2487 event pairs, 0 based on Foata normal form. 85/436 useless extension candidates. Maximal degree in co-relation 1538. Up to 98 conditions per place. [2021-06-10 21:27:14,369 INFO L132 encePairwiseOnDemand]: 179/188 looper letters, 24 selfloop transitions, 20 changer transitions 10/80 dead transitions. [2021-06-10 21:27:14,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 807 flow [2021-06-10 21:27:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:27:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:27:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2021-06-10 21:27:14,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6551418439716312 [2021-06-10 21:27:14,371 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2021-06-10 21:27:14,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2021-06-10 21:27:14,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:14,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2021-06-10 21:27:14,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:14,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:14,376 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:14,376 INFO L185 Difference]: Start difference. First operand has 76 places, 70 transitions, 598 flow. Second operand 6 states and 739 transitions. [2021-06-10 21:27:14,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 807 flow [2021-06-10 21:27:14,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 749 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-06-10 21:27:14,384 INFO L241 Difference]: Finished difference. Result has 76 places, 69 transitions, 618 flow [2021-06-10 21:27:14,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2021-06-10 21:27:14,384 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2021-06-10 21:27:14,384 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 618 flow [2021-06-10 21:27:14,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:14,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:14,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:14,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 21:27:14,385 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1813553376, now seen corresponding path program 4 times [2021-06-10 21:27:14,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:14,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76660274] [2021-06-10 21:27:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:14,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:14,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 21:27:14,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:14,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:27:14,548 INFO L142 QuantifierPusher]: treesize reduction 18, result has 64.7 percent of original size [2021-06-10 21:27:14,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-10 21:27:14,578 INFO L142 QuantifierPusher]: treesize reduction 16, result has 74.6 percent of original size [2021-06-10 21:27:14,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-10 21:27:14,622 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-06-10 21:27:14,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-10 21:27:14,639 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-06-10 21:27:14,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 21:27:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:14,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76660274] [2021-06-10 21:27:14,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:14,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 21:27:14,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469748387] [2021-06-10 21:27:14,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-10 21:27:14,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-10 21:27:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-10 21:27:14,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 188 [2021-06-10 21:27:14,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 618 flow. Second operand has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:14,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:14,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 188 [2021-06-10 21:27:14,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:15,037 INFO L129 PetriNetUnfolder]: 148/472 cut-off events. [2021-06-10 21:27:15,037 INFO L130 PetriNetUnfolder]: For 1998/2420 co-relation queries the response was YES. [2021-06-10 21:27:15,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 472 events. 148/472 cut-off events. For 1998/2420 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3456 event pairs, 6 based on Foata normal form. 113/569 useless extension candidates. Maximal degree in co-relation 2075. Up to 132 conditions per place. [2021-06-10 21:27:15,042 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 44 selfloop transitions, 23 changer transitions 7/100 dead transitions. [2021-06-10 21:27:15,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 1096 flow [2021-06-10 21:27:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-10 21:27:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-10 21:27:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions. [2021-06-10 21:27:15,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6469414893617021 [2021-06-10 21:27:15,045 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 973 transitions. [2021-06-10 21:27:15,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions. [2021-06-10 21:27:15,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:15,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions. [2021-06-10 21:27:15,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,050 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,050 INFO L185 Difference]: Start difference. First operand has 76 places, 69 transitions, 618 flow. Second operand 8 states and 973 transitions. [2021-06-10 21:27:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 1096 flow [2021-06-10 21:27:15,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 1034 flow, removed 26 selfloop flow, removed 5 redundant places. [2021-06-10 21:27:15,061 INFO L241 Difference]: Finished difference. Result has 78 places, 76 transitions, 755 flow [2021-06-10 21:27:15,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=755, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2021-06-10 21:27:15,061 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2021-06-10 21:27:15,061 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 755 flow [2021-06-10 21:27:15,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:15,062 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:15,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-10 21:27:15,062 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1611677202, now seen corresponding path program 5 times [2021-06-10 21:27:15,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:15,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765073472] [2021-06-10 21:27:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:15,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:15,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-10 21:27:15,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 21:27:15,183 INFO L142 QuantifierPusher]: treesize reduction 22, result has 47.6 percent of original size [2021-06-10 21:27:15,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-10 21:27:15,199 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.4 percent of original size [2021-06-10 21:27:15,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-10 21:27:15,237 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-06-10 21:27:15,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-10 21:27:15,253 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-06-10 21:27:15,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 21:27:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:15,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765073472] [2021-06-10 21:27:15,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:15,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 21:27:15,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287396555] [2021-06-10 21:27:15,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-10 21:27:15,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-10 21:27:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-10 21:27:15,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 188 [2021-06-10 21:27:15,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 755 flow. Second operand has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:15,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 188 [2021-06-10 21:27:15,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:15,680 INFO L129 PetriNetUnfolder]: 175/581 cut-off events. [2021-06-10 21:27:15,680 INFO L130 PetriNetUnfolder]: For 2498/2991 co-relation queries the response was YES. [2021-06-10 21:27:15,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 581 events. 175/581 cut-off events. For 2498/2991 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4624 event pairs, 12 based on Foata normal form. 112/670 useless extension candidates. Maximal degree in co-relation 2507. Up to 150 conditions per place. [2021-06-10 21:27:15,686 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 54 selfloop transitions, 14 changer transitions 5/99 dead transitions. [2021-06-10 21:27:15,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 1128 flow [2021-06-10 21:27:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2021-06-10 21:27:15,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6405775075987842 [2021-06-10 21:27:15,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2021-06-10 21:27:15,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2021-06-10 21:27:15,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:15,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2021-06-10 21:27:15,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,701 INFO L185 Difference]: Start difference. First operand has 78 places, 76 transitions, 755 flow. Second operand 7 states and 843 transitions. [2021-06-10 21:27:15,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 1128 flow [2021-06-10 21:27:15,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 1016 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-06-10 21:27:15,714 INFO L241 Difference]: Finished difference. Result has 78 places, 77 transitions, 710 flow [2021-06-10 21:27:15,715 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=710, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2021-06-10 21:27:15,715 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2021-06-10 21:27:15,715 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 710 flow [2021-06-10 21:27:15,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:15,716 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:15,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-10 21:27:15,716 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2107805090, now seen corresponding path program 6 times [2021-06-10 21:27:15,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:15,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399598695] [2021-06-10 21:27:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:15,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:15,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 21:27:15,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 21:27:15,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:15,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 21:27:15,831 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-06-10 21:27:15,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:15,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399598695] [2021-06-10 21:27:15,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:15,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:27:15,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060013885] [2021-06-10 21:27:15,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:27:15,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:27:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:27:15,844 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 188 [2021-06-10 21:27:15,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 710 flow. Second operand has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:15,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:15,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 188 [2021-06-10 21:27:15,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:16,112 INFO L129 PetriNetUnfolder]: 180/607 cut-off events. [2021-06-10 21:27:16,113 INFO L130 PetriNetUnfolder]: For 2430/2950 co-relation queries the response was YES. [2021-06-10 21:27:16,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 607 events. 180/607 cut-off events. For 2430/2950 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 4931 event pairs, 10 based on Foata normal form. 114/695 useless extension candidates. Maximal degree in co-relation 2560. Up to 150 conditions per place. [2021-06-10 21:27:16,119 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 42 selfloop transitions, 6 changer transitions 20/94 dead transitions. [2021-06-10 21:27:16,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 94 transitions, 1021 flow [2021-06-10 21:27:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2021-06-10 21:27:16,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2021-06-10 21:27:16,123 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2021-06-10 21:27:16,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2021-06-10 21:27:16,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:16,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2021-06-10 21:27:16,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,128 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,128 INFO L185 Difference]: Start difference. First operand has 78 places, 77 transitions, 710 flow. Second operand 7 states and 868 transitions. [2021-06-10 21:27:16,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 94 transitions, 1021 flow [2021-06-10 21:27:16,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 94 transitions, 998 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-06-10 21:27:16,145 INFO L241 Difference]: Finished difference. Result has 83 places, 74 transitions, 683 flow [2021-06-10 21:27:16,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=683, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2021-06-10 21:27:16,145 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2021-06-10 21:27:16,145 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 683 flow [2021-06-10 21:27:16,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:16,146 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:16,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-10 21:27:16,146 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1599761794, now seen corresponding path program 7 times [2021-06-10 21:27:16,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:16,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119064344] [2021-06-10 21:27:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:16,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:16,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:16,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:16,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:27:16,246 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-06-10 21:27:16,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-06-10 21:27:16,274 INFO L142 QuantifierPusher]: treesize reduction 14, result has 54.8 percent of original size [2021-06-10 21:27:16,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 21:27:16,287 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-06-10 21:27:16,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 21:27:16,298 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-06-10 21:27:16,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:16,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119064344] [2021-06-10 21:27:16,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:16,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 21:27:16,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582118308] [2021-06-10 21:27:16,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 21:27:16,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 21:27:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-10 21:27:16,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 188 [2021-06-10 21:27:16,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 683 flow. Second operand has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:16,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 188 [2021-06-10 21:27:16,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:16,533 INFO L129 PetriNetUnfolder]: 155/521 cut-off events. [2021-06-10 21:27:16,533 INFO L130 PetriNetUnfolder]: For 2235/2668 co-relation queries the response was YES. [2021-06-10 21:27:16,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 521 events. 155/521 cut-off events. For 2235/2668 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 4054 event pairs, 8 based on Foata normal form. 99/593 useless extension candidates. Maximal degree in co-relation 2165. Up to 140 conditions per place. [2021-06-10 21:27:16,538 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 36 selfloop transitions, 6 changer transitions 18/86 dead transitions. [2021-06-10 21:27:16,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 915 flow [2021-06-10 21:27:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-10 21:27:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-10 21:27:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 964 transitions. [2021-06-10 21:27:16,543 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6409574468085106 [2021-06-10 21:27:16,543 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 964 transitions. [2021-06-10 21:27:16,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 964 transitions. [2021-06-10 21:27:16,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:16,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 964 transitions. [2021-06-10 21:27:16,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.5) internal successors, (964), 8 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,548 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,548 INFO L185 Difference]: Start difference. First operand has 83 places, 74 transitions, 683 flow. Second operand 8 states and 964 transitions. [2021-06-10 21:27:16,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 915 flow [2021-06-10 21:27:16,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 858 flow, removed 24 selfloop flow, removed 5 redundant places. [2021-06-10 21:27:16,561 INFO L241 Difference]: Finished difference. Result has 86 places, 68 transitions, 587 flow [2021-06-10 21:27:16,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=587, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2021-06-10 21:27:16,561 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2021-06-10 21:27:16,561 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 587 flow [2021-06-10 21:27:16,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:16,562 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:16,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-10 21:27:16,562 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 368568672, now seen corresponding path program 8 times [2021-06-10 21:27:16,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:16,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327026403] [2021-06-10 21:27:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:16,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:16,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:16,653 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-06-10 21:27:16,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 21:27:16,677 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-06-10 21:27:16,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-06-10 21:27:16,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:16,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:27:16,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:16,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:16,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327026403] [2021-06-10 21:27:16,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:16,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:27:16,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539327837] [2021-06-10 21:27:16,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:27:16,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:27:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:27:16,728 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 188 [2021-06-10 21:27:16,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:16,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:16,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 188 [2021-06-10 21:27:16,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:16,995 INFO L129 PetriNetUnfolder]: 171/567 cut-off events. [2021-06-10 21:27:16,995 INFO L130 PetriNetUnfolder]: For 2267/2653 co-relation queries the response was YES. [2021-06-10 21:27:16,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 567 events. 171/567 cut-off events. For 2267/2653 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 4468 event pairs, 6 based on Foata normal form. 109/641 useless extension candidates. Maximal degree in co-relation 2250. Up to 175 conditions per place. [2021-06-10 21:27:17,000 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 39 selfloop transitions, 12 changer transitions 18/95 dead transitions. [2021-06-10 21:27:17,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 95 transitions, 971 flow [2021-06-10 21:27:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2021-06-10 21:27:17,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6709726443768997 [2021-06-10 21:27:17,003 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2021-06-10 21:27:17,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2021-06-10 21:27:17,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:17,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2021-06-10 21:27:17,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,007 INFO L185 Difference]: Start difference. First operand has 86 places, 68 transitions, 587 flow. Second operand 7 states and 883 transitions. [2021-06-10 21:27:17,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 95 transitions, 971 flow [2021-06-10 21:27:17,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 95 transitions, 914 flow, removed 21 selfloop flow, removed 10 redundant places. [2021-06-10 21:27:17,021 INFO L241 Difference]: Finished difference. Result has 82 places, 62 transitions, 535 flow [2021-06-10 21:27:17,021 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=535, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2021-06-10 21:27:17,021 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2021-06-10 21:27:17,021 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 535 flow [2021-06-10 21:27:17,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,021 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:17,022 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:17,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-10 21:27:17,022 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1615048902, now seen corresponding path program 9 times [2021-06-10 21:27:17,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:17,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157252267] [2021-06-10 21:27:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:17,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:17,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:17,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:17,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:27:17,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:17,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:27:17,142 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.2 percent of original size [2021-06-10 21:27:17,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-10 21:27:17,165 INFO L142 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-06-10 21:27:17,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-10 21:27:17,184 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-06-10 21:27:17,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-10 21:27:17,202 INFO L142 QuantifierPusher]: treesize reduction 5, result has 82.1 percent of original size [2021-06-10 21:27:17,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 21:27:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:17,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157252267] [2021-06-10 21:27:17,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:17,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 21:27:17,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831175137] [2021-06-10 21:27:17,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 21:27:17,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 21:27:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-10 21:27:17,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 188 [2021-06-10 21:27:17,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 535 flow. Second operand has 8 states, 8 states have (on average 117.375) internal successors, (939), 8 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:17,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 188 [2021-06-10 21:27:17,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:17,754 INFO L129 PetriNetUnfolder]: 174/584 cut-off events. [2021-06-10 21:27:17,754 INFO L130 PetriNetUnfolder]: For 2908/3204 co-relation queries the response was YES. [2021-06-10 21:27:17,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 584 events. 174/584 cut-off events. For 2908/3204 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 4813 event pairs, 6 based on Foata normal form. 97/651 useless extension candidates. Maximal degree in co-relation 2295. Up to 185 conditions per place. [2021-06-10 21:27:17,758 INFO L132 encePairwiseOnDemand]: 179/188 looper letters, 20 selfloop transitions, 25 changer transitions 10/81 dead transitions. [2021-06-10 21:27:17,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 832 flow [2021-06-10 21:27:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 21:27:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 21:27:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2021-06-10 21:27:17,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6371158392434988 [2021-06-10 21:27:17,761 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2021-06-10 21:27:17,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2021-06-10 21:27:17,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:17,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2021-06-10 21:27:17,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,766 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,766 INFO L185 Difference]: Start difference. First operand has 82 places, 62 transitions, 535 flow. Second operand 9 states and 1078 transitions. [2021-06-10 21:27:17,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 832 flow [2021-06-10 21:27:17,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 765 flow, removed 16 selfloop flow, removed 10 redundant places. [2021-06-10 21:27:17,777 INFO L241 Difference]: Finished difference. Result has 76 places, 65 transitions, 596 flow [2021-06-10 21:27:17,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=596, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2021-06-10 21:27:17,777 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2021-06-10 21:27:17,777 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 596 flow [2021-06-10 21:27:17,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.375) internal successors, (939), 8 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,777 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:17,777 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:17,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-10 21:27:17,778 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1060583366, now seen corresponding path program 10 times [2021-06-10 21:27:17,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:17,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269241516] [2021-06-10 21:27:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:17,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:17,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:27:17,865 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-10 21:27:17,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-10 21:27:17,883 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-10 21:27:17,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 21:27:17,907 INFO L142 QuantifierPusher]: treesize reduction 41, result has 48.1 percent of original size [2021-06-10 21:27:17,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-10 21:27:17,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:17,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 21:27:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:17,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269241516] [2021-06-10 21:27:17,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:17,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:27:17,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640391604] [2021-06-10 21:27:17,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:27:17,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:17,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:27:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:27:17,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 188 [2021-06-10 21:27:17,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 596 flow. Second operand has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:17,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:17,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 188 [2021-06-10 21:27:17,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:18,157 INFO L129 PetriNetUnfolder]: 157/537 cut-off events. [2021-06-10 21:27:18,158 INFO L130 PetriNetUnfolder]: For 1667/1871 co-relation queries the response was YES. [2021-06-10 21:27:18,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 537 events. 157/537 cut-off events. For 1667/1871 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4363 event pairs, 4 based on Foata normal form. 55/561 useless extension candidates. Maximal degree in co-relation 2189. Up to 165 conditions per place. [2021-06-10 21:27:18,162 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 28 selfloop transitions, 10 changer transitions 25/89 dead transitions. [2021-06-10 21:27:18,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 937 flow [2021-06-10 21:27:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 906 transitions. [2021-06-10 21:27:18,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6884498480243161 [2021-06-10 21:27:18,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 906 transitions. [2021-06-10 21:27:18,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 906 transitions. [2021-06-10 21:27:18,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:18,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 906 transitions. [2021-06-10 21:27:18,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,173 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,173 INFO L185 Difference]: Start difference. First operand has 76 places, 65 transitions, 596 flow. Second operand 7 states and 906 transitions. [2021-06-10 21:27:18,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 937 flow [2021-06-10 21:27:18,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 865 flow, removed 23 selfloop flow, removed 4 redundant places. [2021-06-10 21:27:18,186 INFO L241 Difference]: Finished difference. Result has 78 places, 57 transitions, 484 flow [2021-06-10 21:27:18,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2021-06-10 21:27:18,186 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2021-06-10 21:27:18,186 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 484 flow [2021-06-10 21:27:18,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,187 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:18,187 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:18,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-10 21:27:18,187 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2069132796, now seen corresponding path program 11 times [2021-06-10 21:27:18,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:18,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917158288] [2021-06-10 21:27:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:18,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:18,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:18,309 INFO L142 QuantifierPusher]: treesize reduction 24, result has 68.4 percent of original size [2021-06-10 21:27:18,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-10 21:27:18,316 INFO L142 QuantifierPusher]: treesize reduction 24, result has 67.1 percent of original size [2021-06-10 21:27:18,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-10 21:27:18,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:27:18,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-10 21:27:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:18,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917158288] [2021-06-10 21:27:18,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:18,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:27:18,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105738224] [2021-06-10 21:27:18,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:27:18,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:27:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:27:18,367 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 188 [2021-06-10 21:27:18,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:18,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 188 [2021-06-10 21:27:18,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:18,494 INFO L129 PetriNetUnfolder]: 112/373 cut-off events. [2021-06-10 21:27:18,495 INFO L130 PetriNetUnfolder]: For 1119/1209 co-relation queries the response was YES. [2021-06-10 21:27:18,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 373 events. 112/373 cut-off events. For 1119/1209 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 2609 event pairs, 8 based on Foata normal form. 29/376 useless extension candidates. Maximal degree in co-relation 1458. Up to 125 conditions per place. [2021-06-10 21:27:18,498 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 23 selfloop transitions, 11 changer transitions 2/62 dead transitions. [2021-06-10 21:27:18,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 62 transitions, 606 flow [2021-06-10 21:27:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 21:27:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 21:27:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2021-06-10 21:27:18,500 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7194148936170213 [2021-06-10 21:27:18,500 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2021-06-10 21:27:18,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2021-06-10 21:27:18,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:18,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2021-06-10 21:27:18,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,504 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,504 INFO L185 Difference]: Start difference. First operand has 78 places, 57 transitions, 484 flow. Second operand 4 states and 541 transitions. [2021-06-10 21:27:18,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 62 transitions, 606 flow [2021-06-10 21:27:18,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 550 flow, removed 8 selfloop flow, removed 10 redundant places. [2021-06-10 21:27:18,512 INFO L241 Difference]: Finished difference. Result has 70 places, 60 transitions, 489 flow [2021-06-10 21:27:18,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=489, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2021-06-10 21:27:18,512 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2021-06-10 21:27:18,512 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 489 flow [2021-06-10 21:27:18,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,512 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:18,512 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:18,513 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-10 21:27:18,513 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash 926157380, now seen corresponding path program 12 times [2021-06-10 21:27:18,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:18,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228973734] [2021-06-10 21:27:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:18,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:18,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:27:18,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:27:18,610 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-06-10 21:27:18,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 21:27:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:18,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228973734] [2021-06-10 21:27:18,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:18,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:27:18,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579941584] [2021-06-10 21:27:18,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:27:18,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:27:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:27:18,627 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 188 [2021-06-10 21:27:18,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:18,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 188 [2021-06-10 21:27:18,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:18,829 INFO L129 PetriNetUnfolder]: 130/429 cut-off events. [2021-06-10 21:27:18,829 INFO L130 PetriNetUnfolder]: For 1338/1466 co-relation queries the response was YES. [2021-06-10 21:27:18,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 429 events. 130/429 cut-off events. For 1338/1466 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 3129 event pairs, 0 based on Foata normal form. 29/425 useless extension candidates. Maximal degree in co-relation 1658. Up to 150 conditions per place. [2021-06-10 21:27:18,832 INFO L132 encePairwiseOnDemand]: 180/188 looper letters, 26 selfloop transitions, 7 changer transitions 9/68 dead transitions. [2021-06-10 21:27:18,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 643 flow [2021-06-10 21:27:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:27:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:27:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2021-06-10 21:27:18,834 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6702127659574468 [2021-06-10 21:27:18,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 756 transitions. [2021-06-10 21:27:18,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 756 transitions. [2021-06-10 21:27:18,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:18,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 756 transitions. [2021-06-10 21:27:18,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,837 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,837 INFO L185 Difference]: Start difference. First operand has 70 places, 60 transitions, 489 flow. Second operand 6 states and 756 transitions. [2021-06-10 21:27:18,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 643 flow [2021-06-10 21:27:18,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:27:18,845 INFO L241 Difference]: Finished difference. Result has 74 places, 58 transitions, 476 flow [2021-06-10 21:27:18,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2021-06-10 21:27:18,845 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2021-06-10 21:27:18,845 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 476 flow [2021-06-10 21:27:18,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:18,845 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:18,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-10 21:27:18,846 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:18,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 233926888, now seen corresponding path program 13 times [2021-06-10 21:27:18,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:18,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117271343] [2021-06-10 21:27:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:27:18,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:27:18,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:18,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:27:18,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:27:18,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:27:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:27:18,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117271343] [2021-06-10 21:27:18,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:27:18,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:27:18,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101970118] [2021-06-10 21:27:18,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:27:18,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:27:18,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:27:18,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:27:18,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 188 [2021-06-10 21:27:18,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:18,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:27:18,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 188 [2021-06-10 21:27:18,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:27:19,126 INFO L129 PetriNetUnfolder]: 125/419 cut-off events. [2021-06-10 21:27:19,126 INFO L130 PetriNetUnfolder]: For 1233/1341 co-relation queries the response was YES. [2021-06-10 21:27:19,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 419 events. 125/419 cut-off events. For 1233/1341 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 3025 event pairs, 7 based on Foata normal form. 29/418 useless extension candidates. Maximal degree in co-relation 1613. Up to 145 conditions per place. [2021-06-10 21:27:19,130 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 21 selfloop transitions, 7 changer transitions 13/67 dead transitions. [2021-06-10 21:27:19,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 67 transitions, 632 flow [2021-06-10 21:27:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:27:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:27:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2021-06-10 21:27:19,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6975683890577508 [2021-06-10 21:27:19,132 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2021-06-10 21:27:19,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2021-06-10 21:27:19,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:27:19,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2021-06-10 21:27:19,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:19,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:19,136 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:19,136 INFO L185 Difference]: Start difference. First operand has 74 places, 58 transitions, 476 flow. Second operand 7 states and 918 transitions. [2021-06-10 21:27:19,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 67 transitions, 632 flow [2021-06-10 21:27:19,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 618 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-06-10 21:27:19,144 INFO L241 Difference]: Finished difference. Result has 78 places, 54 transitions, 437 flow [2021-06-10 21:27:19,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2021-06-10 21:27:19,144 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2021-06-10 21:27:19,144 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 437 flow [2021-06-10 21:27:19,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:27:19,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:27:19,145 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:27:19,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-10 21:27:19,145 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:27:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:27:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 362778508, now seen corresponding path program 14 times [2021-06-10 21:27:19,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:27:19,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219157803] [2021-06-10 21:27:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:27:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:27:19,196 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:27:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:27:19,285 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:27:19,325 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 21:27:19,326 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 21:27:19,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-10 21:27:19,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 09:27:19 BasicIcfg [2021-06-10 21:27:19,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 21:27:19,422 INFO L168 Benchmark]: Toolchain (without parser) took 30640.15 ms. Allocated memory was 335.5 MB in the beginning and 872.4 MB in the end (delta: 536.9 MB). Free memory was 297.3 MB in the beginning and 386.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 449.8 MB. Max. memory is 16.0 GB. [2021-06-10 21:27:19,422 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 335.5 MB. Free memory is still 315.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 21:27:19,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.16 ms. Allocated memory is still 335.5 MB. Free memory was 297.2 MB in the beginning and 289.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-06-10 21:27:19,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.74 ms. Allocated memory is still 335.5 MB. Free memory was 289.6 MB in the beginning and 287.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:27:19,423 INFO L168 Benchmark]: Boogie Preprocessor took 52.02 ms. Allocated memory is still 335.5 MB. Free memory was 287.5 MB in the beginning and 284.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:27:19,423 INFO L168 Benchmark]: RCFGBuilder took 2984.43 ms. Allocated memory was 335.5 MB in the beginning and 419.4 MB in the end (delta: 83.9 MB). Free memory was 284.4 MB in the beginning and 234.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 156.8 MB. Max. memory is 16.0 GB. [2021-06-10 21:27:19,423 INFO L168 Benchmark]: TraceAbstraction took 26880.95 ms. Allocated memory was 419.4 MB in the beginning and 872.4 MB in the end (delta: 453.0 MB). Free memory was 234.5 MB in the beginning and 386.1 MB in the end (delta: -151.6 MB). Peak memory consumption was 302.4 MB. Max. memory is 16.0 GB. [2021-06-10 21:27:19,424 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 335.5 MB. Free memory is still 315.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 639.16 ms. Allocated memory is still 335.5 MB. Free memory was 297.2 MB in the beginning and 289.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.74 ms. Allocated memory is still 335.5 MB. Free memory was 289.6 MB in the beginning and 287.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 52.02 ms. Allocated memory is still 335.5 MB. Free memory was 287.5 MB in the beginning and 284.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2984.43 ms. Allocated memory was 335.5 MB in the beginning and 419.4 MB in the end (delta: 83.9 MB). Free memory was 284.4 MB in the beginning and 234.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 156.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26880.95 ms. Allocated memory was 419.4 MB in the beginning and 872.4 MB in the end (delta: 453.0 MB). Free memory was 234.5 MB in the beginning and 386.1 MB in the end (delta: -151.6 MB). Peak memory consumption was 302.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: 17118.5ms, 104 PlacesBefore, 37 PlacesAfterwards, 96 TransitionsBefore, 29 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 89 TotalNumberOfCompositions, 5831 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2134, positive: 1950, positive conditional: 0, positive unconditional: 1950, negative: 184, negative conditional: 0, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1205, positive: 1156, positive conditional: 0, positive unconditional: 1156, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, positive: 1156, positive conditional: 0, positive unconditional: 1156, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, positive: 1133, positive conditional: 0, positive unconditional: 1133, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1154, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 1103, negative conditional: 0, negative unconditional: 1103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2134, positive: 794, positive conditional: 0, positive unconditional: 794, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 1205, unknown conditional: 0, unknown unconditional: 1205] , Statistics on independence cache: Total cache size (in pairs): 2198, Positive cache size: 2149, Positive conditional cache size: 0, Positive unconditional cache size: 2149, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2330; [L855] FCALL, FORK 0 pthread_create(&t2330, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L856] 0 pthread_t t2331; [L857] FCALL, FORK 0 pthread_create(&t2331, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L858] 0 pthread_t t2332; [L859] FCALL, FORK 0 pthread_create(&t2332, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L747] 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) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] 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) [L747] 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) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 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 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 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 [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L770] 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) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] 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) [L770] 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) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 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 [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 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 [L799] 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) [L799] 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) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 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 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L865] 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) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] 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) [L865] 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) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 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 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 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 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 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) [L876] 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) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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)) [L882] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26627.4ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5560.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17208.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 103 SDtfs, 105 SDslu, 84 SDs, 0 SdLazy, 1166 SolverSat, 392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1906.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2384.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=755occurred in iteration=14, InterpolantAutomatonStates: 144, 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: 87.3ms SsaConstructionTime, 891.4ms SatisfiabilityAnalysisTime, 2512.9ms InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 3936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...