/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:40:50,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:40:50,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:40:50,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:40:50,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:40:50,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:40:50,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:40:50,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:40:50,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:40:50,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:40:50,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:40:50,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:40:50,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:40:50,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:40:50,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:40:50,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:40:50,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:40:50,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:40:50,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:40:50,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:40:50,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:40:50,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:40:50,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:40:50,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:40:50,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:40:50,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:40:50,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:40:50,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:40:50,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:40:50,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:40:50,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:40:50,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:40:50,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:40:50,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:40:50,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:40:50,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:40:50,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:40:50,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:40:50,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:40:50,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:40:50,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:40:50,522 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-NoLbe.epf [2022-01-19 00:40:50,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:40:50,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:40:50,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:40:50,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:40:50,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:40:50,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:40:50,551 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:40:50,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:40:50,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:40:50,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:40:50,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:40:50,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:40:50,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:40:50,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:40:50,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:40:50,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:40:50,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:40:50,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:40:50,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:40:50,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:40:50,555 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:40:50,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:40:50,555 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 [2022-01-19 00:40:50,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:40:50,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:40:50,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:40:50,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:40:50,774 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:40:50,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-symm.wvr.c [2022-01-19 00:40:50,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796fe8688/7b69b8efe93f4259b8de1f5cb60457ce/FLAG37e42ce18 [2022-01-19 00:40:51,181 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:40:51,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-symm.wvr.c [2022-01-19 00:40:51,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796fe8688/7b69b8efe93f4259b8de1f5cb60457ce/FLAG37e42ce18 [2022-01-19 00:40:51,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796fe8688/7b69b8efe93f4259b8de1f5cb60457ce [2022-01-19 00:40:51,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:40:51,211 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:40:51,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:40:51,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:40:51,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:40:51,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4144c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51, skipping insertion in model container [2022-01-19 00:40:51,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:40:51,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:40:51,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-symm.wvr.c[2584,2597] [2022-01-19 00:40:51,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:40:51,414 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:40:51,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-symm.wvr.c[2584,2597] [2022-01-19 00:40:51,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:40:51,455 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:40:51,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51 WrapperNode [2022-01-19 00:40:51,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:40:51,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:40:51,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:40:51,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:40:51,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,501 INFO L137 Inliner]: procedures = 22, calls = 27, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 180 [2022-01-19 00:40:51,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:40:51,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:40:51,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:40:51,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:40:51,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:40:51,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:40:51,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:40:51,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:40:51,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (1/1) ... [2022-01-19 00:40:51,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:40:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:40:51,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:40:51,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:40:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:40:51,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:40:51,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:40:51,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:40:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:40:51,569 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:40:51,639 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:40:51,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:40:51,860 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:40:51,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:40:51,867 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 00:40:51,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:40:51 BoogieIcfgContainer [2022-01-19 00:40:51,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:40:51,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:40:51,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:40:51,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:40:51,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:40:51" (1/3) ... [2022-01-19 00:40:51,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f35e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:40:51, skipping insertion in model container [2022-01-19 00:40:51,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:51" (2/3) ... [2022-01-19 00:40:51,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f35e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:40:51, skipping insertion in model container [2022-01-19 00:40:51,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:40:51" (3/3) ... [2022-01-19 00:40:51,874 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2022-01-19 00:40:51,877 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:40:51,877 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:40:51,877 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:40:51,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,909 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,910 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,911 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,912 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,915 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,916 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,916 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,916 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,916 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,916 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,917 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,918 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,919 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,920 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,920 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,920 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,920 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,920 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,924 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,939 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,940 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,941 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,942 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,943 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,944 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,945 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,946 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:51,988 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 00:40:52,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:40:52,036 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:40:52,036 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 00:40:52,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 240 places, 252 transitions, 520 flow [2022-01-19 00:40:52,112 INFO L129 PetriNetUnfolder]: 19/250 cut-off events. [2022-01-19 00:40:52,112 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:40:52,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 250 events. 19/250 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 273 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 169. Up to 2 conditions per place. [2022-01-19 00:40:52,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 252 transitions, 520 flow [2022-01-19 00:40:52,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 241 transitions, 494 flow [2022-01-19 00:40:52,185 INFO L129 PetriNetUnfolder]: 19/240 cut-off events. [2022-01-19 00:40:52,186 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:40:52,186 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:52,186 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:52,187 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash -511755063, now seen corresponding path program 1 times [2022-01-19 00:40:52,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:52,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013527955] [2022-01-19 00:40:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:52,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:52,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:52,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013527955] [2022-01-19 00:40:52,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013527955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:52,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:52,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:40:52,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559893691] [2022-01-19 00:40:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:52,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:40:52,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:40:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:40:52,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 252 [2022-01-19 00:40:52,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 241 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:52,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:52,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 252 [2022-01-19 00:40:52,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:52,642 INFO L129 PetriNetUnfolder]: 48/614 cut-off events. [2022-01-19 00:40:52,642 INFO L130 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-01-19 00:40:52,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 614 events. 48/614 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2775 event pairs, 15 based on Foata normal form. 44/596 useless extension candidates. Maximal degree in co-relation 531. Up to 49 conditions per place. [2022-01-19 00:40:52,649 INFO L132 encePairwiseOnDemand]: 235/252 looper letters, 21 selfloop transitions, 2 changer transitions 3/237 dead transitions. [2022-01-19 00:40:52,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 237 transitions, 541 flow [2022-01-19 00:40:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:40:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:40:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2022-01-19 00:40:52,664 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9537037037037037 [2022-01-19 00:40:52,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 721 transitions. [2022-01-19 00:40:52,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 721 transitions. [2022-01-19 00:40:52,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:52,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 721 transitions. [2022-01-19 00:40:52,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:52,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:40:52,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:40:52,681 INFO L186 Difference]: Start difference. First operand has 229 places, 241 transitions, 494 flow. Second operand 3 states and 721 transitions. [2022-01-19 00:40:52,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 237 transitions, 541 flow [2022-01-19 00:40:52,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 237 transitions, 527 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 00:40:52,690 INFO L242 Difference]: Finished difference. Result has 229 places, 229 transitions, 482 flow [2022-01-19 00:40:52,692 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=229, PETRI_TRANSITIONS=229} [2022-01-19 00:40:52,695 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2022-01-19 00:40:52,695 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 229 transitions, 482 flow [2022-01-19 00:40:52,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:52,696 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:52,696 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:52,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:40:52,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 380510321, now seen corresponding path program 2 times [2022-01-19 00:40:52,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:52,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462122597] [2022-01-19 00:40:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:52,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:52,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462122597] [2022-01-19 00:40:52,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462122597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:52,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:52,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:40:52,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30565958] [2022-01-19 00:40:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:52,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:40:52,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:40:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:40:52,827 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 252 [2022-01-19 00:40:52,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 229 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:52,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:52,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 252 [2022-01-19 00:40:52,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:52,910 INFO L129 PetriNetUnfolder]: 45/636 cut-off events. [2022-01-19 00:40:52,910 INFO L130 PetriNetUnfolder]: For 57/74 co-relation queries the response was YES. [2022-01-19 00:40:52,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 636 events. 45/636 cut-off events. For 57/74 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2807 event pairs, 14 based on Foata normal form. 6/602 useless extension candidates. Maximal degree in co-relation 579. Up to 51 conditions per place. [2022-01-19 00:40:52,913 INFO L132 encePairwiseOnDemand]: 246/252 looper letters, 23 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2022-01-19 00:40:52,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 236 transitions, 557 flow [2022-01-19 00:40:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:40:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:40:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2022-01-19 00:40:52,915 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9246031746031746 [2022-01-19 00:40:52,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2022-01-19 00:40:52,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2022-01-19 00:40:52,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:52,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2022-01-19 00:40:52,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:52,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:40:52,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:40:52,919 INFO L186 Difference]: Start difference. First operand has 229 places, 229 transitions, 482 flow. Second operand 3 states and 699 transitions. [2022-01-19 00:40:52,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 236 transitions, 557 flow [2022-01-19 00:40:52,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 236 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:52,928 INFO L242 Difference]: Finished difference. Result has 229 places, 231 transitions, 508 flow [2022-01-19 00:40:52,928 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=229, PETRI_TRANSITIONS=231} [2022-01-19 00:40:52,929 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2022-01-19 00:40:52,929 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 231 transitions, 508 flow [2022-01-19 00:40:52,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:52,929 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:52,929 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:52,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:40:52,930 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1238472305, now seen corresponding path program 1 times [2022-01-19 00:40:52,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:52,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504963132] [2022-01-19 00:40:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:52,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:53,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504963132] [2022-01-19 00:40:53,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504963132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:53,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:53,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:53,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075437389] [2022-01-19 00:40:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:53,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:53,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:53,137 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:53,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 231 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:53,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:53,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:53,442 INFO L129 PetriNetUnfolder]: 137/955 cut-off events. [2022-01-19 00:40:53,443 INFO L130 PetriNetUnfolder]: For 47/55 co-relation queries the response was YES. [2022-01-19 00:40:53,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 955 events. 137/955 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5264 event pairs, 73 based on Foata normal form. 1/886 useless extension candidates. Maximal degree in co-relation 996. Up to 229 conditions per place. [2022-01-19 00:40:53,448 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 61 selfloop transitions, 5 changer transitions 29/297 dead transitions. [2022-01-19 00:40:53,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 297 transitions, 841 flow [2022-01-19 00:40:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:40:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:40:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3840 transitions. [2022-01-19 00:40:53,454 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8465608465608465 [2022-01-19 00:40:53,454 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3840 transitions. [2022-01-19 00:40:53,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3840 transitions. [2022-01-19 00:40:53,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:53,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3840 transitions. [2022-01-19 00:40:53,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 213.33333333333334) internal successors, (3840), 18 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 252.0) internal successors, (4788), 19 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,468 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 252.0) internal successors, (4788), 19 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,468 INFO L186 Difference]: Start difference. First operand has 229 places, 231 transitions, 508 flow. Second operand 18 states and 3840 transitions. [2022-01-19 00:40:53,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 297 transitions, 841 flow [2022-01-19 00:40:53,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 297 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:53,473 INFO L242 Difference]: Finished difference. Result has 261 places, 235 transitions, 577 flow [2022-01-19 00:40:53,473 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=577, PETRI_PLACES=261, PETRI_TRANSITIONS=235} [2022-01-19 00:40:53,475 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 32 predicate places. [2022-01-19 00:40:53,475 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 235 transitions, 577 flow [2022-01-19 00:40:53,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:53,477 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:53,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:40:53,477 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1372404625, now seen corresponding path program 2 times [2022-01-19 00:40:53,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:53,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131250000] [2022-01-19 00:40:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:53,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:53,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:53,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131250000] [2022-01-19 00:40:53,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131250000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:53,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:53,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:53,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990584991] [2022-01-19 00:40:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:53,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:53,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:53,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:53,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 235 transitions, 577 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:53,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:53,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:53,888 INFO L129 PetriNetUnfolder]: 141/1094 cut-off events. [2022-01-19 00:40:53,889 INFO L130 PetriNetUnfolder]: For 696/729 co-relation queries the response was YES. [2022-01-19 00:40:53,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1094 events. 141/1094 cut-off events. For 696/729 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6436 event pairs, 78 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 2015. Up to 248 conditions per place. [2022-01-19 00:40:53,895 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 76 selfloop transitions, 3 changer transitions 25/306 dead transitions. [2022-01-19 00:40:53,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 306 transitions, 1135 flow [2022-01-19 00:40:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:40:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:40:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3625 transitions. [2022-01-19 00:40:53,900 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.846171802054155 [2022-01-19 00:40:53,901 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3625 transitions. [2022-01-19 00:40:53,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3625 transitions. [2022-01-19 00:40:53,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:53,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3625 transitions. [2022-01-19 00:40:53,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 213.23529411764707) internal successors, (3625), 17 states have internal predecessors, (3625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 252.0) internal successors, (4536), 18 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,911 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 252.0) internal successors, (4536), 18 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,911 INFO L186 Difference]: Start difference. First operand has 261 places, 235 transitions, 577 flow. Second operand 17 states and 3625 transitions. [2022-01-19 00:40:53,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 306 transitions, 1135 flow [2022-01-19 00:40:53,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 306 transitions, 1081 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-01-19 00:40:53,919 INFO L242 Difference]: Finished difference. Result has 273 places, 237 transitions, 625 flow [2022-01-19 00:40:53,919 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=625, PETRI_PLACES=273, PETRI_TRANSITIONS=237} [2022-01-19 00:40:53,919 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 44 predicate places. [2022-01-19 00:40:53,919 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 237 transitions, 625 flow [2022-01-19 00:40:53,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,920 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:53,920 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:53,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:40:53,920 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash -643239263, now seen corresponding path program 1 times [2022-01-19 00:40:53,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:53,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409024170] [2022-01-19 00:40:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:53,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:54,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:54,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409024170] [2022-01-19 00:40:54,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409024170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:54,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:54,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:54,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880895192] [2022-01-19 00:40:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:54,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:54,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:54,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:54,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:54,014 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:54,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 237 transitions, 625 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:54,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:54,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:54,235 INFO L129 PetriNetUnfolder]: 172/1140 cut-off events. [2022-01-19 00:40:54,235 INFO L130 PetriNetUnfolder]: For 1959/1990 co-relation queries the response was YES. [2022-01-19 00:40:54,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1140 events. 172/1140 cut-off events. For 1959/1990 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6796 event pairs, 116 based on Foata normal form. 5/1060 useless extension candidates. Maximal degree in co-relation 2463. Up to 356 conditions per place. [2022-01-19 00:40:54,243 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 43 selfloop transitions, 12 changer transitions 15/273 dead transitions. [2022-01-19 00:40:54,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 273 transitions, 1010 flow [2022-01-19 00:40:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:40:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:40:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2978 transitions. [2022-01-19 00:40:54,247 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8441043083900227 [2022-01-19 00:40:54,247 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2978 transitions. [2022-01-19 00:40:54,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2978 transitions. [2022-01-19 00:40:54,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:54,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2978 transitions. [2022-01-19 00:40:54,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 212.71428571428572) internal successors, (2978), 14 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,258 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,258 INFO L186 Difference]: Start difference. First operand has 273 places, 237 transitions, 625 flow. Second operand 14 states and 2978 transitions. [2022-01-19 00:40:54,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 273 transitions, 1010 flow [2022-01-19 00:40:54,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 273 transitions, 981 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-01-19 00:40:54,267 INFO L242 Difference]: Finished difference. Result has 274 places, 249 transitions, 783 flow [2022-01-19 00:40:54,267 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=783, PETRI_PLACES=274, PETRI_TRANSITIONS=249} [2022-01-19 00:40:54,269 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 45 predicate places. [2022-01-19 00:40:54,269 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 249 transitions, 783 flow [2022-01-19 00:40:54,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:54,270 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:54,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:40:54,270 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1959989899, now seen corresponding path program 2 times [2022-01-19 00:40:54,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:54,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280477451] [2022-01-19 00:40:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:54,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:54,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:54,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280477451] [2022-01-19 00:40:54,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280477451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:54,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:54,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:54,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144730222] [2022-01-19 00:40:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:54,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:54,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:54,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:54,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 249 transitions, 783 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:54,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:54,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:54,695 INFO L129 PetriNetUnfolder]: 177/1171 cut-off events. [2022-01-19 00:40:54,695 INFO L130 PetriNetUnfolder]: For 2373/2412 co-relation queries the response was YES. [2022-01-19 00:40:54,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 1171 events. 177/1171 cut-off events. For 2373/2412 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7352 event pairs, 114 based on Foata normal form. 7/1097 useless extension candidates. Maximal degree in co-relation 2770. Up to 333 conditions per place. [2022-01-19 00:40:54,702 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 74 selfloop transitions, 7 changer transitions 24/308 dead transitions. [2022-01-19 00:40:54,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 308 transitions, 1361 flow [2022-01-19 00:40:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:40:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:40:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3625 transitions. [2022-01-19 00:40:54,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.846171802054155 [2022-01-19 00:40:54,708 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3625 transitions. [2022-01-19 00:40:54,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3625 transitions. [2022-01-19 00:40:54,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:54,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3625 transitions. [2022-01-19 00:40:54,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 213.23529411764707) internal successors, (3625), 17 states have internal predecessors, (3625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 252.0) internal successors, (4536), 18 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,727 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 252.0) internal successors, (4536), 18 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,727 INFO L186 Difference]: Start difference. First operand has 274 places, 249 transitions, 783 flow. Second operand 17 states and 3625 transitions. [2022-01-19 00:40:54,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 308 transitions, 1361 flow [2022-01-19 00:40:54,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 308 transitions, 1193 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-01-19 00:40:54,742 INFO L242 Difference]: Finished difference. Result has 293 places, 250 transitions, 760 flow [2022-01-19 00:40:54,742 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=760, PETRI_PLACES=293, PETRI_TRANSITIONS=250} [2022-01-19 00:40:54,744 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 64 predicate places. [2022-01-19 00:40:54,744 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 250 transitions, 760 flow [2022-01-19 00:40:54,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,745 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:54,745 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:54,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:40:54,745 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -866227707, now seen corresponding path program 3 times [2022-01-19 00:40:54,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:54,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418112915] [2022-01-19 00:40:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:54,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:54,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:54,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418112915] [2022-01-19 00:40:54,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418112915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:54,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:54,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:54,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875126441] [2022-01-19 00:40:54,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:54,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:54,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:54,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:54,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 250 transitions, 760 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:54,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:54,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:54,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:55,181 INFO L129 PetriNetUnfolder]: 185/1287 cut-off events. [2022-01-19 00:40:55,181 INFO L130 PetriNetUnfolder]: For 3066/3114 co-relation queries the response was YES. [2022-01-19 00:40:55,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 1287 events. 185/1287 cut-off events. For 3066/3114 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8228 event pairs, 118 based on Foata normal form. 6/1208 useless extension candidates. Maximal degree in co-relation 3245. Up to 328 conditions per place. [2022-01-19 00:40:55,191 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 87 selfloop transitions, 12 changer transitions 24/326 dead transitions. [2022-01-19 00:40:55,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 326 transitions, 1532 flow [2022-01-19 00:40:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:40:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:40:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3835 transitions. [2022-01-19 00:40:55,197 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8454585537918872 [2022-01-19 00:40:55,197 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3835 transitions. [2022-01-19 00:40:55,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3835 transitions. [2022-01-19 00:40:55,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:55,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3835 transitions. [2022-01-19 00:40:55,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 213.05555555555554) internal successors, (3835), 18 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 252.0) internal successors, (4788), 19 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,207 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 252.0) internal successors, (4788), 19 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,207 INFO L186 Difference]: Start difference. First operand has 293 places, 250 transitions, 760 flow. Second operand 18 states and 3835 transitions. [2022-01-19 00:40:55,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 326 transitions, 1532 flow [2022-01-19 00:40:55,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 326 transitions, 1458 flow, removed 34 selfloop flow, removed 12 redundant places. [2022-01-19 00:40:55,223 INFO L242 Difference]: Finished difference. Result has 302 places, 255 transitions, 869 flow [2022-01-19 00:40:55,223 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=869, PETRI_PLACES=302, PETRI_TRANSITIONS=255} [2022-01-19 00:40:55,224 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 73 predicate places. [2022-01-19 00:40:55,224 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 255 transitions, 869 flow [2022-01-19 00:40:55,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,225 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:55,225 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:55,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:40:55,225 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1535249203, now seen corresponding path program 4 times [2022-01-19 00:40:55,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:55,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256124555] [2022-01-19 00:40:55,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:55,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:55,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256124555] [2022-01-19 00:40:55,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256124555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:55,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:55,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:55,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685933276] [2022-01-19 00:40:55,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:55,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:55,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:55,333 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:55,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 255 transitions, 869 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:55,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:55,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:55,634 INFO L129 PetriNetUnfolder]: 183/1301 cut-off events. [2022-01-19 00:40:55,634 INFO L130 PetriNetUnfolder]: For 3890/3941 co-relation queries the response was YES. [2022-01-19 00:40:55,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3631 conditions, 1301 events. 183/1301 cut-off events. For 3890/3941 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 8454 event pairs, 138 based on Foata normal form. 7/1215 useless extension candidates. Maximal degree in co-relation 3410. Up to 412 conditions per place. [2022-01-19 00:40:55,643 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 54 selfloop transitions, 10 changer transitions 20/287 dead transitions. [2022-01-19 00:40:55,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 287 transitions, 1319 flow [2022-01-19 00:40:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:40:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:40:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3398 transitions. [2022-01-19 00:40:55,649 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8427579365079365 [2022-01-19 00:40:55,649 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3398 transitions. [2022-01-19 00:40:55,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3398 transitions. [2022-01-19 00:40:55,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:55,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3398 transitions. [2022-01-19 00:40:55,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 212.375) internal successors, (3398), 16 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,659 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,659 INFO L186 Difference]: Start difference. First operand has 302 places, 255 transitions, 869 flow. Second operand 16 states and 3398 transitions. [2022-01-19 00:40:55,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 287 transitions, 1319 flow [2022-01-19 00:40:55,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 287 transitions, 1257 flow, removed 30 selfloop flow, removed 9 redundant places. [2022-01-19 00:40:55,680 INFO L242 Difference]: Finished difference. Result has 308 places, 257 transitions, 912 flow [2022-01-19 00:40:55,681 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=912, PETRI_PLACES=308, PETRI_TRANSITIONS=257} [2022-01-19 00:40:55,682 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 79 predicate places. [2022-01-19 00:40:55,682 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 257 transitions, 912 flow [2022-01-19 00:40:55,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,683 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:55,683 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:55,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:40:55,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash 447530317, now seen corresponding path program 5 times [2022-01-19 00:40:55,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:55,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987979420] [2022-01-19 00:40:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:55,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:55,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:55,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987979420] [2022-01-19 00:40:55,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987979420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:55,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:55,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:55,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220965060] [2022-01-19 00:40:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:55,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:55,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:55,803 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:55,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 257 transitions, 912 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:55,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:55,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:55,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:56,099 INFO L129 PetriNetUnfolder]: 181/1305 cut-off events. [2022-01-19 00:40:56,099 INFO L130 PetriNetUnfolder]: For 3624/3685 co-relation queries the response was YES. [2022-01-19 00:40:56,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 1305 events. 181/1305 cut-off events. For 3624/3685 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8578 event pairs, 121 based on Foata normal form. 6/1226 useless extension candidates. Maximal degree in co-relation 3416. Up to 378 conditions per place. [2022-01-19 00:40:56,110 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 59 selfloop transitions, 12 changer transitions 20/294 dead transitions. [2022-01-19 00:40:56,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 294 transitions, 1475 flow [2022-01-19 00:40:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 00:40:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 00:40:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3192 transitions. [2022-01-19 00:40:56,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2022-01-19 00:40:56,113 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3192 transitions. [2022-01-19 00:40:56,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3192 transitions. [2022-01-19 00:40:56,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:56,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3192 transitions. [2022-01-19 00:40:56,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 212.8) internal successors, (3192), 15 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,119 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,120 INFO L186 Difference]: Start difference. First operand has 308 places, 257 transitions, 912 flow. Second operand 15 states and 3192 transitions. [2022-01-19 00:40:56,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 294 transitions, 1475 flow [2022-01-19 00:40:56,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 294 transitions, 1391 flow, removed 32 selfloop flow, removed 10 redundant places. [2022-01-19 00:40:56,135 INFO L242 Difference]: Finished difference. Result has 314 places, 263 transitions, 1019 flow [2022-01-19 00:40:56,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1019, PETRI_PLACES=314, PETRI_TRANSITIONS=263} [2022-01-19 00:40:56,136 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 85 predicate places. [2022-01-19 00:40:56,136 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 263 transitions, 1019 flow [2022-01-19 00:40:56,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:56,137 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:56,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:40:56,137 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 8861197, now seen corresponding path program 6 times [2022-01-19 00:40:56,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:56,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640067778] [2022-01-19 00:40:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:56,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:56,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:56,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640067778] [2022-01-19 00:40:56,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640067778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:56,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:56,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:56,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603369738] [2022-01-19 00:40:56,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:56,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:56,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:56,240 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:56,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 263 transitions, 1019 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:56,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:56,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:56,533 INFO L129 PetriNetUnfolder]: 170/1263 cut-off events. [2022-01-19 00:40:56,533 INFO L130 PetriNetUnfolder]: For 3697/3752 co-relation queries the response was YES. [2022-01-19 00:40:56,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 1263 events. 170/1263 cut-off events. For 3697/3752 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8116 event pairs, 132 based on Foata normal form. 7/1180 useless extension candidates. Maximal degree in co-relation 3312. Up to 412 conditions per place. [2022-01-19 00:40:56,544 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 51 selfloop transitions, 4 changer transitions 24/282 dead transitions. [2022-01-19 00:40:56,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 282 transitions, 1368 flow [2022-01-19 00:40:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:40:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:40:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2974 transitions. [2022-01-19 00:40:56,548 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429705215419501 [2022-01-19 00:40:56,548 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2974 transitions. [2022-01-19 00:40:56,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2974 transitions. [2022-01-19 00:40:56,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:56,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2974 transitions. [2022-01-19 00:40:56,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 212.42857142857142) internal successors, (2974), 14 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,555 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,555 INFO L186 Difference]: Start difference. First operand has 314 places, 263 transitions, 1019 flow. Second operand 14 states and 2974 transitions. [2022-01-19 00:40:56,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 282 transitions, 1368 flow [2022-01-19 00:40:56,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 282 transitions, 1297 flow, removed 31 selfloop flow, removed 9 redundant places. [2022-01-19 00:40:56,572 INFO L242 Difference]: Finished difference. Result has 314 places, 251 transitions, 838 flow [2022-01-19 00:40:56,572 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=838, PETRI_PLACES=314, PETRI_TRANSITIONS=251} [2022-01-19 00:40:56,573 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 85 predicate places. [2022-01-19 00:40:56,573 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 251 transitions, 838 flow [2022-01-19 00:40:56,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:56,574 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:56,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 00:40:56,574 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1758871115, now seen corresponding path program 7 times [2022-01-19 00:40:56,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:56,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647678241] [2022-01-19 00:40:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:56,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:56,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:56,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647678241] [2022-01-19 00:40:56,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647678241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:56,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:56,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:56,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363660384] [2022-01-19 00:40:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:56,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:56,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:56,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:56,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 251 transitions, 838 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:56,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:56,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:56,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:56,998 INFO L129 PetriNetUnfolder]: 174/1256 cut-off events. [2022-01-19 00:40:56,998 INFO L130 PetriNetUnfolder]: For 3394/3447 co-relation queries the response was YES. [2022-01-19 00:40:57,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 1256 events. 174/1256 cut-off events. For 3394/3447 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8004 event pairs, 126 based on Foata normal form. 6/1178 useless extension candidates. Maximal degree in co-relation 3384. Up to 376 conditions per place. [2022-01-19 00:40:57,009 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 51 selfloop transitions, 16 changer transitions 18/288 dead transitions. [2022-01-19 00:40:57,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 288 transitions, 1365 flow [2022-01-19 00:40:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:40:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:40:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3397 transitions. [2022-01-19 00:40:57,013 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8425099206349206 [2022-01-19 00:40:57,013 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3397 transitions. [2022-01-19 00:40:57,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3397 transitions. [2022-01-19 00:40:57,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:57,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3397 transitions. [2022-01-19 00:40:57,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 212.3125) internal successors, (3397), 16 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,020 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,021 INFO L186 Difference]: Start difference. First operand has 314 places, 251 transitions, 838 flow. Second operand 16 states and 3397 transitions. [2022-01-19 00:40:57,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 288 transitions, 1365 flow [2022-01-19 00:40:57,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 288 transitions, 1268 flow, removed 27 selfloop flow, removed 13 redundant places. [2022-01-19 00:40:57,035 INFO L242 Difference]: Finished difference. Result has 307 places, 260 transitions, 974 flow [2022-01-19 00:40:57,036 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=974, PETRI_PLACES=307, PETRI_TRANSITIONS=260} [2022-01-19 00:40:57,036 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 78 predicate places. [2022-01-19 00:40:57,036 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 260 transitions, 974 flow [2022-01-19 00:40:57,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,037 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:57,037 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:57,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:40:57,037 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 229083099, now seen corresponding path program 8 times [2022-01-19 00:40:57,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:57,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465791446] [2022-01-19 00:40:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:57,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:57,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:57,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465791446] [2022-01-19 00:40:57,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465791446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:57,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:57,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:57,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354549886] [2022-01-19 00:40:57,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:57,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:57,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:57,130 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:57,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 260 transitions, 974 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:57,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:57,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:57,423 INFO L129 PetriNetUnfolder]: 170/1243 cut-off events. [2022-01-19 00:40:57,423 INFO L130 PetriNetUnfolder]: For 2835/2888 co-relation queries the response was YES. [2022-01-19 00:40:57,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 1243 events. 170/1243 cut-off events. For 2835/2888 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7869 event pairs, 125 based on Foata normal form. 6/1162 useless extension candidates. Maximal degree in co-relation 3268. Up to 374 conditions per place. [2022-01-19 00:40:57,433 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 48 selfloop transitions, 17 changer transitions 18/286 dead transitions. [2022-01-19 00:40:57,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 286 transitions, 1405 flow [2022-01-19 00:40:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 00:40:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 00:40:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3189 transitions. [2022-01-19 00:40:57,436 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8436507936507937 [2022-01-19 00:40:57,437 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3189 transitions. [2022-01-19 00:40:57,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3189 transitions. [2022-01-19 00:40:57,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:57,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3189 transitions. [2022-01-19 00:40:57,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 212.6) internal successors, (3189), 15 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,446 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,446 INFO L186 Difference]: Start difference. First operand has 307 places, 260 transitions, 974 flow. Second operand 15 states and 3189 transitions. [2022-01-19 00:40:57,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 286 transitions, 1405 flow [2022-01-19 00:40:57,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 286 transitions, 1357 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-01-19 00:40:57,466 INFO L242 Difference]: Finished difference. Result has 317 places, 263 transitions, 1058 flow [2022-01-19 00:40:57,467 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1058, PETRI_PLACES=317, PETRI_TRANSITIONS=263} [2022-01-19 00:40:57,467 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 88 predicate places. [2022-01-19 00:40:57,467 INFO L470 AbstractCegarLoop]: Abstraction has has 317 places, 263 transitions, 1058 flow [2022-01-19 00:40:57,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,468 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:57,468 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:57,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:40:57,468 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:57,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 366630667, now seen corresponding path program 9 times [2022-01-19 00:40:57,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:57,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565105452] [2022-01-19 00:40:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:57,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:57,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565105452] [2022-01-19 00:40:57,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565105452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:57,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:57,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:57,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728578228] [2022-01-19 00:40:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:57,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:57,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:57,569 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:57,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 263 transitions, 1058 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:57,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:57,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:57,821 INFO L129 PetriNetUnfolder]: 167/1230 cut-off events. [2022-01-19 00:40:57,821 INFO L130 PetriNetUnfolder]: For 3000/3053 co-relation queries the response was YES. [2022-01-19 00:40:57,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 1230 events. 167/1230 cut-off events. For 3000/3053 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7777 event pairs, 126 based on Foata normal form. 6/1151 useless extension candidates. Maximal degree in co-relation 3264. Up to 373 conditions per place. [2022-01-19 00:40:57,831 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 52 selfloop transitions, 8 changer transitions 23/286 dead transitions. [2022-01-19 00:40:57,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 286 transitions, 1389 flow [2022-01-19 00:40:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:40:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:40:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2768 transitions. [2022-01-19 00:40:57,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8449328449328449 [2022-01-19 00:40:57,834 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2768 transitions. [2022-01-19 00:40:57,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2768 transitions. [2022-01-19 00:40:57,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:57,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2768 transitions. [2022-01-19 00:40:57,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 212.92307692307693) internal successors, (2768), 13 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 252.0) internal successors, (3528), 14 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,840 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 252.0) internal successors, (3528), 14 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,840 INFO L186 Difference]: Start difference. First operand has 317 places, 263 transitions, 1058 flow. Second operand 13 states and 2768 transitions. [2022-01-19 00:40:57,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 286 transitions, 1389 flow [2022-01-19 00:40:57,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 286 transitions, 1317 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-01-19 00:40:57,853 INFO L242 Difference]: Finished difference. Result has 320 places, 255 transitions, 906 flow [2022-01-19 00:40:57,854 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=906, PETRI_PLACES=320, PETRI_TRANSITIONS=255} [2022-01-19 00:40:57,854 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 91 predicate places. [2022-01-19 00:40:57,854 INFO L470 AbstractCegarLoop]: Abstraction has has 320 places, 255 transitions, 906 flow [2022-01-19 00:40:57,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,854 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:57,855 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:57,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:40:57,855 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -174123595, now seen corresponding path program 10 times [2022-01-19 00:40:57,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990485314] [2022-01-19 00:40:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:57,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:57,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:57,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990485314] [2022-01-19 00:40:57,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990485314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:57,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:57,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:57,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773205789] [2022-01-19 00:40:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:57,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:57,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:57,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:57,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 255 transitions, 906 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:57,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:57,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:58,173 INFO L129 PetriNetUnfolder]: 159/1158 cut-off events. [2022-01-19 00:40:58,173 INFO L130 PetriNetUnfolder]: For 2698/2751 co-relation queries the response was YES. [2022-01-19 00:40:58,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 1158 events. 159/1158 cut-off events. For 2698/2751 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7126 event pairs, 123 based on Foata normal form. 6/1079 useless extension candidates. Maximal degree in co-relation 3010. Up to 354 conditions per place. [2022-01-19 00:40:58,183 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 43 selfloop transitions, 2 changer transitions 26/272 dead transitions. [2022-01-19 00:40:58,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 272 transitions, 1169 flow [2022-01-19 00:40:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:40:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:40:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2974 transitions. [2022-01-19 00:40:58,185 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429705215419501 [2022-01-19 00:40:58,185 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2974 transitions. [2022-01-19 00:40:58,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2974 transitions. [2022-01-19 00:40:58,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:58,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2974 transitions. [2022-01-19 00:40:58,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 212.42857142857142) internal successors, (2974), 14 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,192 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,192 INFO L186 Difference]: Start difference. First operand has 320 places, 255 transitions, 906 flow. Second operand 14 states and 2974 transitions. [2022-01-19 00:40:58,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 272 transitions, 1169 flow [2022-01-19 00:40:58,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 272 transitions, 1101 flow, removed 16 selfloop flow, removed 14 redundant places. [2022-01-19 00:40:58,203 INFO L242 Difference]: Finished difference. Result has 311 places, 242 transitions, 728 flow [2022-01-19 00:40:58,203 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=728, PETRI_PLACES=311, PETRI_TRANSITIONS=242} [2022-01-19 00:40:58,204 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 82 predicate places. [2022-01-19 00:40:58,204 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 242 transitions, 728 flow [2022-01-19 00:40:58,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,204 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:58,204 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:58,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:40:58,204 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash 314922341, now seen corresponding path program 3 times [2022-01-19 00:40:58,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:58,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457895887] [2022-01-19 00:40:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:58,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:58,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:58,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457895887] [2022-01-19 00:40:58,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457895887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:58,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:58,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:58,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786657479] [2022-01-19 00:40:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:58,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:58,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:58,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:58,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 242 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:58,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:58,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:58,547 INFO L129 PetriNetUnfolder]: 146/1152 cut-off events. [2022-01-19 00:40:58,547 INFO L130 PetriNetUnfolder]: For 2333/2375 co-relation queries the response was YES. [2022-01-19 00:40:58,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 1152 events. 146/1152 cut-off events. For 2333/2375 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6969 event pairs, 99 based on Foata normal form. 1/1077 useless extension candidates. Maximal degree in co-relation 2857. Up to 314 conditions per place. [2022-01-19 00:40:58,556 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 52 selfloop transitions, 12 changer transitions 20/285 dead transitions. [2022-01-19 00:40:58,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 285 transitions, 1228 flow [2022-01-19 00:40:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:40:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:40:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3401 transitions. [2022-01-19 00:40:58,562 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8435019841269841 [2022-01-19 00:40:58,562 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3401 transitions. [2022-01-19 00:40:58,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3401 transitions. [2022-01-19 00:40:58,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:58,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3401 transitions. [2022-01-19 00:40:58,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 212.5625) internal successors, (3401), 16 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,573 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,573 INFO L186 Difference]: Start difference. First operand has 311 places, 242 transitions, 728 flow. Second operand 16 states and 3401 transitions. [2022-01-19 00:40:58,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 285 transitions, 1228 flow [2022-01-19 00:40:58,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 285 transitions, 1176 flow, removed 19 selfloop flow, removed 18 redundant places. [2022-01-19 00:40:58,587 INFO L242 Difference]: Finished difference. Result has 297 places, 252 transitions, 838 flow [2022-01-19 00:40:58,588 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=838, PETRI_PLACES=297, PETRI_TRANSITIONS=252} [2022-01-19 00:40:58,589 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 68 predicate places. [2022-01-19 00:40:58,589 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 252 transitions, 838 flow [2022-01-19 00:40:58,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,589 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:58,590 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:58,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:40:58,590 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1248118097, now seen corresponding path program 4 times [2022-01-19 00:40:58,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:58,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170563375] [2022-01-19 00:40:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:58,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:58,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170563375] [2022-01-19 00:40:58,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170563375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:58,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:58,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:58,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718241144] [2022-01-19 00:40:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:58,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:58,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:58,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:58,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:58,691 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:58,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 252 transitions, 838 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:58,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:58,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:58,888 INFO L129 PetriNetUnfolder]: 152/1180 cut-off events. [2022-01-19 00:40:58,888 INFO L130 PetriNetUnfolder]: For 2604/2672 co-relation queries the response was YES. [2022-01-19 00:40:58,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 1180 events. 152/1180 cut-off events. For 2604/2672 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7236 event pairs, 104 based on Foata normal form. 1/1109 useless extension candidates. Maximal degree in co-relation 3005. Up to 338 conditions per place. [2022-01-19 00:40:58,936 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 55 selfloop transitions, 19 changer transitions 20/295 dead transitions. [2022-01-19 00:40:58,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 295 transitions, 1401 flow [2022-01-19 00:40:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:40:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:40:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2983 transitions. [2022-01-19 00:40:58,939 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8455215419501134 [2022-01-19 00:40:58,939 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2983 transitions. [2022-01-19 00:40:58,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2983 transitions. [2022-01-19 00:40:58,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:58,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2983 transitions. [2022-01-19 00:40:58,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 213.07142857142858) internal successors, (2983), 14 states have internal predecessors, (2983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,947 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,947 INFO L186 Difference]: Start difference. First operand has 297 places, 252 transitions, 838 flow. Second operand 14 states and 2983 transitions. [2022-01-19 00:40:58,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 295 transitions, 1401 flow [2022-01-19 00:40:58,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 295 transitions, 1365 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-01-19 00:40:58,957 INFO L242 Difference]: Finished difference. Result has 310 places, 262 transitions, 1006 flow [2022-01-19 00:40:58,958 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1006, PETRI_PLACES=310, PETRI_TRANSITIONS=262} [2022-01-19 00:40:58,958 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 81 predicate places. [2022-01-19 00:40:58,958 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 262 transitions, 1006 flow [2022-01-19 00:40:58,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:58,959 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:58,959 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:58,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:40:58,959 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1057191539, now seen corresponding path program 5 times [2022-01-19 00:40:58,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:58,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508148503] [2022-01-19 00:40:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:58,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:59,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508148503] [2022-01-19 00:40:59,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508148503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:59,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:59,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:59,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521222661] [2022-01-19 00:40:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:59,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:59,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:59,046 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:59,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 262 transitions, 1006 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:59,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:59,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:59,280 INFO L129 PetriNetUnfolder]: 149/1183 cut-off events. [2022-01-19 00:40:59,280 INFO L130 PetriNetUnfolder]: For 3449/3515 co-relation queries the response was YES. [2022-01-19 00:40:59,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 1183 events. 149/1183 cut-off events. For 3449/3515 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7314 event pairs, 97 based on Foata normal form. 2/1110 useless extension candidates. Maximal degree in co-relation 3229. Up to 325 conditions per place. [2022-01-19 00:40:59,289 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 62 selfloop transitions, 16 changer transitions 24/303 dead transitions. [2022-01-19 00:40:59,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 303 transitions, 1664 flow [2022-01-19 00:40:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 00:40:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 00:40:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3192 transitions. [2022-01-19 00:40:59,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2022-01-19 00:40:59,292 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3192 transitions. [2022-01-19 00:40:59,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3192 transitions. [2022-01-19 00:40:59,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:59,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3192 transitions. [2022-01-19 00:40:59,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 212.8) internal successors, (3192), 15 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,298 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,298 INFO L186 Difference]: Start difference. First operand has 310 places, 262 transitions, 1006 flow. Second operand 15 states and 3192 transitions. [2022-01-19 00:40:59,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 303 transitions, 1664 flow [2022-01-19 00:40:59,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 303 transitions, 1569 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-01-19 00:40:59,314 INFO L242 Difference]: Finished difference. Result has 323 places, 267 transitions, 1090 flow [2022-01-19 00:40:59,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1090, PETRI_PLACES=323, PETRI_TRANSITIONS=267} [2022-01-19 00:40:59,315 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 94 predicate places. [2022-01-19 00:40:59,315 INFO L470 AbstractCegarLoop]: Abstraction has has 323 places, 267 transitions, 1090 flow [2022-01-19 00:40:59,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,315 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:59,316 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:59,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:40:59,316 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1789154919, now seen corresponding path program 6 times [2022-01-19 00:40:59,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:59,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146493514] [2022-01-19 00:40:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:59,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:59,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146493514] [2022-01-19 00:40:59,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146493514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:59,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:59,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:59,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870002741] [2022-01-19 00:40:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:59,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:59,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:59,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:59,394 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:59,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 267 transitions, 1090 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:59,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:59,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:59,603 INFO L129 PetriNetUnfolder]: 143/1172 cut-off events. [2022-01-19 00:40:59,603 INFO L130 PetriNetUnfolder]: For 3909/3989 co-relation queries the response was YES. [2022-01-19 00:40:59,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3282 conditions, 1172 events. 143/1172 cut-off events. For 3909/3989 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7242 event pairs, 99 based on Foata normal form. 7/1103 useless extension candidates. Maximal degree in co-relation 3225. Up to 319 conditions per place. [2022-01-19 00:40:59,612 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 57 selfloop transitions, 11 changer transitions 24/293 dead transitions. [2022-01-19 00:40:59,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 293 transitions, 1540 flow [2022-01-19 00:40:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:40:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:40:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2769 transitions. [2022-01-19 00:40:59,614 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2022-01-19 00:40:59,614 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2769 transitions. [2022-01-19 00:40:59,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2769 transitions. [2022-01-19 00:40:59,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:59,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2769 transitions. [2022-01-19 00:40:59,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 213.0) internal successors, (2769), 13 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 252.0) internal successors, (3528), 14 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,620 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 252.0) internal successors, (3528), 14 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,620 INFO L186 Difference]: Start difference. First operand has 323 places, 267 transitions, 1090 flow. Second operand 13 states and 2769 transitions. [2022-01-19 00:40:59,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 293 transitions, 1540 flow [2022-01-19 00:40:59,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 293 transitions, 1441 flow, removed 44 selfloop flow, removed 9 redundant places. [2022-01-19 00:40:59,636 INFO L242 Difference]: Finished difference. Result has 322 places, 259 transitions, 960 flow [2022-01-19 00:40:59,636 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=960, PETRI_PLACES=322, PETRI_TRANSITIONS=259} [2022-01-19 00:40:59,636 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 93 predicate places. [2022-01-19 00:40:59,636 INFO L470 AbstractCegarLoop]: Abstraction has has 322 places, 259 transitions, 960 flow [2022-01-19 00:40:59,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,637 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:59,637 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:59,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:40:59,637 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:40:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1303786611, now seen corresponding path program 7 times [2022-01-19 00:40:59,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:59,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519899463] [2022-01-19 00:40:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:59,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:59,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:59,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519899463] [2022-01-19 00:40:59,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519899463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:59,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:59,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:59,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735461334] [2022-01-19 00:40:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:59,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:59,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:59,721 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:40:59,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 259 transitions, 960 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:59,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:59,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:40:59,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:59,995 INFO L129 PetriNetUnfolder]: 141/1157 cut-off events. [2022-01-19 00:40:59,995 INFO L130 PetriNetUnfolder]: For 3334/3397 co-relation queries the response was YES. [2022-01-19 00:41:00,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3154 conditions, 1157 events. 141/1157 cut-off events. For 3334/3397 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7079 event pairs, 96 based on Foata normal form. 3/1086 useless extension candidates. Maximal degree in co-relation 3100. Up to 313 conditions per place. [2022-01-19 00:41:00,008 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 54 selfloop transitions, 14 changer transitions 23/292 dead transitions. [2022-01-19 00:41:00,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 292 transitions, 1493 flow [2022-01-19 00:41:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 00:41:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 00:41:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3191 transitions. [2022-01-19 00:41:00,014 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8441798941798941 [2022-01-19 00:41:00,015 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3191 transitions. [2022-01-19 00:41:00,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3191 transitions. [2022-01-19 00:41:00,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:00,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3191 transitions. [2022-01-19 00:41:00,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 212.73333333333332) internal successors, (3191), 15 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,023 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 252.0) internal successors, (4032), 16 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,023 INFO L186 Difference]: Start difference. First operand has 322 places, 259 transitions, 960 flow. Second operand 15 states and 3191 transitions. [2022-01-19 00:41:00,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 292 transitions, 1493 flow [2022-01-19 00:41:00,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 292 transitions, 1405 flow, removed 27 selfloop flow, removed 11 redundant places. [2022-01-19 00:41:00,037 INFO L242 Difference]: Finished difference. Result has 322 places, 263 transitions, 1041 flow [2022-01-19 00:41:00,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1041, PETRI_PLACES=322, PETRI_TRANSITIONS=263} [2022-01-19 00:41:00,037 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 93 predicate places. [2022-01-19 00:41:00,037 INFO L470 AbstractCegarLoop]: Abstraction has has 322 places, 263 transitions, 1041 flow [2022-01-19 00:41:00,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:00,038 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:00,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:41:00,038 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:00,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1584975147, now seen corresponding path program 8 times [2022-01-19 00:41:00,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:00,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274996012] [2022-01-19 00:41:00,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:00,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:00,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274996012] [2022-01-19 00:41:00,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274996012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:00,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:00,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:41:00,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304894541] [2022-01-19 00:41:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:00,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:41:00,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:00,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:41:00,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:41:00,134 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:41:00,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 263 transitions, 1041 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:00,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:41:00,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:00,371 INFO L129 PetriNetUnfolder]: 134/1119 cut-off events. [2022-01-19 00:41:00,371 INFO L130 PetriNetUnfolder]: For 3084/3147 co-relation queries the response was YES. [2022-01-19 00:41:00,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1119 events. 134/1119 cut-off events. For 3084/3147 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6670 event pairs, 96 based on Foata normal form. 3/1048 useless extension candidates. Maximal degree in co-relation 2961. Up to 310 conditions per place. [2022-01-19 00:41:00,379 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 51 selfloop transitions, 4 changer transitions 26/282 dead transitions. [2022-01-19 00:41:00,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 282 transitions, 1360 flow [2022-01-19 00:41:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:41:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:41:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2975 transitions. [2022-01-19 00:41:00,382 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8432539682539683 [2022-01-19 00:41:00,382 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2975 transitions. [2022-01-19 00:41:00,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2975 transitions. [2022-01-19 00:41:00,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:00,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2975 transitions. [2022-01-19 00:41:00,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 212.5) internal successors, (2975), 14 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,389 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,389 INFO L186 Difference]: Start difference. First operand has 322 places, 263 transitions, 1041 flow. Second operand 14 states and 2975 transitions. [2022-01-19 00:41:00,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 282 transitions, 1360 flow [2022-01-19 00:41:00,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 282 transitions, 1285 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-01-19 00:41:00,402 INFO L242 Difference]: Finished difference. Result has 325 places, 252 transitions, 856 flow [2022-01-19 00:41:00,402 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=856, PETRI_PLACES=325, PETRI_TRANSITIONS=252} [2022-01-19 00:41:00,402 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 96 predicate places. [2022-01-19 00:41:00,402 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 252 transitions, 856 flow [2022-01-19 00:41:00,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:00,403 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:00,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:41:00,403 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1299901005, now seen corresponding path program 9 times [2022-01-19 00:41:00,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:00,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116951172] [2022-01-19 00:41:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:00,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:00,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:00,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116951172] [2022-01-19 00:41:00,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116951172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:00,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:00,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:41:00,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232900813] [2022-01-19 00:41:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:00,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:41:00,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:41:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:41:00,480 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:41:00,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 252 transitions, 856 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:00,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:41:00,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:00,708 INFO L129 PetriNetUnfolder]: 133/1117 cut-off events. [2022-01-19 00:41:00,708 INFO L130 PetriNetUnfolder]: For 2822/2873 co-relation queries the response was YES. [2022-01-19 00:41:00,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 1117 events. 133/1117 cut-off events. For 2822/2873 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 6715 event pairs, 99 based on Foata normal form. 2/1047 useless extension candidates. Maximal degree in co-relation 2863. Up to 320 conditions per place. [2022-01-19 00:41:00,715 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 50 selfloop transitions, 10 changer transitions 26/287 dead transitions. [2022-01-19 00:41:00,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 287 transitions, 1340 flow [2022-01-19 00:41:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:41:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:41:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3401 transitions. [2022-01-19 00:41:00,718 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8435019841269841 [2022-01-19 00:41:00,718 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3401 transitions. [2022-01-19 00:41:00,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3401 transitions. [2022-01-19 00:41:00,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:00,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3401 transitions. [2022-01-19 00:41:00,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 212.5625) internal successors, (3401), 16 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,724 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 252.0) internal successors, (4284), 17 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,724 INFO L186 Difference]: Start difference. First operand has 325 places, 252 transitions, 856 flow. Second operand 16 states and 3401 transitions. [2022-01-19 00:41:00,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 287 transitions, 1340 flow [2022-01-19 00:41:00,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 287 transitions, 1226 flow, removed 26 selfloop flow, removed 17 redundant places. [2022-01-19 00:41:00,736 INFO L242 Difference]: Finished difference. Result has 315 places, 253 transitions, 877 flow [2022-01-19 00:41:00,736 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=877, PETRI_PLACES=315, PETRI_TRANSITIONS=253} [2022-01-19 00:41:00,737 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 86 predicate places. [2022-01-19 00:41:00,737 INFO L470 AbstractCegarLoop]: Abstraction has has 315 places, 253 transitions, 877 flow [2022-01-19 00:41:00,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,737 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:00,737 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:00,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:41:00,738 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash -470522315, now seen corresponding path program 10 times [2022-01-19 00:41:00,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:00,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026503455] [2022-01-19 00:41:00,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:00,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:00,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:00,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026503455] [2022-01-19 00:41:00,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026503455] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:00,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:00,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:41:00,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87211150] [2022-01-19 00:41:00,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:00,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:41:00,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:00,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:41:00,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:41:00,817 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2022-01-19 00:41:00,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 253 transitions, 877 flow. Second operand has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:00,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:00,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2022-01-19 00:41:00,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:01,058 INFO L129 PetriNetUnfolder]: 128/1050 cut-off events. [2022-01-19 00:41:01,058 INFO L130 PetriNetUnfolder]: For 2401/2448 co-relation queries the response was YES. [2022-01-19 00:41:01,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1050 events. 128/1050 cut-off events. For 2401/2448 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6003 event pairs, 99 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 2622. Up to 303 conditions per place. [2022-01-19 00:41:01,083 INFO L132 encePairwiseOnDemand]: 241/252 looper letters, 45 selfloop transitions, 2 changer transitions 28/274 dead transitions. [2022-01-19 00:41:01,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 274 transitions, 1151 flow [2022-01-19 00:41:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:41:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:41:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2976 transitions. [2022-01-19 00:41:01,089 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8435374149659864 [2022-01-19 00:41:01,089 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2976 transitions. [2022-01-19 00:41:01,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2976 transitions. [2022-01-19 00:41:01,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:01,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2976 transitions. [2022-01-19 00:41:01,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 212.57142857142858) internal successors, (2976), 14 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,094 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 252.0) internal successors, (3780), 15 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,094 INFO L186 Difference]: Start difference. First operand has 315 places, 253 transitions, 877 flow. Second operand 14 states and 2976 transitions. [2022-01-19 00:41:01,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 274 transitions, 1151 flow [2022-01-19 00:41:01,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 274 transitions, 1087 flow, removed 24 selfloop flow, removed 12 redundant places. [2022-01-19 00:41:01,106 INFO L242 Difference]: Finished difference. Result has 311 places, 240 transitions, 714 flow [2022-01-19 00:41:01,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=714, PETRI_PLACES=311, PETRI_TRANSITIONS=240} [2022-01-19 00:41:01,106 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 82 predicate places. [2022-01-19 00:41:01,107 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 240 transitions, 714 flow [2022-01-19 00:41:01,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 210.88888888888889) internal successors, (1898), 9 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:01,107 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:01,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:41:01,107 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1011397069, now seen corresponding path program 1 times [2022-01-19 00:41:01,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:01,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190679962] [2022-01-19 00:41:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:01,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:01,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190679962] [2022-01-19 00:41:01,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190679962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:01,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:01,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:41:01,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879827675] [2022-01-19 00:41:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:01,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:41:01,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:01,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:41:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:41:01,130 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 252 [2022-01-19 00:41:01,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 240 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:01,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 252 [2022-01-19 00:41:01,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:01,209 INFO L129 PetriNetUnfolder]: 51/622 cut-off events. [2022-01-19 00:41:01,209 INFO L130 PetriNetUnfolder]: For 1069/1084 co-relation queries the response was YES. [2022-01-19 00:41:01,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 622 events. 51/622 cut-off events. For 1069/1084 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2680 event pairs, 25 based on Foata normal form. 6/586 useless extension candidates. Maximal degree in co-relation 1258. Up to 41 conditions per place. [2022-01-19 00:41:01,213 INFO L132 encePairwiseOnDemand]: 247/252 looper letters, 16 selfloop transitions, 2 changer transitions 12/245 dead transitions. [2022-01-19 00:41:01,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 245 transitions, 777 flow [2022-01-19 00:41:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:41:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:41:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2022-01-19 00:41:01,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2022-01-19 00:41:01,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 696 transitions. [2022-01-19 00:41:01,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 696 transitions. [2022-01-19 00:41:01,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:01,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 696 transitions. [2022-01-19 00:41:01,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:41:01,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:41:01,216 INFO L186 Difference]: Start difference. First operand has 311 places, 240 transitions, 714 flow. Second operand 3 states and 696 transitions. [2022-01-19 00:41:01,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 245 transitions, 777 flow [2022-01-19 00:41:01,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 245 transitions, 703 flow, removed 30 selfloop flow, removed 22 redundant places. [2022-01-19 00:41:01,222 INFO L242 Difference]: Finished difference. Result has 273 places, 231 transitions, 598 flow [2022-01-19 00:41:01,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=273, PETRI_TRANSITIONS=231} [2022-01-19 00:41:01,222 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 44 predicate places. [2022-01-19 00:41:01,222 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 231 transitions, 598 flow [2022-01-19 00:41:01,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,223 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:01,223 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:01,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:41:01,223 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash -609702329, now seen corresponding path program 1 times [2022-01-19 00:41:01,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:01,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824503316] [2022-01-19 00:41:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:01,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:01,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:01,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824503316] [2022-01-19 00:41:01,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824503316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:01,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:01,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:41:01,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251101881] [2022-01-19 00:41:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:01,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:41:01,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:41:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:41:01,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 252 [2022-01-19 00:41:01,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 231 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:01,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 252 [2022-01-19 00:41:01,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:01,301 INFO L129 PetriNetUnfolder]: 26/412 cut-off events. [2022-01-19 00:41:01,301 INFO L130 PetriNetUnfolder]: For 314/334 co-relation queries the response was YES. [2022-01-19 00:41:01,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 412 events. 26/412 cut-off events. For 314/334 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1088 event pairs, 9 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 641. Up to 20 conditions per place. [2022-01-19 00:41:01,304 INFO L132 encePairwiseOnDemand]: 248/252 looper letters, 16 selfloop transitions, 2 changer transitions 11/236 dead transitions. [2022-01-19 00:41:01,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 236 transitions, 661 flow [2022-01-19 00:41:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:41:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:41:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2022-01-19 00:41:01,306 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2022-01-19 00:41:01,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 693 transitions. [2022-01-19 00:41:01,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 693 transitions. [2022-01-19 00:41:01,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:01,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 693 transitions. [2022-01-19 00:41:01,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:41:01,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 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) [2022-01-19 00:41:01,307 INFO L186 Difference]: Start difference. First operand has 273 places, 231 transitions, 598 flow. Second operand 3 states and 693 transitions. [2022-01-19 00:41:01,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 236 transitions, 661 flow [2022-01-19 00:41:01,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 236 transitions, 611 flow, removed 25 selfloop flow, removed 10 redundant places. [2022-01-19 00:41:01,311 INFO L242 Difference]: Finished difference. Result has 254 places, 223 transitions, 510 flow [2022-01-19 00:41:01,312 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=254, PETRI_TRANSITIONS=223} [2022-01-19 00:41:01,312 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 25 predicate places. [2022-01-19 00:41:01,312 INFO L470 AbstractCegarLoop]: Abstraction has has 254 places, 223 transitions, 510 flow [2022-01-19 00:41:01,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:01,312 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:01,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:41:01,313 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -233390141, now seen corresponding path program 1 times [2022-01-19 00:41:01,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101403268] [2022-01-19 00:41:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:01,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:01,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101403268] [2022-01-19 00:41:01,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101403268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:01,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:01,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:01,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720510726] [2022-01-19 00:41:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:01,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:01,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:01,636 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:01,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 223 transitions, 510 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:01,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:01,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:04,877 INFO L129 PetriNetUnfolder]: 955/4278 cut-off events. [2022-01-19 00:41:04,877 INFO L130 PetriNetUnfolder]: For 855/861 co-relation queries the response was YES. [2022-01-19 00:41:04,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 4278 events. 955/4278 cut-off events. For 855/861 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 34205 event pairs, 34 based on Foata normal form. 0/3999 useless extension candidates. Maximal degree in co-relation 7203. Up to 291 conditions per place. [2022-01-19 00:41:04,898 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 569 selfloop transitions, 68 changer transitions 0/792 dead transitions. [2022-01-19 00:41:04,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 792 transitions, 2962 flow [2022-01-19 00:41:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 00:41:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 00:41:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 9755 transitions. [2022-01-19 00:41:04,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7303833483078767 [2022-01-19 00:41:04,907 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 9755 transitions. [2022-01-19 00:41:04,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 9755 transitions. [2022-01-19 00:41:04,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:04,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 9755 transitions. [2022-01-19 00:41:04,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 184.0566037735849) internal successors, (9755), 53 states have internal predecessors, (9755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:04,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 252.0) internal successors, (13608), 54 states have internal predecessors, (13608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:04,928 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 252.0) internal successors, (13608), 54 states have internal predecessors, (13608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:04,928 INFO L186 Difference]: Start difference. First operand has 254 places, 223 transitions, 510 flow. Second operand 53 states and 9755 transitions. [2022-01-19 00:41:04,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 792 transitions, 2962 flow [2022-01-19 00:41:04,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 792 transitions, 2938 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-01-19 00:41:04,944 INFO L242 Difference]: Finished difference. Result has 303 places, 274 transitions, 796 flow [2022-01-19 00:41:04,945 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=796, PETRI_PLACES=303, PETRI_TRANSITIONS=274} [2022-01-19 00:41:04,945 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 74 predicate places. [2022-01-19 00:41:04,946 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 274 transitions, 796 flow [2022-01-19 00:41:04,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:04,946 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:04,946 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:04,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:41:04,947 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash -788458581, now seen corresponding path program 2 times [2022-01-19 00:41:04,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:04,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164798745] [2022-01-19 00:41:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:04,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:05,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:05,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164798745] [2022-01-19 00:41:05,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164798745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:05,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:05,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:05,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010878650] [2022-01-19 00:41:05,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:05,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:05,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:05,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:05,292 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:05,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 274 transitions, 796 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:05,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:05,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:05,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:08,988 INFO L129 PetriNetUnfolder]: 1201/5972 cut-off events. [2022-01-19 00:41:08,988 INFO L130 PetriNetUnfolder]: For 1503/1524 co-relation queries the response was YES. [2022-01-19 00:41:09,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10832 conditions, 5972 events. 1201/5972 cut-off events. For 1503/1524 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 53687 event pairs, 118 based on Foata normal form. 1/5718 useless extension candidates. Maximal degree in co-relation 10800. Up to 317 conditions per place. [2022-01-19 00:41:09,040 INFO L132 encePairwiseOnDemand]: 214/252 looper letters, 662 selfloop transitions, 137 changer transitions 0/954 dead transitions. [2022-01-19 00:41:09,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 954 transitions, 4638 flow [2022-01-19 00:41:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-01-19 00:41:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-01-19 00:41:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 12945 transitions. [2022-01-19 00:41:09,049 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7235077129443327 [2022-01-19 00:41:09,049 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 12945 transitions. [2022-01-19 00:41:09,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 12945 transitions. [2022-01-19 00:41:09,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:09,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 12945 transitions. [2022-01-19 00:41:09,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 182.32394366197184) internal successors, (12945), 71 states have internal predecessors, (12945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:09,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 252.0) internal successors, (18144), 72 states have internal predecessors, (18144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:09,078 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 252.0) internal successors, (18144), 72 states have internal predecessors, (18144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:09,078 INFO L186 Difference]: Start difference. First operand has 303 places, 274 transitions, 796 flow. Second operand 71 states and 12945 transitions. [2022-01-19 00:41:09,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 954 transitions, 4638 flow [2022-01-19 00:41:09,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 954 transitions, 4259 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-01-19 00:41:09,095 INFO L242 Difference]: Finished difference. Result has 400 places, 378 transitions, 1612 flow [2022-01-19 00:41:09,096 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=1612, PETRI_PLACES=400, PETRI_TRANSITIONS=378} [2022-01-19 00:41:09,096 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 171 predicate places. [2022-01-19 00:41:09,096 INFO L470 AbstractCegarLoop]: Abstraction has has 400 places, 378 transitions, 1612 flow [2022-01-19 00:41:09,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:09,097 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:09,097 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:09,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:41:09,097 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 360840569, now seen corresponding path program 3 times [2022-01-19 00:41:09,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:09,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139755157] [2022-01-19 00:41:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:09,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:09,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139755157] [2022-01-19 00:41:09,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139755157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:09,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:09,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:09,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121368727] [2022-01-19 00:41:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:09,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:09,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:09,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:09,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 378 transitions, 1612 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:09,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:09,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:09,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:12,576 INFO L129 PetriNetUnfolder]: 1311/7095 cut-off events. [2022-01-19 00:41:12,576 INFO L130 PetriNetUnfolder]: For 5156/5200 co-relation queries the response was YES. [2022-01-19 00:41:12,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14614 conditions, 7095 events. 1311/7095 cut-off events. For 5156/5200 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 67412 event pairs, 191 based on Foata normal form. 12/6841 useless extension candidates. Maximal degree in co-relation 14545. Up to 597 conditions per place. [2022-01-19 00:41:12,648 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 653 selfloop transitions, 126 changer transitions 0/934 dead transitions. [2022-01-19 00:41:12,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 934 transitions, 5764 flow [2022-01-19 00:41:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 00:41:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 00:41:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 9761 transitions. [2022-01-19 00:41:12,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7308325846061695 [2022-01-19 00:41:12,668 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 9761 transitions. [2022-01-19 00:41:12,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 9761 transitions. [2022-01-19 00:41:12,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:12,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 9761 transitions. [2022-01-19 00:41:12,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 184.16981132075472) internal successors, (9761), 53 states have internal predecessors, (9761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:12,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 252.0) internal successors, (13608), 54 states have internal predecessors, (13608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:12,684 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 252.0) internal successors, (13608), 54 states have internal predecessors, (13608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:12,684 INFO L186 Difference]: Start difference. First operand has 400 places, 378 transitions, 1612 flow. Second operand 53 states and 9761 transitions. [2022-01-19 00:41:12,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 934 transitions, 5764 flow [2022-01-19 00:41:12,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 934 transitions, 5280 flow, removed 40 selfloop flow, removed 9 redundant places. [2022-01-19 00:41:12,712 INFO L242 Difference]: Finished difference. Result has 463 places, 402 transitions, 1971 flow [2022-01-19 00:41:12,713 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=1971, PETRI_PLACES=463, PETRI_TRANSITIONS=402} [2022-01-19 00:41:12,713 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 234 predicate places. [2022-01-19 00:41:12,713 INFO L470 AbstractCegarLoop]: Abstraction has has 463 places, 402 transitions, 1971 flow [2022-01-19 00:41:12,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:12,714 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:12,714 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:12,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:41:12,714 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash 434720785, now seen corresponding path program 4 times [2022-01-19 00:41:12,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:12,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461980975] [2022-01-19 00:41:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:12,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:13,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461980975] [2022-01-19 00:41:13,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461980975] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:13,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:13,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:13,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384116760] [2022-01-19 00:41:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:13,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:13,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:13,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:13,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 402 transitions, 1971 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:13,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:13,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:13,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:17,157 INFO L129 PetriNetUnfolder]: 1861/9927 cut-off events. [2022-01-19 00:41:17,157 INFO L130 PetriNetUnfolder]: For 12536/12591 co-relation queries the response was YES. [2022-01-19 00:41:17,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22360 conditions, 9927 events. 1861/9927 cut-off events. For 12536/12591 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 100430 event pairs, 999 based on Foata normal form. 8/9565 useless extension candidates. Maximal degree in co-relation 22270. Up to 1594 conditions per place. [2022-01-19 00:41:17,260 INFO L132 encePairwiseOnDemand]: 214/252 looper letters, 550 selfloop transitions, 114 changer transitions 0/819 dead transitions. [2022-01-19 00:41:17,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 819 transitions, 5879 flow [2022-01-19 00:41:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 00:41:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 00:41:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 8041 transitions. [2022-01-19 00:41:17,282 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7251984126984127 [2022-01-19 00:41:17,282 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 8041 transitions. [2022-01-19 00:41:17,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 8041 transitions. [2022-01-19 00:41:17,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:17,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 8041 transitions. [2022-01-19 00:41:17,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 182.75) internal successors, (8041), 44 states have internal predecessors, (8041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:17,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 252.0) internal successors, (11340), 45 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:17,299 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 252.0) internal successors, (11340), 45 states have internal predecessors, (11340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:17,299 INFO L186 Difference]: Start difference. First operand has 463 places, 402 transitions, 1971 flow. Second operand 44 states and 8041 transitions. [2022-01-19 00:41:17,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 819 transitions, 5879 flow [2022-01-19 00:41:17,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 819 transitions, 5303 flow, removed 21 selfloop flow, removed 32 redundant places. [2022-01-19 00:41:17,372 INFO L242 Difference]: Finished difference. Result has 513 places, 488 transitions, 2870 flow [2022-01-19 00:41:17,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2870, PETRI_PLACES=513, PETRI_TRANSITIONS=488} [2022-01-19 00:41:17,377 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 284 predicate places. [2022-01-19 00:41:17,377 INFO L470 AbstractCegarLoop]: Abstraction has has 513 places, 488 transitions, 2870 flow [2022-01-19 00:41:17,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:17,378 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:17,378 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:17,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 00:41:17,379 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 471229023, now seen corresponding path program 5 times [2022-01-19 00:41:17,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:17,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705010205] [2022-01-19 00:41:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:17,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:17,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:17,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705010205] [2022-01-19 00:41:17,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705010205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:17,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:17,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:17,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364723882] [2022-01-19 00:41:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:17,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:17,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:17,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:17,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:17,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 488 transitions, 2870 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:17,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:17,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:17,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:25,422 INFO L129 PetriNetUnfolder]: 3100/17606 cut-off events. [2022-01-19 00:41:25,423 INFO L130 PetriNetUnfolder]: For 35188/35360 co-relation queries the response was YES. [2022-01-19 00:41:25,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41527 conditions, 17606 events. 3100/17606 cut-off events. For 35188/35360 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 208716 event pairs, 516 based on Foata normal form. 31/17052 useless extension candidates. Maximal degree in co-relation 41398. Up to 1402 conditions per place. [2022-01-19 00:41:25,647 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1055 selfloop transitions, 271 changer transitions 0/1481 dead transitions. [2022-01-19 00:41:25,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 1481 transitions, 12814 flow [2022-01-19 00:41:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-01-19 00:41:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2022-01-19 00:41:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 14666 transitions. [2022-01-19 00:41:25,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7274801587301587 [2022-01-19 00:41:25,743 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 14666 transitions. [2022-01-19 00:41:25,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 14666 transitions. [2022-01-19 00:41:25,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:25,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 14666 transitions. [2022-01-19 00:41:25,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 183.325) internal successors, (14666), 80 states have internal predecessors, (14666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 252.0) internal successors, (20412), 81 states have internal predecessors, (20412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,765 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 252.0) internal successors, (20412), 81 states have internal predecessors, (20412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,765 INFO L186 Difference]: Start difference. First operand has 513 places, 488 transitions, 2870 flow. Second operand 80 states and 14666 transitions. [2022-01-19 00:41:25,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 1481 transitions, 12814 flow [2022-01-19 00:41:25,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 1481 transitions, 12052 flow, removed 381 selfloop flow, removed 0 redundant places. [2022-01-19 00:41:25,924 INFO L242 Difference]: Finished difference. Result has 647 places, 622 transitions, 4595 flow [2022-01-19 00:41:25,924 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=2572, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=4595, PETRI_PLACES=647, PETRI_TRANSITIONS=622} [2022-01-19 00:41:25,925 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 418 predicate places. [2022-01-19 00:41:25,925 INFO L470 AbstractCegarLoop]: Abstraction has has 647 places, 622 transitions, 4595 flow [2022-01-19 00:41:25,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,925 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:25,926 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:25,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 00:41:25,926 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -9030123, now seen corresponding path program 6 times [2022-01-19 00:41:25,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:25,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355228528] [2022-01-19 00:41:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:25,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:26,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355228528] [2022-01-19 00:41:26,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355228528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:26,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:26,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:26,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535653361] [2022-01-19 00:41:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:26,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:26,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:26,349 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:26,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 622 transitions, 4595 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:26,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:26,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:26,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:33,952 INFO L129 PetriNetUnfolder]: 3380/19277 cut-off events. [2022-01-19 00:41:33,952 INFO L130 PetriNetUnfolder]: For 60769/60968 co-relation queries the response was YES. [2022-01-19 00:41:34,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50216 conditions, 19277 events. 3380/19277 cut-off events. For 60769/60968 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 232881 event pairs, 2062 based on Foata normal form. 47/18653 useless extension candidates. Maximal degree in co-relation 50031. Up to 3778 conditions per place. [2022-01-19 00:41:34,207 INFO L132 encePairwiseOnDemand]: 214/252 looper letters, 732 selfloop transitions, 135 changer transitions 0/1022 dead transitions. [2022-01-19 00:41:34,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 1022 transitions, 9791 flow [2022-01-19 00:41:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 00:41:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 00:41:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7873 transitions. [2022-01-19 00:41:34,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7265596160944998 [2022-01-19 00:41:34,212 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7873 transitions. [2022-01-19 00:41:34,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7873 transitions. [2022-01-19 00:41:34,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:34,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7873 transitions. [2022-01-19 00:41:34,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 183.09302325581396) internal successors, (7873), 43 states have internal predecessors, (7873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:34,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 252.0) internal successors, (11088), 44 states have internal predecessors, (11088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:34,223 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 252.0) internal successors, (11088), 44 states have internal predecessors, (11088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:34,223 INFO L186 Difference]: Start difference. First operand has 647 places, 622 transitions, 4595 flow. Second operand 43 states and 7873 transitions. [2022-01-19 00:41:34,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 1022 transitions, 9791 flow [2022-01-19 00:41:34,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 1022 transitions, 8775 flow, removed 244 selfloop flow, removed 21 redundant places. [2022-01-19 00:41:34,525 INFO L242 Difference]: Finished difference. Result has 691 places, 676 transitions, 4891 flow [2022-01-19 00:41:34,525 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3881, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=4891, PETRI_PLACES=691, PETRI_TRANSITIONS=676} [2022-01-19 00:41:34,525 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 462 predicate places. [2022-01-19 00:41:34,526 INFO L470 AbstractCegarLoop]: Abstraction has has 691 places, 676 transitions, 4891 flow [2022-01-19 00:41:34,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:34,526 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:34,526 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:34,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 00:41:34,526 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 851096211, now seen corresponding path program 7 times [2022-01-19 00:41:34,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:34,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749617105] [2022-01-19 00:41:34,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:34,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:34,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:34,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749617105] [2022-01-19 00:41:34,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749617105] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:34,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:34,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:34,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408249471] [2022-01-19 00:41:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:34,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:34,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:34,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:34,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:34,823 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:34,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 676 transitions, 4891 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:34,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:34,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:34,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:46,598 INFO L129 PetriNetUnfolder]: 4792/28003 cut-off events. [2022-01-19 00:41:46,598 INFO L130 PetriNetUnfolder]: For 109646/109986 co-relation queries the response was YES. [2022-01-19 00:41:47,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74778 conditions, 28003 events. 4792/28003 cut-off events. For 109646/109986 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 368076 event pairs, 1448 based on Foata normal form. 55/27135 useless extension candidates. Maximal degree in co-relation 74571. Up to 3173 conditions per place. [2022-01-19 00:41:47,134 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1273 selfloop transitions, 351 changer transitions 0/1779 dead transitions. [2022-01-19 00:41:47,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 1779 transitions, 18947 flow [2022-01-19 00:41:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-01-19 00:41:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-01-19 00:41:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 15631 transitions. [2022-01-19 00:41:47,144 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7297385620915032 [2022-01-19 00:41:47,144 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 15631 transitions. [2022-01-19 00:41:47,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 15631 transitions. [2022-01-19 00:41:47,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:47,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 15631 transitions. [2022-01-19 00:41:47,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 183.89411764705883) internal successors, (15631), 85 states have internal predecessors, (15631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:47,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 252.0) internal successors, (21672), 86 states have internal predecessors, (21672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:47,169 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 252.0) internal successors, (21672), 86 states have internal predecessors, (21672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:47,169 INFO L186 Difference]: Start difference. First operand has 691 places, 676 transitions, 4891 flow. Second operand 85 states and 15631 transitions. [2022-01-19 00:41:47,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 1779 transitions, 18947 flow [2022-01-19 00:41:47,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 1779 transitions, 17964 flow, removed 376 selfloop flow, removed 13 redundant places. [2022-01-19 00:41:47,790 INFO L242 Difference]: Finished difference. Result has 821 places, 824 transitions, 7554 flow [2022-01-19 00:41:47,791 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=4565, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=7554, PETRI_PLACES=821, PETRI_TRANSITIONS=824} [2022-01-19 00:41:47,791 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 592 predicate places. [2022-01-19 00:41:47,791 INFO L470 AbstractCegarLoop]: Abstraction has has 821 places, 824 transitions, 7554 flow [2022-01-19 00:41:47,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:47,792 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:47,792 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:47,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 00:41:47,792 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:41:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1088806255, now seen corresponding path program 8 times [2022-01-19 00:41:47,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:47,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339569082] [2022-01-19 00:41:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:47,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:48,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:48,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339569082] [2022-01-19 00:41:48,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339569082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:48,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:48,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:41:48,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083060104] [2022-01-19 00:41:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:48,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:41:48,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:41:48,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:41:48,237 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:41:48,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 824 transitions, 7554 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:48,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:48,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:41:48,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:00,701 INFO L129 PetriNetUnfolder]: 5092/29425 cut-off events. [2022-01-19 00:42:00,701 INFO L130 PetriNetUnfolder]: For 160308/160723 co-relation queries the response was YES. [2022-01-19 00:42:01,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84981 conditions, 29425 events. 5092/29425 cut-off events. For 160308/160723 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 389952 event pairs, 3252 based on Foata normal form. 101/28530 useless extension candidates. Maximal degree in co-relation 84714. Up to 6271 conditions per place. [2022-01-19 00:42:01,336 INFO L132 encePairwiseOnDemand]: 214/252 looper letters, 933 selfloop transitions, 159 changer transitions 0/1247 dead transitions. [2022-01-19 00:42:01,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 1247 transitions, 14408 flow [2022-01-19 00:42:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 00:42:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 00:42:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7877 transitions. [2022-01-19 00:42:01,352 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7269287559985235 [2022-01-19 00:42:01,352 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7877 transitions. [2022-01-19 00:42:01,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7877 transitions. [2022-01-19 00:42:01,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:01,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7877 transitions. [2022-01-19 00:42:01,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 183.1860465116279) internal successors, (7877), 43 states have internal predecessors, (7877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:01,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 252.0) internal successors, (11088), 44 states have internal predecessors, (11088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:01,364 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 252.0) internal successors, (11088), 44 states have internal predecessors, (11088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:01,364 INFO L186 Difference]: Start difference. First operand has 821 places, 824 transitions, 7554 flow. Second operand 43 states and 7877 transitions. [2022-01-19 00:42:01,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 1247 transitions, 14408 flow [2022-01-19 00:42:02,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 1247 transitions, 12696 flow, removed 567 selfloop flow, removed 21 redundant places. [2022-01-19 00:42:02,420 INFO L242 Difference]: Finished difference. Result has 866 places, 880 transitions, 7555 flow [2022-01-19 00:42:02,421 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=6237, PETRI_DIFFERENCE_MINUEND_PLACES=800, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=7555, PETRI_PLACES=866, PETRI_TRANSITIONS=880} [2022-01-19 00:42:02,421 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 637 predicate places. [2022-01-19 00:42:02,421 INFO L470 AbstractCegarLoop]: Abstraction has has 866 places, 880 transitions, 7555 flow [2022-01-19 00:42:02,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:02,422 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:02,422 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:02,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 00:42:02,423 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:42:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1827374815, now seen corresponding path program 9 times [2022-01-19 00:42:02,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:02,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126321631] [2022-01-19 00:42:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:02,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:02,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:02,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126321631] [2022-01-19 00:42:02,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126321631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:02,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:02,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:42:02,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872190817] [2022-01-19 00:42:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:02,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:42:02,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:42:02,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:42:02,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:42:02,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 866 places, 880 transitions, 7555 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:02,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:02,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:42:02,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:20,518 INFO L129 PetriNetUnfolder]: 6527/38226 cut-off events. [2022-01-19 00:42:20,519 INFO L130 PetriNetUnfolder]: For 249142/249702 co-relation queries the response was YES. [2022-01-19 00:42:21,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113080 conditions, 38226 events. 6527/38226 cut-off events. For 249142/249702 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 532633 event pairs, 3256 based on Foata normal form. 80/37030 useless extension candidates. Maximal degree in co-relation 112789. Up to 6667 conditions per place. [2022-01-19 00:42:21,749 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1300 selfloop transitions, 396 changer transitions 0/1851 dead transitions. [2022-01-19 00:42:21,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 1851 transitions, 23038 flow [2022-01-19 00:42:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-19 00:42:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-01-19 00:42:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 14131 transitions. [2022-01-19 00:42:21,773 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7282519068233354 [2022-01-19 00:42:21,773 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 14131 transitions. [2022-01-19 00:42:21,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 14131 transitions. [2022-01-19 00:42:21,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:21,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 14131 transitions. [2022-01-19 00:42:21,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 183.5194805194805) internal successors, (14131), 77 states have internal predecessors, (14131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 252.0) internal successors, (19656), 78 states have internal predecessors, (19656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,795 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 252.0) internal successors, (19656), 78 states have internal predecessors, (19656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,795 INFO L186 Difference]: Start difference. First operand has 866 places, 880 transitions, 7555 flow. Second operand 77 states and 14131 transitions. [2022-01-19 00:42:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 1851 transitions, 23038 flow [2022-01-19 00:42:23,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 1851 transitions, 22438 flow, removed 195 selfloop flow, removed 13 redundant places. [2022-01-19 00:42:23,494 INFO L242 Difference]: Finished difference. Result has 987 places, 1036 transitions, 11387 flow [2022-01-19 00:42:23,495 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=7110, PETRI_DIFFERENCE_MINUEND_PLACES=853, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=11387, PETRI_PLACES=987, PETRI_TRANSITIONS=1036} [2022-01-19 00:42:23,496 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 758 predicate places. [2022-01-19 00:42:23,496 INFO L470 AbstractCegarLoop]: Abstraction has has 987 places, 1036 transitions, 11387 flow [2022-01-19 00:42:23,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:23,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:23,496 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:23,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 00:42:23,497 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:42:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2088523411, now seen corresponding path program 10 times [2022-01-19 00:42:23,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:23,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074129096] [2022-01-19 00:42:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:23,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:23,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:23,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074129096] [2022-01-19 00:42:23,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074129096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:23,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:23,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:42:23,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660209543] [2022-01-19 00:42:23,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:23,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:42:23,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:23,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:42:23,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:42:23,799 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:42:23,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1036 transitions, 11387 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:23,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:23,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:42:23,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:48,800 INFO L129 PetriNetUnfolder]: 8163/47394 cut-off events. [2022-01-19 00:42:48,801 INFO L130 PetriNetUnfolder]: For 461061/461834 co-relation queries the response was YES. [2022-01-19 00:42:50,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154174 conditions, 47394 events. 8163/47394 cut-off events. For 461061/461834 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 684224 event pairs, 4618 based on Foata normal form. 94/45871 useless extension candidates. Maximal degree in co-relation 153824. Up to 9549 conditions per place. [2022-01-19 00:42:50,981 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1369 selfloop transitions, 334 changer transitions 0/1858 dead transitions. [2022-01-19 00:42:50,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1052 places, 1858 transitions, 25962 flow [2022-01-19 00:42:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-19 00:42:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-01-19 00:42:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 12138 transitions. [2022-01-19 00:42:50,986 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7297979797979798 [2022-01-19 00:42:50,986 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 12138 transitions. [2022-01-19 00:42:50,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 12138 transitions. [2022-01-19 00:42:50,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:50,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 12138 transitions. [2022-01-19 00:42:50,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 183.9090909090909) internal successors, (12138), 66 states have internal predecessors, (12138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:51,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 252.0) internal successors, (16884), 67 states have internal predecessors, (16884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:51,007 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 252.0) internal successors, (16884), 67 states have internal predecessors, (16884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:51,007 INFO L186 Difference]: Start difference. First operand has 987 places, 1036 transitions, 11387 flow. Second operand 66 states and 12138 transitions. [2022-01-19 00:42:51,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1052 places, 1858 transitions, 25962 flow [2022-01-19 00:42:54,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 1858 transitions, 23703 flow, removed 1009 selfloop flow, removed 11 redundant places. [2022-01-19 00:42:54,472 INFO L242 Difference]: Finished difference. Result has 1088 places, 1204 transitions, 14138 flow [2022-01-19 00:42:54,473 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=9241, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=14138, PETRI_PLACES=1088, PETRI_TRANSITIONS=1204} [2022-01-19 00:42:54,473 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 859 predicate places. [2022-01-19 00:42:54,473 INFO L470 AbstractCegarLoop]: Abstraction has has 1088 places, 1204 transitions, 14138 flow [2022-01-19 00:42:54,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:54,474 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:54,474 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:54,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 00:42:54,474 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:42:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -108126985, now seen corresponding path program 11 times [2022-01-19 00:42:54,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:54,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898517749] [2022-01-19 00:42:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:54,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:54,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:54,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898517749] [2022-01-19 00:42:54,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898517749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:54,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:54,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:42:54,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898725572] [2022-01-19 00:42:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:54,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:42:54,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:42:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:42:54,802 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:42:54,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1088 places, 1204 transitions, 14138 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:54,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:54,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:42:54,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:43:27,550 INFO L129 PetriNetUnfolder]: 10054/59101 cut-off events. [2022-01-19 00:43:27,551 INFO L130 PetriNetUnfolder]: For 693742/694752 co-relation queries the response was YES. [2022-01-19 00:43:31,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199303 conditions, 59101 events. 10054/59101 cut-off events. For 693742/694752 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 890132 event pairs, 6137 based on Foata normal form. 120/57236 useless extension candidates. Maximal degree in co-relation 198905. Up to 12033 conditions per place. [2022-01-19 00:43:31,408 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1550 selfloop transitions, 378 changer transitions 0/2083 dead transitions. [2022-01-19 00:43:31,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1156 places, 2083 transitions, 30735 flow [2022-01-19 00:43:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-19 00:43:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-01-19 00:43:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 12715 transitions. [2022-01-19 00:43:31,505 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7312514377731769 [2022-01-19 00:43:31,505 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 12715 transitions. [2022-01-19 00:43:31,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 12715 transitions. [2022-01-19 00:43:31,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:43:31,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 12715 transitions. [2022-01-19 00:43:31,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 184.2753623188406) internal successors, (12715), 69 states have internal predecessors, (12715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:31,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 252.0) internal successors, (17640), 70 states have internal predecessors, (17640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:31,523 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 252.0) internal successors, (17640), 70 states have internal predecessors, (17640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:31,523 INFO L186 Difference]: Start difference. First operand has 1088 places, 1204 transitions, 14138 flow. Second operand 69 states and 12715 transitions. [2022-01-19 00:43:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1156 places, 2083 transitions, 30735 flow [2022-01-19 00:43:37,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1153 places, 2083 transitions, 27945 flow, removed 1307 selfloop flow, removed 3 redundant places. [2022-01-19 00:43:37,230 INFO L242 Difference]: Finished difference. Result has 1204 places, 1367 transitions, 16142 flow [2022-01-19 00:43:37,231 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=11468, PETRI_DIFFERENCE_MINUEND_PLACES=1085, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=16142, PETRI_PLACES=1204, PETRI_TRANSITIONS=1367} [2022-01-19 00:43:37,231 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 975 predicate places. [2022-01-19 00:43:37,231 INFO L470 AbstractCegarLoop]: Abstraction has has 1204 places, 1367 transitions, 16142 flow [2022-01-19 00:43:37,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:37,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:43:37,232 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:43:37,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 00:43:37,232 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:43:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:43:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1041903881, now seen corresponding path program 12 times [2022-01-19 00:43:37,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:43:37,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934852346] [2022-01-19 00:43:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:43:37,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:43:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:43:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:43:37,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:43:37,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934852346] [2022-01-19 00:43:37,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934852346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:43:37,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:43:37,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:43:37,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125835194] [2022-01-19 00:43:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:43:37,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:43:37,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:43:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:43:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:43:37,534 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:43:37,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1204 places, 1367 transitions, 16142 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:37,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:43:37,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:43:37,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:20,908 INFO L129 PetriNetUnfolder]: 11964/70572 cut-off events. [2022-01-19 00:44:20,908 INFO L130 PetriNetUnfolder]: For 953999/955101 co-relation queries the response was YES. [2022-01-19 00:44:28,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246226 conditions, 70572 events. 11964/70572 cut-off events. For 953999/955101 co-relation queries the response was YES. Maximal size of possible extension queue 1977. Compared 1095957 event pairs, 7055 based on Foata normal form. 163/68342 useless extension candidates. Maximal degree in co-relation 245776. Up to 14640 conditions per place. [2022-01-19 00:44:28,651 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1708 selfloop transitions, 577 changer transitions 0/2440 dead transitions. [2022-01-19 00:44:28,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1288 places, 2440 transitions, 38158 flow [2022-01-19 00:44:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-01-19 00:44:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-01-19 00:44:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 15607 transitions. [2022-01-19 00:44:28,660 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7286181139122315 [2022-01-19 00:44:28,660 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 15607 transitions. [2022-01-19 00:44:28,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 15607 transitions. [2022-01-19 00:44:28,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:28,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 15607 transitions. [2022-01-19 00:44:28,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 183.61176470588236) internal successors, (15607), 85 states have internal predecessors, (15607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:28,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 252.0) internal successors, (21672), 86 states have internal predecessors, (21672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:28,687 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 252.0) internal successors, (21672), 86 states have internal predecessors, (21672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:28,687 INFO L186 Difference]: Start difference. First operand has 1204 places, 1367 transitions, 16142 flow. Second operand 85 states and 15607 transitions. [2022-01-19 00:44:28,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1288 places, 2440 transitions, 38158 flow [2022-01-19 00:44:38,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1285 places, 2440 transitions, 35528 flow, removed 1206 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:38,195 INFO L242 Difference]: Finished difference. Result has 1336 places, 1545 transitions, 19821 flow [2022-01-19 00:44:38,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=13766, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=415, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=19821, PETRI_PLACES=1336, PETRI_TRANSITIONS=1545} [2022-01-19 00:44:38,196 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 1107 predicate places. [2022-01-19 00:44:38,196 INFO L470 AbstractCegarLoop]: Abstraction has has 1336 places, 1545 transitions, 19821 flow [2022-01-19 00:44:38,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:38,197 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:38,197 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:44:38,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 00:44:38,197 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:38,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1841364693, now seen corresponding path program 13 times [2022-01-19 00:44:38,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:38,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211252160] [2022-01-19 00:44:38,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:38,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:38,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:38,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211252160] [2022-01-19 00:44:38,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211252160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:38,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:38,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:44:38,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729150911] [2022-01-19 00:44:38,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:38,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:44:38,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:38,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:44:38,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:44:38,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:44:38,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1336 places, 1545 transitions, 19821 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:38,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:38,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:44:38,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:33,952 INFO L129 PetriNetUnfolder]: 13844/81835 cut-off events. [2022-01-19 00:45:33,952 INFO L130 PetriNetUnfolder]: For 1325141/1326477 co-relation queries the response was YES. [2022-01-19 00:45:42,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298287 conditions, 81835 events. 13844/81835 cut-off events. For 1325141/1326477 co-relation queries the response was YES. Maximal size of possible extension queue 2336. Compared 1306165 event pairs, 8519 based on Foata normal form. 180/79243 useless extension candidates. Maximal degree in co-relation 297786. Up to 17762 conditions per place. [2022-01-19 00:45:42,782 INFO L132 encePairwiseOnDemand]: 216/252 looper letters, 1795 selfloop transitions, 582 changer transitions 0/2532 dead transitions. [2022-01-19 00:45:42,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1413 places, 2532 transitions, 41672 flow [2022-01-19 00:45:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-19 00:45:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-01-19 00:45:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 14347 transitions. [2022-01-19 00:45:42,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7299043549043549 [2022-01-19 00:45:42,788 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 14347 transitions. [2022-01-19 00:45:42,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 14347 transitions. [2022-01-19 00:45:42,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:42,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 14347 transitions. [2022-01-19 00:45:42,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 183.93589743589743) internal successors, (14347), 78 states have internal predecessors, (14347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:42,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 252.0) internal successors, (19908), 79 states have internal predecessors, (19908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:42,806 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 252.0) internal successors, (19908), 79 states have internal predecessors, (19908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:42,806 INFO L186 Difference]: Start difference. First operand has 1336 places, 1545 transitions, 19821 flow. Second operand 78 states and 14347 transitions. [2022-01-19 00:45:42,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1413 places, 2532 transitions, 41672 flow [2022-01-19 00:45:55,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1404 places, 2532 transitions, 38245 flow, removed 1541 selfloop flow, removed 9 redundant places. [2022-01-19 00:45:55,623 INFO L242 Difference]: Finished difference. Result has 1456 places, 1710 transitions, 22623 flow [2022-01-19 00:45:55,624 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=16678, PETRI_DIFFERENCE_MINUEND_PLACES=1327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=22623, PETRI_PLACES=1456, PETRI_TRANSITIONS=1710} [2022-01-19 00:45:55,625 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 1227 predicate places. [2022-01-19 00:45:55,625 INFO L470 AbstractCegarLoop]: Abstraction has has 1456 places, 1710 transitions, 22623 flow [2022-01-19 00:45:55,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:55,625 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:55,625 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:55,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 00:45:55,626 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:45:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -964479177, now seen corresponding path program 14 times [2022-01-19 00:45:55,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240570863] [2022-01-19 00:45:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:55,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:55,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240570863] [2022-01-19 00:45:55,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240570863] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:55,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:55,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 00:45:55,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696352115] [2022-01-19 00:45:55,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:55,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:45:55,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:45:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-01-19 00:45:55,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 252 [2022-01-19 00:45:55,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1456 places, 1710 transitions, 22623 flow. Second operand has 27 states, 27 states have (on average 174.2962962962963) internal successors, (4706), 27 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:55,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:55,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 252 [2022-01-19 00:45:55,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand