/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:26:50,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:26:50,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:26:50,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:26:50,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:26:50,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:26:50,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:26:50,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:26:50,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:26:50,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:26:50,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:26:50,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:26:50,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:26:50,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:26:50,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:26:50,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:26:50,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:26:50,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:26:50,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:26:50,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:26:50,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:26:50,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:26:50,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:26:50,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:26:50,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:26:50,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:26:50,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:26:50,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:26:50,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:26:50,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:26:50,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:26:50,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:26:50,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:26:50,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:26:50,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:26:50,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:26:50,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:26:50,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:26:50,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:26:50,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:26:50,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:26:50,471 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-03-11 20:26:50,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:26:50,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:26:50,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:26:50,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:26:50,511 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:26:50,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:26:50,511 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:26:50,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:26:50,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:26:50,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:26:50,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:26:50,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:26:50,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:26:50,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:26:50,514 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:26:50,515 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-03-11 20:26:50,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:26:50,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:26:50,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:26:50,839 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:26:50,840 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:26:50,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2021-03-11 20:26:50,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66a1998f/575974bfd5c44a4392d34047ad2cd0fe/FLAG57622c4d1 [2021-03-11 20:26:51,493 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:26:51,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2021-03-11 20:26:51,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66a1998f/575974bfd5c44a4392d34047ad2cd0fe/FLAG57622c4d1 [2021-03-11 20:26:51,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66a1998f/575974bfd5c44a4392d34047ad2cd0fe [2021-03-11 20:26:51,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:26:51,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:26:51,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:26:51,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:26:51,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:26:51,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:26:51" (1/1) ... [2021-03-11 20:26:51,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a580b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:51, skipping insertion in model container [2021-03-11 20:26:51,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:26:51" (1/1) ... [2021-03-11 20:26:51,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:26:51,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:26:52,103 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_rmo.opt.i[992,1005] [2021-03-11 20:26:52,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:26:52,298 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:26:52,310 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_rmo.opt.i[992,1005] [2021-03-11 20:26:52,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:26:52,453 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:26:52,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52 WrapperNode [2021-03-11 20:26:52,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:26:52,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:26:52,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:26:52,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:26:52,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:26:52,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:26:52,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:26:52,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:26:52,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... [2021-03-11 20:26:52,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:26:52,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:26:52,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:26:52,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:26:52,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:26:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:26:52,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:26:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:26:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:26:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:26:52,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:26:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:26:52,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:26:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:26:52,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:26:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:26:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:26:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:26:52,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:26:52,695 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:26:55,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:26:55,420 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:26:55,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:26:55 BoogieIcfgContainer [2021-03-11 20:26:55,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:26:55,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:26:55,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:26:55,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:26:55,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:26:51" (1/3) ... [2021-03-11 20:26:55,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119620b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:26:55, skipping insertion in model container [2021-03-11 20:26:55,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:26:52" (2/3) ... [2021-03-11 20:26:55,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119620b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:26:55, skipping insertion in model container [2021-03-11 20:26:55,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:26:55" (3/3) ... [2021-03-11 20:26:55,427 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.opt.i [2021-03-11 20:26:55,433 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:26:55,437 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:26:55,437 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:26:55,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,488 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:26:55,517 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:26:55,532 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:26:55,548 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:26:55,548 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:26:55,548 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:26:55,549 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:26:55,549 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:26:55,549 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:26:55,549 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:26:55,549 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:26:55,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-11 20:26:55,588 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-11 20:26:55,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:26:55,592 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-03-11 20:26:55,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-11 20:26:55,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-11 20:26:55,599 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:26:55,606 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-11 20:26:55,608 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-11 20:26:55,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-11 20:26:55,626 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-11 20:26:55,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:26:55,627 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-03-11 20:26:55,629 INFO L116 LiptonReduction]: Number of co-enabled transitions 1786 [2021-03-11 20:26:56,624 WARN L205 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-11 20:26:56,890 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 20:26:58,162 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 20:26:58,699 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:27:00,180 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:27:00,563 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-03-11 20:27:00,680 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:27:01,669 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:27:01,949 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:27:03,175 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-11 20:27:03,734 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 20:27:04,182 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:27:04,454 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:27:04,986 WARN L205 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 20:27:05,545 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-11 20:27:06,547 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 20:27:06,818 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 20:27:07,393 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-03-11 20:27:08,002 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-03-11 20:27:08,314 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 20:27:08,437 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:27:08,699 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-11 20:27:08,819 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:27:08,842 INFO L131 LiptonReduction]: Checked pairs total: 5207 [2021-03-11 20:27:08,842 INFO L133 LiptonReduction]: Total number of compositions: 83 [2021-03-11 20:27:08,844 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13248 [2021-03-11 20:27:08,851 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-11 20:27:08,851 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:08,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:08,851 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:27:08,852 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-03-11 20:27:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1729437353, now seen corresponding path program 1 times [2021-03-11 20:27:08,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:08,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788631826] [2021-03-11 20:27:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:09,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:09,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:09,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788631826] [2021-03-11 20:27:09,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:09,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:27:09,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283199088] [2021-03-11 20:27:09,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:27:09,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:09,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:27:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:27:09,119 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 182 [2021-03-11 20:27:09,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:09,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 182 [2021-03-11 20:27:09,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:09,357 INFO L129 PetriNetUnfolder]: 265/532 cut-off events. [2021-03-11 20:27:09,357 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:09,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 532 events. 265/532 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3070 event pairs, 57 based on Foata normal form. 33/520 useless extension candidates. Maximal degree in co-relation 942. Up to 305 conditions per place. [2021-03-11 20:27:09,367 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 15 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2021-03-11 20:27:09,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 109 flow [2021-03-11 20:27:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:27:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:27:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-11 20:27:09,385 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8424908424908425 [2021-03-11 20:27:09,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-11 20:27:09,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-11 20:27:09,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:09,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-11 20:27:09,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,406 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 460 transitions. [2021-03-11 20:27:09,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 109 flow [2021-03-11 20:27:09,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:09,411 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2021-03-11 20:27:09,413 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-03-11 20:27:09,413 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2021-03-11 20:27:09,413 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2021-03-11 20:27:09,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,414 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:09,414 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:09,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:27:09,414 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-03-11 20:27:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1990435045, now seen corresponding path program 1 times [2021-03-11 20:27:09,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:09,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378211258] [2021-03-11 20:27:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:09,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:09,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:09,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378211258] [2021-03-11 20:27:09,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:09,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:27:09,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180118682] [2021-03-11 20:27:09,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:27:09,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:09,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:27:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:27:09,523 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 182 [2021-03-11 20:27:09,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:09,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 182 [2021-03-11 20:27:09,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:09,535 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-11 20:27:09,535 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:09,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 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-03-11 20:27:09,535 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-11 20:27:09,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-03-11 20:27:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:27:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:27:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2021-03-11 20:27:09,537 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.86996336996337 [2021-03-11 20:27:09,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2021-03-11 20:27:09,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2021-03-11 20:27:09,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:09,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2021-03-11 20:27:09,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,541 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 475 transitions. [2021-03-11 20:27:09,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-03-11 20:27:09,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:09,542 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2021-03-11 20:27:09,542 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-03-11 20:27:09,543 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2021-03-11 20:27:09,543 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-11 20:27:09,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:09,543 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:09,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:27:09,544 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-03-11 20:27:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1574170667, now seen corresponding path program 1 times [2021-03-11 20:27:09,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:09,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642590349] [2021-03-11 20:27:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:09,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:09,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:09,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642590349] [2021-03-11 20:27:09,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:09,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:27:09,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038151771] [2021-03-11 20:27:09,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:27:09,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:09,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:27:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:27:09,702 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 182 [2021-03-11 20:27:09,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:09,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 182 [2021-03-11 20:27:09,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:09,722 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-11 20:27:09,722 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-11 20:27:09,722 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-03-11 20:27:09,722 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-11 20:27:09,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 64 flow [2021-03-11 20:27:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:27:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:27:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-11 20:27:09,725 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8754578754578755 [2021-03-11 20:27:09,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-11 20:27:09,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-11 20:27:09,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:09,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-11 20:27:09,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,729 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 478 transitions. [2021-03-11 20:27:09,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 64 flow [2021-03-11 20:27:09,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:09,730 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2021-03-11 20:27:09,730 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, 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-03-11 20:27:09,730 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2021-03-11 20:27:09,731 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2021-03-11 20:27:09,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,731 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:09,731 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:09,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:27:09,732 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-03-11 20:27:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash 195434308, now seen corresponding path program 1 times [2021-03-11 20:27:09,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:09,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418645060] [2021-03-11 20:27:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:09,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:09,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:09,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:09,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:09,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418645060] [2021-03-11 20:27:09,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:09,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:27:09,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393354839] [2021-03-11 20:27:09,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:27:09,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:27:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:27:09,886 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-03-11 20:27:09,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:09,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-03-11 20:27:09,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:09,915 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-11 20:27:09,915 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-03-11 20:27:09,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 0/29 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-11 20:27:09,916 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-11 20:27:09,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 75 flow [2021-03-11 20:27:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:27:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:27:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2021-03-11 20:27:09,919 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2021-03-11 20:27:09,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 611 transitions. [2021-03-11 20:27:09,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 611 transitions. [2021-03-11 20:27:09,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:09,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 611 transitions. [2021-03-11 20:27:09,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,923 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,923 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 4 states and 611 transitions. [2021-03-11 20:27:09,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 75 flow [2021-03-11 20:27:09,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 71 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:09,925 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 72 flow [2021-03-11 20:27:09,925 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2021-03-11 20:27:09,925 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2021-03-11 20:27:09,925 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 72 flow [2021-03-11 20:27:09,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:09,926 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:09,926 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:09,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:27:09,926 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-03-11 20:27:09,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash 6063943, now seen corresponding path program 1 times [2021-03-11 20:27:09,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:09,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130368679] [2021-03-11 20:27:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:10,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:10,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:10,097 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-03-11 20:27:10,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:27:10,124 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:27:10,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:27:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:10,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130368679] [2021-03-11 20:27:10,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:10,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:27:10,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982790367] [2021-03-11 20:27:10,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:10,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:10,131 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-11 20:27:10,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:10,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-11 20:27:10,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:10,338 INFO L129 PetriNetUnfolder]: 157/325 cut-off events. [2021-03-11 20:27:10,338 INFO L130 PetriNetUnfolder]: For 159/160 co-relation queries the response was YES. [2021-03-11 20:27:10,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 325 events. 157/325 cut-off events. For 159/160 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1546 event pairs, 35 based on Foata normal form. 7/322 useless extension candidates. Maximal degree in co-relation 699. Up to 206 conditions per place. [2021-03-11 20:27:10,342 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 14 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2021-03-11 20:27:10,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 151 flow [2021-03-11 20:27:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2021-03-11 20:27:10,346 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6996336996336996 [2021-03-11 20:27:10,346 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2021-03-11 20:27:10,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2021-03-11 20:27:10,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:10,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2021-03-11 20:27:10,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,351 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,351 INFO L185 Difference]: Start difference. First operand has 36 places, 22 transitions, 72 flow. Second operand 6 states and 764 transitions. [2021-03-11 20:27:10,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 151 flow [2021-03-11 20:27:10,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 139 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:27:10,355 INFO L241 Difference]: Finished difference. Result has 39 places, 31 transitions, 133 flow [2021-03-11 20:27:10,355 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2021-03-11 20:27:10,355 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2021-03-11 20:27:10,356 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 133 flow [2021-03-11 20:27:10,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,357 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:10,357 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:10,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:27:10,357 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-03-11 20:27:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2040211759, now seen corresponding path program 2 times [2021-03-11 20:27:10,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:10,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596966603] [2021-03-11 20:27:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:10,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:10,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:10,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:10,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:27:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:10,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596966603] [2021-03-11 20:27:10,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:10,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:27:10,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126256628] [2021-03-11 20:27:10,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:10,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:10,522 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-11 20:27:10,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:10,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-11 20:27:10,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:10,685 INFO L129 PetriNetUnfolder]: 160/322 cut-off events. [2021-03-11 20:27:10,685 INFO L130 PetriNetUnfolder]: For 175/207 co-relation queries the response was YES. [2021-03-11 20:27:10,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 322 events. 160/322 cut-off events. For 175/207 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1491 event pairs, 56 based on Foata normal form. 3/319 useless extension candidates. Maximal degree in co-relation 938. Up to 246 conditions per place. [2021-03-11 20:27:10,689 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 19 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2021-03-11 20:27:10,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 255 flow [2021-03-11 20:27:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2021-03-11 20:27:10,692 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7005494505494505 [2021-03-11 20:27:10,692 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2021-03-11 20:27:10,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2021-03-11 20:27:10,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:10,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2021-03-11 20:27:10,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,696 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,696 INFO L185 Difference]: Start difference. First operand has 39 places, 31 transitions, 133 flow. Second operand 6 states and 765 transitions. [2021-03-11 20:27:10,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 255 flow [2021-03-11 20:27:10,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:27:10,699 INFO L241 Difference]: Finished difference. Result has 45 places, 41 transitions, 234 flow [2021-03-11 20:27:10,700 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2021-03-11 20:27:10,700 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2021-03-11 20:27:10,700 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 234 flow [2021-03-11 20:27:10,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,700 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:10,700 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:10,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:27:10,701 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-03-11 20:27:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash -87487657, now seen corresponding path program 3 times [2021-03-11 20:27:10,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:10,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355744933] [2021-03-11 20:27:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:10,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:27:10,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:10,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:27:10,854 INFO L142 QuantifierPusher]: treesize reduction 17, result has 75.7 percent of original size [2021-03-11 20:27:10,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-11 20:27:10,881 INFO L142 QuantifierPusher]: treesize reduction 15, result has 46.4 percent of original size [2021-03-11 20:27:10,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:10,894 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-03-11 20:27:10,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:10,905 INFO L142 QuantifierPusher]: treesize reduction 24, result has 36.8 percent of original size [2021-03-11 20:27:10,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:27:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:10,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355744933] [2021-03-11 20:27:10,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:10,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:27:10,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286075602] [2021-03-11 20:27:10,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:27:10,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:27:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:27:10,921 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 182 [2021-03-11 20:27:10,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 125.875) internal successors, (1007), 8 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:10,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:10,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 182 [2021-03-11 20:27:10,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:11,125 INFO L129 PetriNetUnfolder]: 172/352 cut-off events. [2021-03-11 20:27:11,126 INFO L130 PetriNetUnfolder]: For 477/591 co-relation queries the response was YES. [2021-03-11 20:27:11,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 352 events. 172/352 cut-off events. For 477/591 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1719 event pairs, 15 based on Foata normal form. 18/361 useless extension candidates. Maximal degree in co-relation 1243. Up to 261 conditions per place. [2021-03-11 20:27:11,129 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 27 selfloop transitions, 17 changer transitions 0/55 dead transitions. [2021-03-11 20:27:11,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 412 flow [2021-03-11 20:27:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:27:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:27:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2021-03-11 20:27:11,131 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2021-03-11 20:27:11,132 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2021-03-11 20:27:11,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2021-03-11 20:27:11,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:11,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2021-03-11 20:27:11,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,135 INFO L185 Difference]: Start difference. First operand has 45 places, 41 transitions, 234 flow. Second operand 5 states and 650 transitions. [2021-03-11 20:27:11,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 412 flow [2021-03-11 20:27:11,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 394 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-11 20:27:11,141 INFO L241 Difference]: Finished difference. Result has 49 places, 52 transitions, 362 flow [2021-03-11 20:27:11,141 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2021-03-11 20:27:11,141 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2021-03-11 20:27:11,141 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 362 flow [2021-03-11 20:27:11,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 125.875) internal successors, (1007), 8 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,142 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:11,142 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:11,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:27:11,142 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-03-11 20:27:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1068097597, now seen corresponding path program 1 times [2021-03-11 20:27:11,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:11,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904535657] [2021-03-11 20:27:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:11,274 INFO L142 QuantifierPusher]: treesize reduction 30, result has 42.3 percent of original size [2021-03-11 20:27:11,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:27:11,291 INFO L142 QuantifierPusher]: treesize reduction 30, result has 45.5 percent of original size [2021-03-11 20:27:11,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 20:27:11,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:27:11,326 INFO L142 QuantifierPusher]: treesize reduction 52, result has 62.3 percent of original size [2021-03-11 20:27:11,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-03-11 20:27:11,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-11 20:27:11,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:27:11,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-11 20:27:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:11,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904535657] [2021-03-11 20:27:11,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:11,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:27:11,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945625260] [2021-03-11 20:27:11,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:27:11,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:27:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:27:11,503 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 182 [2021-03-11 20:27:11,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 362 flow. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:11,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 182 [2021-03-11 20:27:11,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:11,788 INFO L129 PetriNetUnfolder]: 180/364 cut-off events. [2021-03-11 20:27:11,789 INFO L130 PetriNetUnfolder]: For 888/1149 co-relation queries the response was YES. [2021-03-11 20:27:11,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 364 events. 180/364 cut-off events. For 888/1149 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1790 event pairs, 14 based on Foata normal form. 43/401 useless extension candidates. Maximal degree in co-relation 1512. Up to 259 conditions per place. [2021-03-11 20:27:11,792 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 26 selfloop transitions, 26 changer transitions 0/63 dead transitions. [2021-03-11 20:27:11,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 553 flow [2021-03-11 20:27:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:27:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:27:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2021-03-11 20:27:11,796 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6824175824175824 [2021-03-11 20:27:11,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2021-03-11 20:27:11,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2021-03-11 20:27:11,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:11,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2021-03-11 20:27:11,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,800 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,800 INFO L185 Difference]: Start difference. First operand has 49 places, 52 transitions, 362 flow. Second operand 5 states and 621 transitions. [2021-03-11 20:27:11,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 553 flow [2021-03-11 20:27:11,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 529 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:11,805 INFO L241 Difference]: Finished difference. Result has 51 places, 58 transitions, 478 flow [2021-03-11 20:27:11,806 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=478, PETRI_PLACES=51, PETRI_TRANSITIONS=58} [2021-03-11 20:27:11,806 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2021-03-11 20:27:11,806 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 58 transitions, 478 flow [2021-03-11 20:27:11,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,806 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:11,806 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:11,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:27:11,807 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-03-11 20:27:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 664629093, now seen corresponding path program 1 times [2021-03-11 20:27:11,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:11,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47947279] [2021-03-11 20:27:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:11,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:11,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:11,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:11,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:11,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47947279] [2021-03-11 20:27:11,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:11,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:27:11,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908114561] [2021-03-11 20:27:11,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:27:11,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:11,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:27:11,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:27:11,897 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 182 [2021-03-11 20:27:11,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:11,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 182 [2021-03-11 20:27:11,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:11,984 INFO L129 PetriNetUnfolder]: 181/411 cut-off events. [2021-03-11 20:27:11,984 INFO L130 PetriNetUnfolder]: For 1037/1182 co-relation queries the response was YES. [2021-03-11 20:27:11,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 411 events. 181/411 cut-off events. For 1037/1182 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2241 event pairs, 49 based on Foata normal form. 101/491 useless extension candidates. Maximal degree in co-relation 1431. Up to 174 conditions per place. [2021-03-11 20:27:11,989 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 9 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2021-03-11 20:27:11,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 483 flow [2021-03-11 20:27:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:27:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:27:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2021-03-11 20:27:11,991 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.810989010989011 [2021-03-11 20:27:11,991 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2021-03-11 20:27:11,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2021-03-11 20:27:11,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:11,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2021-03-11 20:27:11,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:11,997 INFO L185 Difference]: Start difference. First operand has 51 places, 58 transitions, 478 flow. Second operand 5 states and 738 transitions. [2021-03-11 20:27:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 483 flow [2021-03-11 20:27:11,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 459 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:12,001 INFO L241 Difference]: Finished difference. Result has 55 places, 60 transitions, 469 flow [2021-03-11 20:27:12,002 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2021-03-11 20:27:12,002 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2021-03-11 20:27:12,002 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 469 flow [2021-03-11 20:27:12,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,002 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:12,002 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:12,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:27:12,002 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-03-11 20:27:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1351404695, now seen corresponding path program 1 times [2021-03-11 20:27:12,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:12,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524361481] [2021-03-11 20:27:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:12,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:12,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:27:12,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-11 20:27:12,207 INFO L142 QuantifierPusher]: treesize reduction 30, result has 70.0 percent of original size [2021-03-11 20:27:12,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-11 20:27:12,244 INFO L142 QuantifierPusher]: treesize reduction 31, result has 71.6 percent of original size [2021-03-11 20:27:12,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-03-11 20:27:12,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:27:12,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:27:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:12,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524361481] [2021-03-11 20:27:12,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:12,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:27:12,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129094240] [2021-03-11 20:27:12,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:27:12,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:27:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:27:12,317 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182 [2021-03-11 20:27:12,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 469 flow. Second operand has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:12,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182 [2021-03-11 20:27:12,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:12,626 INFO L129 PetriNetUnfolder]: 204/434 cut-off events. [2021-03-11 20:27:12,626 INFO L130 PetriNetUnfolder]: For 1792/2176 co-relation queries the response was YES. [2021-03-11 20:27:12,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 434 events. 204/434 cut-off events. For 1792/2176 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2321 event pairs, 58 based on Foata normal form. 80/479 useless extension candidates. Maximal degree in co-relation 1976. Up to 258 conditions per place. [2021-03-11 20:27:12,631 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 26 selfloop transitions, 23 changer transitions 0/67 dead transitions. [2021-03-11 20:27:12,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 640 flow [2021-03-11 20:27:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2021-03-11 20:27:12,634 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6831501831501832 [2021-03-11 20:27:12,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2021-03-11 20:27:12,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2021-03-11 20:27:12,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:12,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2021-03-11 20:27:12,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,638 INFO L185 Difference]: Start difference. First operand has 55 places, 60 transitions, 469 flow. Second operand 6 states and 746 transitions. [2021-03-11 20:27:12,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 640 flow [2021-03-11 20:27:12,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:27:12,643 INFO L241 Difference]: Finished difference. Result has 60 places, 65 transitions, 596 flow [2021-03-11 20:27:12,644 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=596, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2021-03-11 20:27:12,644 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2021-03-11 20:27:12,644 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 596 flow [2021-03-11 20:27:12,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,644 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:12,645 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:12,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:27:12,645 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-03-11 20:27:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -872997876, now seen corresponding path program 1 times [2021-03-11 20:27:12,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:12,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528720930] [2021-03-11 20:27:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:12,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:12,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:12,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:12,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:12,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-03-11 20:27:12,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528720930] [2021-03-11 20:27:12,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:12,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:12,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606666879] [2021-03-11 20:27:12,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:12,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:12,731 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 182 [2021-03-11 20:27:12,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:12,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 182 [2021-03-11 20:27:12,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:12,820 INFO L129 PetriNetUnfolder]: 97/273 cut-off events. [2021-03-11 20:27:12,820 INFO L130 PetriNetUnfolder]: For 1471/2089 co-relation queries the response was YES. [2021-03-11 20:27:12,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 273 events. 97/273 cut-off events. For 1471/2089 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1471 event pairs, 6 based on Foata normal form. 207/466 useless extension candidates. Maximal degree in co-relation 1176. Up to 110 conditions per place. [2021-03-11 20:27:12,823 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 15 changer transitions 3/72 dead transitions. [2021-03-11 20:27:12,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 666 flow [2021-03-11 20:27:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2021-03-11 20:27:12,827 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8108320251177394 [2021-03-11 20:27:12,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions. [2021-03-11 20:27:12,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions. [2021-03-11 20:27:12,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:12,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions. [2021-03-11 20:27:12,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,832 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,832 INFO L185 Difference]: Start difference. First operand has 60 places, 65 transitions, 596 flow. Second operand 7 states and 1033 transitions. [2021-03-11 20:27:12,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 666 flow [2021-03-11 20:27:12,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 641 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:27:12,837 INFO L241 Difference]: Finished difference. Result has 65 places, 69 transitions, 636 flow [2021-03-11 20:27:12,837 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=636, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2021-03-11 20:27:12,837 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2021-03-11 20:27:12,838 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 636 flow [2021-03-11 20:27:12,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,838 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:12,838 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:12,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:27:12,838 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-03-11 20:27:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1182856240, now seen corresponding path program 1 times [2021-03-11 20:27:12,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:12,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167676508] [2021-03-11 20:27:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:12,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:12,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:12,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:12,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:12,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:12,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:12,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167676508] [2021-03-11 20:27:12,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:12,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:27:12,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576940470] [2021-03-11 20:27:12,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:27:12,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:12,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:27:12,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:27:12,955 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 182 [2021-03-11 20:27:12,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 636 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:12,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:12,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 182 [2021-03-11 20:27:12,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:13,067 INFO L129 PetriNetUnfolder]: 79/237 cut-off events. [2021-03-11 20:27:13,067 INFO L130 PetriNetUnfolder]: For 2087/3218 co-relation queries the response was YES. [2021-03-11 20:27:13,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 237 events. 79/237 cut-off events. For 2087/3218 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1292 event pairs, 0 based on Foata normal form. 190/417 useless extension candidates. Maximal degree in co-relation 1146. Up to 101 conditions per place. [2021-03-11 20:27:13,070 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 2 selfloop transitions, 19 changer transitions 3/73 dead transitions. [2021-03-11 20:27:13,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 714 flow [2021-03-11 20:27:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:27:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:27:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1322 transitions. [2021-03-11 20:27:13,074 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8070818070818071 [2021-03-11 20:27:13,074 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1322 transitions. [2021-03-11 20:27:13,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1322 transitions. [2021-03-11 20:27:13,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:13,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1322 transitions. [2021-03-11 20:27:13,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 146.88888888888889) internal successors, (1322), 9 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,080 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,080 INFO L185 Difference]: Start difference. First operand has 65 places, 69 transitions, 636 flow. Second operand 9 states and 1322 transitions. [2021-03-11 20:27:13,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 714 flow [2021-03-11 20:27:13,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 658 flow, removed 20 selfloop flow, removed 4 redundant places. [2021-03-11 20:27:13,088 INFO L241 Difference]: Finished difference. Result has 72 places, 70 transitions, 641 flow [2021-03-11 20:27:13,088 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=641, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2021-03-11 20:27:13,088 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2021-03-11 20:27:13,088 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 641 flow [2021-03-11 20:27:13,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:13,089 INFO L255 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-03-11 20:27:13,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:27:13,089 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-03-11 20:27:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1944827237, now seen corresponding path program 1 times [2021-03-11 20:27:13,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:13,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678851981] [2021-03-11 20:27:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:13,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:13,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:13,207 INFO L142 QuantifierPusher]: treesize reduction 6, result has 92.2 percent of original size [2021-03-11 20:27:13,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-11 20:27:13,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:27:13,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:27:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:13,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678851981] [2021-03-11 20:27:13,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:13,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:13,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949379587] [2021-03-11 20:27:13,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:27:13,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:27:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:27:13,260 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-11 20:27:13,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:13,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-11 20:27:13,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:13,481 INFO L129 PetriNetUnfolder]: 115/365 cut-off events. [2021-03-11 20:27:13,481 INFO L130 PetriNetUnfolder]: For 3031/3463 co-relation queries the response was YES. [2021-03-11 20:27:13,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 365 events. 115/365 cut-off events. For 3031/3463 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2433 event pairs, 0 based on Foata normal form. 77/430 useless extension candidates. Maximal degree in co-relation 1688. Up to 98 conditions per place. [2021-03-11 20:27:13,485 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 29 selfloop transitions, 21 changer transitions 1/77 dead transitions. [2021-03-11 20:27:13,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 77 transitions, 807 flow [2021-03-11 20:27:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2021-03-11 20:27:13,488 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2021-03-11 20:27:13,488 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2021-03-11 20:27:13,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2021-03-11 20:27:13,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:13,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2021-03-11 20:27:13,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,494 INFO L185 Difference]: Start difference. First operand has 72 places, 70 transitions, 641 flow. Second operand 6 states and 763 transitions. [2021-03-11 20:27:13,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 77 transitions, 807 flow [2021-03-11 20:27:13,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 743 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-11 20:27:13,504 INFO L241 Difference]: Finished difference. Result has 69 places, 75 transitions, 693 flow [2021-03-11 20:27:13,504 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2021-03-11 20:27:13,504 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2021-03-11 20:27:13,504 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 693 flow [2021-03-11 20:27:13,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:13,505 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:13,505 INFO L255 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-03-11 20:27:13,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:27:13,505 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-03-11 20:27:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -325693191, now seen corresponding path program 2 times [2021-03-11 20:27:13,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:13,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920086812] [2021-03-11 20:27:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:13,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:13,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:13,638 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.4 percent of original size [2021-03-11 20:27:13,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-11 20:27:13,651 INFO L142 QuantifierPusher]: treesize reduction 57, result has 70.0 percent of original size [2021-03-11 20:27:13,655 INFO L147 QuantifierPusher]: treesize reduction 9, result has 93.2 percent of original size 124 [2021-03-11 20:27:13,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-11 20:27:13,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:27:13,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:13,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:27:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:13,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920086812] [2021-03-11 20:27:13,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:13,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:27:13,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474450051] [2021-03-11 20:27:13,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:27:13,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:27:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:27:13,766 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 182 [2021-03-11 20:27:13,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 693 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-03-11 20:27:13,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:13,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 182 [2021-03-11 20:27:13,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:14,074 INFO L129 PetriNetUnfolder]: 151/489 cut-off events. [2021-03-11 20:27:14,075 INFO L130 PetriNetUnfolder]: For 2743/3219 co-relation queries the response was YES. [2021-03-11 20:27:14,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 489 events. 151/489 cut-off events. For 2743/3219 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3670 event pairs, 4 based on Foata normal form. 122/594 useless extension candidates. Maximal degree in co-relation 2111. Up to 120 conditions per place. [2021-03-11 20:27:14,080 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 38 selfloop transitions, 28 changer transitions 9/101 dead transitions. [2021-03-11 20:27:14,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 1128 flow [2021-03-11 20:27:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:27:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:27:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 988 transitions. [2021-03-11 20:27:14,083 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2021-03-11 20:27:14,083 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 988 transitions. [2021-03-11 20:27:14,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 988 transitions. [2021-03-11 20:27:14,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:14,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 988 transitions. [2021-03-11 20:27:14,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.5) internal successors, (988), 8 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,089 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,089 INFO L185 Difference]: Start difference. First operand has 69 places, 75 transitions, 693 flow. Second operand 8 states and 988 transitions. [2021-03-11 20:27:14,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 1128 flow [2021-03-11 20:27:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 101 transitions, 1119 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:14,101 INFO L241 Difference]: Finished difference. Result has 76 places, 84 transitions, 920 flow [2021-03-11 20:27:14,102 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=920, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2021-03-11 20:27:14,102 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2021-03-11 20:27:14,102 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 920 flow [2021-03-11 20:27:14,102 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-03-11 20:27:14,102 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:14,102 INFO L255 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-03-11 20:27:14,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:27:14,103 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-03-11 20:27:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 56076551, now seen corresponding path program 3 times [2021-03-11 20:27:14,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:14,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747800658] [2021-03-11 20:27:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:14,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:14,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:14,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:14,288 INFO L142 QuantifierPusher]: treesize reduction 8, result has 69.2 percent of original size [2021-03-11 20:27:14,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:14,303 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.4 percent of original size [2021-03-11 20:27:14,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-11 20:27:14,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:14,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:14,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747800658] [2021-03-11 20:27:14,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:14,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:27:14,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992367571] [2021-03-11 20:27:14,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:27:14,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:27:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:27:14,366 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 182 [2021-03-11 20:27:14,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 920 flow. Second operand has 9 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:14,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 182 [2021-03-11 20:27:14,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:14,785 INFO L129 PetriNetUnfolder]: 172/565 cut-off events. [2021-03-11 20:27:14,785 INFO L130 PetriNetUnfolder]: For 3961/4794 co-relation queries the response was YES. [2021-03-11 20:27:14,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 565 events. 172/565 cut-off events. For 3961/4794 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 4462 event pairs, 1 based on Foata normal form. 191/733 useless extension candidates. Maximal degree in co-relation 2593. Up to 140 conditions per place. [2021-03-11 20:27:14,792 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 32 selfloop transitions, 36 changer transitions 16/110 dead transitions. [2021-03-11 20:27:14,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 1392 flow [2021-03-11 20:27:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 20:27:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 20:27:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1231 transitions. [2021-03-11 20:27:14,796 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6763736263736264 [2021-03-11 20:27:14,796 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1231 transitions. [2021-03-11 20:27:14,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1231 transitions. [2021-03-11 20:27:14,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:14,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1231 transitions. [2021-03-11 20:27:14,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.1) internal successors, (1231), 10 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,817 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,817 INFO L185 Difference]: Start difference. First operand has 76 places, 84 transitions, 920 flow. Second operand 10 states and 1231 transitions. [2021-03-11 20:27:14,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 1392 flow [2021-03-11 20:27:14,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 110 transitions, 1360 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-11 20:27:14,836 INFO L241 Difference]: Finished difference. Result has 85 places, 86 transitions, 1090 flow [2021-03-11 20:27:14,837 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1090, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2021-03-11 20:27:14,837 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2021-03-11 20:27:14,837 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 1090 flow [2021-03-11 20:27:14,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:14,838 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:14,838 INFO L255 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-03-11 20:27:14,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:27:14,839 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-03-11 20:27:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1960105743, now seen corresponding path program 4 times [2021-03-11 20:27:14,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:14,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735071040] [2021-03-11 20:27:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:14,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:14,943 INFO L142 QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size [2021-03-11 20:27:14,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:14,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:14,963 INFO L142 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size [2021-03-11 20:27:14,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:27:14,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:14,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:14,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:15,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735071040] [2021-03-11 20:27:15,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:15,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:27:15,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925284727] [2021-03-11 20:27:15,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:27:15,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:27:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:27:15,013 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-11 20:27:15,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 1090 flow. Second operand has 8 states, 8 states have (on average 124.375) internal successors, (995), 8 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:15,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-11 20:27:15,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:15,341 INFO L129 PetriNetUnfolder]: 159/519 cut-off events. [2021-03-11 20:27:15,341 INFO L130 PetriNetUnfolder]: For 4254/4930 co-relation queries the response was YES. [2021-03-11 20:27:15,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 519 events. 159/519 cut-off events. For 4254/4930 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 3981 event pairs, 10 based on Foata normal form. 161/656 useless extension candidates. Maximal degree in co-relation 2527. Up to 135 conditions per place. [2021-03-11 20:27:15,347 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 43 selfloop transitions, 28 changer transitions 12/109 dead transitions. [2021-03-11 20:27:15,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 1552 flow [2021-03-11 20:27:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:27:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:27:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1146 transitions. [2021-03-11 20:27:15,351 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6996336996336996 [2021-03-11 20:27:15,352 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1146 transitions. [2021-03-11 20:27:15,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1146 transitions. [2021-03-11 20:27:15,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:15,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1146 transitions. [2021-03-11 20:27:15,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,358 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,358 INFO L185 Difference]: Start difference. First operand has 85 places, 86 transitions, 1090 flow. Second operand 9 states and 1146 transitions. [2021-03-11 20:27:15,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 1552 flow [2021-03-11 20:27:15,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 1327 flow, removed 89 selfloop flow, removed 7 redundant places. [2021-03-11 20:27:15,379 INFO L241 Difference]: Finished difference. Result has 88 places, 95 transitions, 1117 flow [2021-03-11 20:27:15,379 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1117, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2021-03-11 20:27:15,379 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2021-03-11 20:27:15,379 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1117 flow [2021-03-11 20:27:15,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 124.375) internal successors, (995), 8 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,380 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:15,380 INFO L255 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-03-11 20:27:15,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:27:15,380 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-03-11 20:27:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -243687663, now seen corresponding path program 5 times [2021-03-11 20:27:15,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:15,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008647900] [2021-03-11 20:27:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:15,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:15,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:15,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:27:15,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:15,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008647900] [2021-03-11 20:27:15,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:15,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:15,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088779977] [2021-03-11 20:27:15,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:27:15,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:27:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:27:15,527 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182 [2021-03-11 20:27:15,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1117 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-03-11 20:27:15,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:15,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182 [2021-03-11 20:27:15,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:15,808 INFO L129 PetriNetUnfolder]: 175/594 cut-off events. [2021-03-11 20:27:15,809 INFO L130 PetriNetUnfolder]: For 3512/4066 co-relation queries the response was YES. [2021-03-11 20:27:15,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 594 events. 175/594 cut-off events. For 3512/4066 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 4928 event pairs, 10 based on Foata normal form. 144/712 useless extension candidates. Maximal degree in co-relation 2733. Up to 160 conditions per place. [2021-03-11 20:27:15,815 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 42 selfloop transitions, 34 changer transitions 10/112 dead transitions. [2021-03-11 20:27:15,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 112 transitions, 1500 flow [2021-03-11 20:27:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:27:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:27:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2021-03-11 20:27:15,820 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2021-03-11 20:27:15,821 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2021-03-11 20:27:15,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2021-03-11 20:27:15,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:15,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2021-03-11 20:27:15,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,828 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:15,828 INFO L185 Difference]: Start difference. First operand has 88 places, 95 transitions, 1117 flow. Second operand 8 states and 1008 transitions. [2021-03-11 20:27:15,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 112 transitions, 1500 flow [2021-03-11 20:27:15,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 112 transitions, 1406 flow, removed 19 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:15,850 INFO L241 Difference]: Finished difference. Result has 95 places, 95 transitions, 1146 flow [2021-03-11 20:27:15,851 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1146, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2021-03-11 20:27:15,851 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2021-03-11 20:27:15,851 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 1146 flow [2021-03-11 20:27:15,852 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-03-11 20:27:15,852 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:15,852 INFO L255 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-03-11 20:27:15,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 20:27:15,852 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-03-11 20:27:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1833347971, now seen corresponding path program 6 times [2021-03-11 20:27:15,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:15,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791140990] [2021-03-11 20:27:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:15,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:27:15,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-11 20:27:15,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:15,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:15,982 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-11 20:27:15,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:15,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791140990] [2021-03-11 20:27:15,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:15,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:27:15,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647635044] [2021-03-11 20:27:15,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:27:15,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:15,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:27:15,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:27:15,992 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 182 [2021-03-11 20:27:15,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 1146 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-03-11 20:27:15,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:15,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 182 [2021-03-11 20:27:15,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,200 INFO L129 PetriNetUnfolder]: 176/591 cut-off events. [2021-03-11 20:27:16,200 INFO L130 PetriNetUnfolder]: For 3522/3919 co-relation queries the response was YES. [2021-03-11 20:27:16,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 591 events. 176/591 cut-off events. For 3522/3919 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 4827 event pairs, 11 based on Foata normal form. 117/681 useless extension candidates. Maximal degree in co-relation 2820. Up to 155 conditions per place. [2021-03-11 20:27:16,207 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 52 selfloop transitions, 6 changer transitions 27/111 dead transitions. [2021-03-11 20:27:16,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 111 transitions, 1533 flow [2021-03-11 20:27:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2021-03-11 20:27:16,210 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7087912087912088 [2021-03-11 20:27:16,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2021-03-11 20:27:16,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2021-03-11 20:27:16,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2021-03-11 20:27:16,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,214 INFO L185 Difference]: Start difference. First operand has 95 places, 95 transitions, 1146 flow. Second operand 7 states and 903 transitions. [2021-03-11 20:27:16,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 111 transitions, 1533 flow [2021-03-11 20:27:16,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 111 transitions, 1430 flow, removed 32 selfloop flow, removed 5 redundant places. [2021-03-11 20:27:16,235 INFO L241 Difference]: Finished difference. Result has 98 places, 84 transitions, 966 flow [2021-03-11 20:27:16,235 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=966, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2021-03-11 20:27:16,236 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 64 predicate places. [2021-03-11 20:27:16,236 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 966 flow [2021-03-11 20:27:16,236 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-03-11 20:27:16,236 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,236 INFO L255 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-03-11 20:27:16,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 20:27:16,236 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-03-11 20:27:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash -418247809, now seen corresponding path program 7 times [2021-03-11 20:27:16,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810309290] [2021-03-11 20:27:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:16,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:16,343 INFO L142 QuantifierPusher]: treesize reduction 12, result has 81.5 percent of original size [2021-03-11 20:27:16,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-11 20:27:16,412 INFO L142 QuantifierPusher]: treesize reduction 2, result has 86.7 percent of original size [2021-03-11 20:27:16,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:16,423 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.0 percent of original size [2021-03-11 20:27:16,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:16,438 INFO L142 QuantifierPusher]: treesize reduction 28, result has 64.6 percent of original size [2021-03-11 20:27:16,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-11 20:27:16,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:16,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810309290] [2021-03-11 20:27:16,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:27:16,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081462239] [2021-03-11 20:27:16,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:27:16,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:27:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:27:16,495 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 182 [2021-03-11 20:27:16,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 966 flow. Second operand has 9 states, 9 states have (on average 119.22222222222223) internal successors, (1073), 9 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 182 [2021-03-11 20:27:16,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,876 INFO L129 PetriNetUnfolder]: 168/569 cut-off events. [2021-03-11 20:27:16,877 INFO L130 PetriNetUnfolder]: For 3242/3734 co-relation queries the response was YES. [2021-03-11 20:27:16,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 569 events. 168/569 cut-off events. For 3242/3734 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4595 event pairs, 1 based on Foata normal form. 133/670 useless extension candidates. Maximal degree in co-relation 2622. Up to 160 conditions per place. [2021-03-11 20:27:16,883 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 47 selfloop transitions, 37 changer transitions 15/125 dead transitions. [2021-03-11 20:27:16,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 125 transitions, 1724 flow [2021-03-11 20:27:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:27:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:27:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1102 transitions. [2021-03-11 20:27:16,886 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6727716727716728 [2021-03-11 20:27:16,886 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1102 transitions. [2021-03-11 20:27:16,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1102 transitions. [2021-03-11 20:27:16,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1102 transitions. [2021-03-11 20:27:16,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.44444444444444) internal successors, (1102), 9 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,890 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,890 INFO L185 Difference]: Start difference. First operand has 98 places, 84 transitions, 966 flow. Second operand 9 states and 1102 transitions. [2021-03-11 20:27:16,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 125 transitions, 1724 flow [2021-03-11 20:27:16,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 1632 flow, removed 40 selfloop flow, removed 7 redundant places. [2021-03-11 20:27:16,914 INFO L241 Difference]: Finished difference. Result has 99 places, 104 transitions, 1366 flow [2021-03-11 20:27:16,914 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1366, PETRI_PLACES=99, PETRI_TRANSITIONS=104} [2021-03-11 20:27:16,914 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2021-03-11 20:27:16,914 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 1366 flow [2021-03-11 20:27:16,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 119.22222222222223) internal successors, (1073), 9 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:16,915 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,915 INFO L255 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-03-11 20:27:16,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 20:27:16,915 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-03-11 20:27:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1806989557, now seen corresponding path program 8 times [2021-03-11 20:27:16,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213954452] [2021-03-11 20:27:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:17,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:17,025 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.9 percent of original size [2021-03-11 20:27:17,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:17,036 INFO L142 QuantifierPusher]: treesize reduction 31, result has 61.3 percent of original size [2021-03-11 20:27:17,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-11 20:27:17,075 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-11 20:27:17,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 20:27:17,100 INFO L142 QuantifierPusher]: treesize reduction 29, result has 75.2 percent of original size [2021-03-11 20:27:17,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-03-11 20:27:17,161 INFO L142 QuantifierPusher]: treesize reduction 10, result has 73.0 percent of original size [2021-03-11 20:27:17,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:27:17,191 INFO L142 QuantifierPusher]: treesize reduction 10, result has 77.8 percent of original size [2021-03-11 20:27:17,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-11 20:27:17,232 INFO L142 QuantifierPusher]: treesize reduction 10, result has 73.7 percent of original size [2021-03-11 20:27:17,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 20:27:17,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-03-11 20:27:17,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213954452] [2021-03-11 20:27:17,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:17,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 20:27:17,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11926943] [2021-03-11 20:27:17,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 20:27:17,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:17,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 20:27:17,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-11 20:27:17,266 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 182 [2021-03-11 20:27:17,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 1366 flow. Second operand has 10 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:17,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:17,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 182 [2021-03-11 20:27:17,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:18,087 INFO L129 PetriNetUnfolder]: 162/544 cut-off events. [2021-03-11 20:27:18,087 INFO L130 PetriNetUnfolder]: For 3355/3793 co-relation queries the response was YES. [2021-03-11 20:27:18,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 544 events. 162/544 cut-off events. For 3355/3793 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 4285 event pairs, 1 based on Foata normal form. 145/661 useless extension candidates. Maximal degree in co-relation 2596. Up to 155 conditions per place. [2021-03-11 20:27:18,095 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 18 selfloop transitions, 55 changer transitions 27/126 dead transitions. [2021-03-11 20:27:18,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 126 transitions, 1802 flow [2021-03-11 20:27:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 20:27:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-11 20:27:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1440 transitions. [2021-03-11 20:27:18,104 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6593406593406593 [2021-03-11 20:27:18,104 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1440 transitions. [2021-03-11 20:27:18,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1440 transitions. [2021-03-11 20:27:18,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:18,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1440 transitions. [2021-03-11 20:27:18,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 182.0) internal successors, (2366), 13 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,115 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 182.0) internal successors, (2366), 13 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,115 INFO L185 Difference]: Start difference. First operand has 99 places, 104 transitions, 1366 flow. Second operand 12 states and 1440 transitions. [2021-03-11 20:27:18,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 126 transitions, 1802 flow [2021-03-11 20:27:18,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 126 transitions, 1763 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:18,139 INFO L241 Difference]: Finished difference. Result has 109 places, 95 transitions, 1286 flow [2021-03-11 20:27:18,139 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1286, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2021-03-11 20:27:18,139 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 75 predicate places. [2021-03-11 20:27:18,139 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 1286 flow [2021-03-11 20:27:18,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,140 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:18,140 INFO L255 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-03-11 20:27:18,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-11 20:27:18,140 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-03-11 20:27:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:18,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1298561955, now seen corresponding path program 9 times [2021-03-11 20:27:18,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:18,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951322599] [2021-03-11 20:27:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:18,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:18,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:18,253 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.5 percent of original size [2021-03-11 20:27:18,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-11 20:27:18,286 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.1 percent of original size [2021-03-11 20:27:18,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-11 20:27:18,323 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-03-11 20:27:18,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-11 20:27:18,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:18,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 20:27:18,380 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size [2021-03-11 20:27:18,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:18,395 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-03-11 20:27:18,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:27:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:18,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951322599] [2021-03-11 20:27:18,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:18,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:27:18,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100359681] [2021-03-11 20:27:18,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:27:18,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:27:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:27:18,409 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 182 [2021-03-11 20:27:18,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 1286 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-03-11 20:27:18,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:18,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 182 [2021-03-11 20:27:18,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:18,830 INFO L129 PetriNetUnfolder]: 164/551 cut-off events. [2021-03-11 20:27:18,830 INFO L130 PetriNetUnfolder]: For 3153/3397 co-relation queries the response was YES. [2021-03-11 20:27:18,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 551 events. 164/551 cut-off events. For 3153/3397 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 4418 event pairs, 0 based on Foata normal form. 100/623 useless extension candidates. Maximal degree in co-relation 2644. Up to 165 conditions per place. [2021-03-11 20:27:18,837 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 40 selfloop transitions, 40 changer transitions 11/117 dead transitions. [2021-03-11 20:27:18,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 117 transitions, 1752 flow [2021-03-11 20:27:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 20:27:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 20:27:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1201 transitions. [2021-03-11 20:27:18,840 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6598901098901099 [2021-03-11 20:27:18,840 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1201 transitions. [2021-03-11 20:27:18,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1201 transitions. [2021-03-11 20:27:18,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:18,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1201 transitions. [2021-03-11 20:27:18,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.1) internal successors, (1201), 10 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,844 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:18,844 INFO L185 Difference]: Start difference. First operand has 109 places, 95 transitions, 1286 flow. Second operand 10 states and 1201 transitions. [2021-03-11 20:27:18,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 117 transitions, 1752 flow [2021-03-11 20:27:18,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 1606 flow, removed 33 selfloop flow, removed 12 redundant places. [2021-03-11 20:27:18,869 INFO L241 Difference]: Finished difference. Result has 107 places, 95 transitions, 1301 flow [2021-03-11 20:27:18,869 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1301, PETRI_PLACES=107, PETRI_TRANSITIONS=95} [2021-03-11 20:27:18,870 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 73 predicate places. [2021-03-11 20:27:18,870 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 1301 flow [2021-03-11 20:27:18,870 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-03-11 20:27:18,870 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:18,870 INFO L255 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-03-11 20:27:18,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-11 20:27:18,870 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-03-11 20:27:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1273280117, now seen corresponding path program 10 times [2021-03-11 20:27:18,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:18,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134787390] [2021-03-11 20:27:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:18,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:18,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:19,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:19,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:19,022 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-03-11 20:27:19,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-11 20:27:19,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:19,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134787390] [2021-03-11 20:27:19,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:19,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:27:19,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305859920] [2021-03-11 20:27:19,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:27:19,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:27:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:27:19,059 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-11 20:27:19,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 1301 flow. Second operand has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:19,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-11 20:27:19,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:19,219 INFO L129 PetriNetUnfolder]: 144/484 cut-off events. [2021-03-11 20:27:19,219 INFO L130 PetriNetUnfolder]: For 3260/3411 co-relation queries the response was YES. [2021-03-11 20:27:19,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 484 events. 144/484 cut-off events. For 3260/3411 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 3720 event pairs, 5 based on Foata normal form. 54/514 useless extension candidates. Maximal degree in co-relation 2355. Up to 140 conditions per place. [2021-03-11 20:27:19,226 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 52 selfloop transitions, 2 changer transitions 24/104 dead transitions. [2021-03-11 20:27:19,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 1554 flow [2021-03-11 20:27:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2021-03-11 20:27:19,229 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.695054945054945 [2021-03-11 20:27:19,229 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2021-03-11 20:27:19,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2021-03-11 20:27:19,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:19,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2021-03-11 20:27:19,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,233 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,233 INFO L185 Difference]: Start difference. First operand has 107 places, 95 transitions, 1301 flow. Second operand 6 states and 759 transitions. [2021-03-11 20:27:19,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 1554 flow [2021-03-11 20:27:19,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 1334 flow, removed 38 selfloop flow, removed 12 redundant places. [2021-03-11 20:27:19,255 INFO L241 Difference]: Finished difference. Result has 101 places, 80 transitions, 889 flow [2021-03-11 20:27:19,255 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=889, PETRI_PLACES=101, PETRI_TRANSITIONS=80} [2021-03-11 20:27:19,255 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2021-03-11 20:27:19,256 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 80 transitions, 889 flow [2021-03-11 20:27:19,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,256 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:19,256 INFO L255 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-03-11 20:27:19,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-11 20:27:19,256 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-03-11 20:27:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:19,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1079103619, now seen corresponding path program 11 times [2021-03-11 20:27:19,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:19,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820130702] [2021-03-11 20:27:19,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:19,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:19,345 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 20:27:19,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 20:27:19,364 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-11 20:27:19,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-11 20:27:19,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:19,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:19,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820130702] [2021-03-11 20:27:19,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:19,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:27:19,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883116457] [2021-03-11 20:27:19,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:27:19,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:27:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:27:19,409 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-03-11 20:27:19,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 80 transitions, 889 flow. Second operand has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:19,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-03-11 20:27:19,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:19,658 INFO L129 PetriNetUnfolder]: 152/505 cut-off events. [2021-03-11 20:27:19,659 INFO L130 PetriNetUnfolder]: For 2603/2791 co-relation queries the response was YES. [2021-03-11 20:27:19,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 505 events. 152/505 cut-off events. For 2603/2791 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3893 event pairs, 1 based on Foata normal form. 60/537 useless extension candidates. Maximal degree in co-relation 2191. Up to 155 conditions per place. [2021-03-11 20:27:19,664 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 33 selfloop transitions, 14 changer transitions 31/104 dead transitions. [2021-03-11 20:27:19,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 104 transitions, 1289 flow [2021-03-11 20:27:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2021-03-11 20:27:19,666 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6985871271585558 [2021-03-11 20:27:19,666 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2021-03-11 20:27:19,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2021-03-11 20:27:19,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:19,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2021-03-11 20:27:19,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,670 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,670 INFO L185 Difference]: Start difference. First operand has 101 places, 80 transitions, 889 flow. Second operand 7 states and 890 transitions. [2021-03-11 20:27:19,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 104 transitions, 1289 flow [2021-03-11 20:27:19,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 1201 flow, removed 17 selfloop flow, removed 8 redundant places. [2021-03-11 20:27:19,687 INFO L241 Difference]: Finished difference. Result has 93 places, 67 transitions, 661 flow [2021-03-11 20:27:19,688 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=661, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2021-03-11 20:27:19,688 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 59 predicate places. [2021-03-11 20:27:19,688 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 661 flow [2021-03-11 20:27:19,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,688 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:19,688 INFO L255 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-03-11 20:27:19,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-11 20:27:19,688 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-03-11 20:27:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -498465655, now seen corresponding path program 12 times [2021-03-11 20:27:19,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:19,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391747437] [2021-03-11 20:27:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:19,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:19,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:19,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:19,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:27:19,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:19,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-11 20:27:19,838 INFO L142 QuantifierPusher]: treesize reduction 31, result has 79.9 percent of original size [2021-03-11 20:27:19,839 INFO L147 QuantifierPusher]: treesize reduction 9, result has 92.7 percent of original size 114 [2021-03-11 20:27:19,914 INFO L142 QuantifierPusher]: treesize reduction 11, result has 62.1 percent of original size [2021-03-11 20:27:19,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:19,928 INFO L142 QuantifierPusher]: treesize reduction 11, result has 62.1 percent of original size [2021-03-11 20:27:19,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:27:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:19,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391747437] [2021-03-11 20:27:19,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:19,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:27:19,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095356661] [2021-03-11 20:27:19,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:27:19,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:19,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:27:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:27:19,931 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182 [2021-03-11 20:27:19,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 661 flow. Second operand has 8 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:19,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:19,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182 [2021-03-11 20:27:19,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:20,152 INFO L129 PetriNetUnfolder]: 124/416 cut-off events. [2021-03-11 20:27:20,152 INFO L130 PetriNetUnfolder]: For 2286/2449 co-relation queries the response was YES. [2021-03-11 20:27:20,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 416 events. 124/416 cut-off events. For 2286/2449 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 2982 event pairs, 0 based on Foata normal form. 47/434 useless extension candidates. Maximal degree in co-relation 1750. Up to 140 conditions per place. [2021-03-11 20:27:20,156 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 24 selfloop transitions, 22 changer transitions 10/82 dead transitions. [2021-03-11 20:27:20,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 82 transitions, 976 flow [2021-03-11 20:27:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2021-03-11 20:27:20,158 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6813186813186813 [2021-03-11 20:27:20,158 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2021-03-11 20:27:20,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2021-03-11 20:27:20,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:20,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2021-03-11 20:27:20,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 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-03-11 20:27:20,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,161 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,161 INFO L185 Difference]: Start difference. First operand has 93 places, 67 transitions, 661 flow. Second operand 6 states and 744 transitions. [2021-03-11 20:27:20,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 82 transitions, 976 flow [2021-03-11 20:27:20,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 881 flow, removed 21 selfloop flow, removed 12 redundant places. [2021-03-11 20:27:20,173 INFO L241 Difference]: Finished difference. Result has 86 places, 70 transitions, 713 flow [2021-03-11 20:27:20,173 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2021-03-11 20:27:20,173 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2021-03-11 20:27:20,173 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 713 flow [2021-03-11 20:27:20,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:20,174 INFO L255 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-03-11 20:27:20,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-11 20:27:20,174 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1423210351, now seen corresponding path program 13 times [2021-03-11 20:27:20,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:20,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679649930] [2021-03-11 20:27:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:20,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:20,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:20,241 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-11 20:27:20,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:27:20,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:20,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:27:20,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:20,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:27:20,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679649930] [2021-03-11 20:27:20,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:20,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:20,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021657289] [2021-03-11 20:27:20,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:27:20,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:27:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:27:20,269 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 182 [2021-03-11 20:27:20,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:20,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 182 [2021-03-11 20:27:20,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:20,422 INFO L129 PetriNetUnfolder]: 135/460 cut-off events. [2021-03-11 20:27:20,423 INFO L130 PetriNetUnfolder]: For 1920/2077 co-relation queries the response was YES. [2021-03-11 20:27:20,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 460 events. 135/460 cut-off events. For 1920/2077 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 3462 event pairs, 0 based on Foata normal form. 49/476 useless extension candidates. Maximal degree in co-relation 1908. Up to 165 conditions per place. [2021-03-11 20:27:20,427 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 31 selfloop transitions, 9 changer transitions 13/79 dead transitions. [2021-03-11 20:27:20,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 79 transitions, 915 flow [2021-03-11 20:27:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2021-03-11 20:27:20,429 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7009419152276295 [2021-03-11 20:27:20,429 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2021-03-11 20:27:20,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2021-03-11 20:27:20,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:20,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2021-03-11 20:27:20,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 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-03-11 20:27:20,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,432 INFO L185 Difference]: Start difference. First operand has 86 places, 70 transitions, 713 flow. Second operand 7 states and 893 transitions. [2021-03-11 20:27:20,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 79 transitions, 915 flow [2021-03-11 20:27:20,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 79 transitions, 898 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:20,446 INFO L241 Difference]: Finished difference. Result has 90 places, 66 transitions, 667 flow [2021-03-11 20:27:20,446 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=667, PETRI_PLACES=90, PETRI_TRANSITIONS=66} [2021-03-11 20:27:20,446 INFO L335 CegarLoopForPetriNet]: 34 programPoint places, 56 predicate places. [2021-03-11 20:27:20,446 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 66 transitions, 667 flow [2021-03-11 20:27:20,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:27:20,447 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:20,447 INFO L255 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-03-11 20:27:20,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-11 20:27:20,447 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash 957062495, now seen corresponding path program 14 times [2021-03-11 20:27:20,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:20,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451582907] [2021-03-11 20:27:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:27:20,505 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:27:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:27:20,568 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:27:20,610 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:27:20,610 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:27:20,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-11 20:27:20,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:27:20 BasicIcfg [2021-03-11 20:27:20,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:27:20,705 INFO L168 Benchmark]: Toolchain (without parser) took 28814.35 ms. Allocated memory was 394.3 MB in the beginning and 1.1 GB in the end (delta: 704.6 MB). Free memory was 357.4 MB in the beginning and 574.9 MB in the end (delta: -217.4 MB). Peak memory consumption was 489.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:20,705 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 394.3 MB. Free memory was 375.8 MB in the beginning and 375.8 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:27:20,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.63 ms. Allocated memory is still 394.3 MB. Free memory was 356.8 MB in the beginning and 349.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:20,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.10 ms. Allocated memory is still 394.3 MB. Free memory was 349.9 MB in the beginning and 346.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:20,706 INFO L168 Benchmark]: Boogie Preprocessor took 79.56 ms. Allocated memory is still 394.3 MB. Free memory was 346.8 MB in the beginning and 343.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:20,706 INFO L168 Benchmark]: RCFGBuilder took 2824.64 ms. Allocated memory was 394.3 MB in the beginning and 528.5 MB in the end (delta: 134.2 MB). Free memory was 343.6 MB in the beginning and 345.1 MB in the end (delta: -1.4 MB). Peak memory consumption was 157.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:20,706 INFO L168 Benchmark]: TraceAbstraction took 25281.10 ms. Allocated memory was 528.5 MB in the beginning and 1.1 GB in the end (delta: 570.4 MB). Free memory was 344.0 MB in the beginning and 574.9 MB in the end (delta: -230.8 MB). Peak memory consumption was 339.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:20,707 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.30 ms. Allocated memory is still 394.3 MB. Free memory was 375.8 MB in the beginning and 375.8 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 556.63 ms. Allocated memory is still 394.3 MB. Free memory was 356.8 MB in the beginning and 349.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.10 ms. Allocated memory is still 394.3 MB. Free memory was 349.9 MB in the beginning and 346.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 79.56 ms. Allocated memory is still 394.3 MB. Free memory was 346.8 MB in the beginning and 343.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2824.64 ms. Allocated memory was 394.3 MB in the beginning and 528.5 MB in the end (delta: 134.2 MB). Free memory was 343.6 MB in the beginning and 345.1 MB in the end (delta: -1.4 MB). Peak memory consumption was 157.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25281.10 ms. Allocated memory was 528.5 MB in the beginning and 1.1 GB in the end (delta: 570.4 MB). Free memory was 344.0 MB in the beginning and 574.9 MB in the end (delta: -230.8 MB). Peak memory consumption was 339.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13234.5ms, 104 PlacesBefore, 34 PlacesAfterwards, 96 TransitionsBefore, 25 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 5207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1830, positive: 1638, positive conditional: 0, positive unconditional: 1638, negative: 192, negative conditional: 0, negative unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1109, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1109, positive: 1041, positive conditional: 0, positive unconditional: 1041, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 724, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 659, negative conditional: 0, negative unconditional: 659, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1830, positive: 571, positive conditional: 0, positive unconditional: 571, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 1109, unknown conditional: 0, unknown unconditional: 1109] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - 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 t2336; [L855] FCALL, FORK 0 pthread_create(&t2336, ((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 t2337; [L857] FCALL, FORK 0 pthread_create(&t2337, ((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 t2338; [L859] FCALL, FORK 0 pthread_create(&t2338, ((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=52, 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] [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 [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=52, 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 [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] EXPR 1 !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] 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] EXPR 1 !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] 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] EXPR 1 !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] 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] EXPR 1 !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] 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] EXPR 1 !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] 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] EXPR 1 !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] 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=0, 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] [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; [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 [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.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25066.4ms, OverallIterations: 26, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6650.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13299.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 125 SDtfs, 96 SDslu, 79 SDs, 0 SdLazy, 1471 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2212.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3156.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1366occurred in iteration=19, InterpolantAutomatonStates: 167, 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: 102.7ms SsaConstructionTime, 1110.5ms SatisfiabilityAnalysisTime, 3486.5ms InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 5083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...