/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-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:05:14,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:05:14,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:05:14,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:05:14,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:05:14,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:05:14,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:05:14,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:05:14,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:05:14,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:05:14,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:05:14,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:05:14,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:05:14,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:05:14,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:05:14,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:05:14,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:05:14,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:05:14,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:05:14,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:05:14,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:05:14,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:05:14,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:05:14,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:05:14,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:05:14,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:05:14,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:05:14,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:05:14,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:05:14,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:05:14,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:05:14,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:05:14,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:05:14,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:05:14,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:05:14,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:05:14,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:05:14,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:05:14,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:05:14,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:05:14,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:05:14,678 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-After.epf [2022-01-19 13:05:14,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:05:14,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:05:14,704 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:05:14,704 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:05:14,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:05:14,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:05:14,705 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:05:14,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:05:14,705 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:05:14,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:05:14,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:05:14,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:05:14,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:05:14,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:05:14,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:05:14,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:05:14,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:05:14,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:05:14,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:05:14,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:05:14,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:05:14,708 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:05:14,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:05:14,708 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:05:14,708 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 13:05:14,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:05:14,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:05:14,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:05:14,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:05:14,901 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:05:14,902 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2022-01-19 13:05:14,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1b9d146/4fc18d77698a42c78d8d4e45a9ce0907/FLAG688dcfb14 [2022-01-19 13:05:15,309 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:05:15,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2022-01-19 13:05:15,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1b9d146/4fc18d77698a42c78d8d4e45a9ce0907/FLAG688dcfb14 [2022-01-19 13:05:15,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1b9d146/4fc18d77698a42c78d8d4e45a9ce0907 [2022-01-19 13:05:15,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:05:15,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:05:15,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:05:15,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:05:15,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:05:15,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66066deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15, skipping insertion in model container [2022-01-19 13:05:15,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:05:15,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:05:15,480 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-subst.wvr.c[3017,3030] [2022-01-19 13:05:15,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:05:15,488 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:05:15,508 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-subst.wvr.c[3017,3030] [2022-01-19 13:05:15,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:05:15,518 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:05:15,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15 WrapperNode [2022-01-19 13:05:15,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:05:15,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:05:15,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:05:15,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:05:15,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,558 INFO L137 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 254 [2022-01-19 13:05:15,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:05:15,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:05:15,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:05:15,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:05:15,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:05:15,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:05:15,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:05:15,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:05:15,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (1/1) ... [2022-01-19 13:05:15,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:05:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:05:15,607 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 13:05:15,608 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 13:05:15,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:05:15,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:05:15,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:05:15,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:05:15,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:05:15,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:05:15,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:05:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:05:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:05:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:05:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:05:15,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:05:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:05:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:05:15,633 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 13:05:15,739 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:05:15,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:05:16,047 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:05:16,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:05:16,055 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 13:05:16,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:05:16 BoogieIcfgContainer [2022-01-19 13:05:16,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:05:16,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:05:16,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:05:16,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:05:16,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:05:15" (1/3) ... [2022-01-19 13:05:16,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6cf0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:05:16, skipping insertion in model container [2022-01-19 13:05:16,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:15" (2/3) ... [2022-01-19 13:05:16,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6cf0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:05:16, skipping insertion in model container [2022-01-19 13:05:16,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:05:16" (3/3) ... [2022-01-19 13:05:16,063 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2022-01-19 13:05:16,067 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:05:16,067 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:05:16,067 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:05:16,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,119 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,169 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 13:05:16,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,170 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 13:05:16,170 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 13:05:16,170 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 13:05:16,170 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 13:05:16,170 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 13:05:16,170 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 13:05:16,170 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 13:05:16,171 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 13:05:16,174 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 13:05:16,175 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 13:05:16,175 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 13:05:16,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,175 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 13:05:16,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,176 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 13:05:16,176 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 13:05:16,176 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 13:05:16,176 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 13:05:16,176 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 13:05:16,176 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 13:05:16,177 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 13:05:16,177 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 13:05:16,184 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 13:05:16,184 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 13:05:16,184 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 13:05:16,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,184 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,189 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 13:05:16,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,190 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 13:05:16,190 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 13:05:16,190 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 13:05:16,190 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 13:05:16,190 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 13:05:16,190 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 13:05:16,190 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 13:05:16,191 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 13:05:16,191 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 13:05:16,191 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 13:05:16,191 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 13:05:16,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,191 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 13:05:16,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,191 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,192 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 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,193 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,194 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,201 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,204 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,205 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,206 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,206 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,206 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,206 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,206 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,210 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,210 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,212 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,213 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,213 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,213 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,213 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,213 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,213 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,217 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,217 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,217 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,217 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,218 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,219 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,223 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,223 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,224 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,224 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,224 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,225 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,225 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,225 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,226 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,227 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,228 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,229 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,230 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,231 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,232 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,233 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,234 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,235 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,242 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 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 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 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,246 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,247 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:16,254 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 13:05:16,288 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:05:16,292 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 13:05:16,292 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 13:05:16,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 333 places, 349 transitions, 722 flow [2022-01-19 13:05:16,399 INFO L129 PetriNetUnfolder]: 26/346 cut-off events. [2022-01-19 13:05:16,400 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:05:16,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 346 events. 26/346 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 633 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 256. Up to 2 conditions per place. [2022-01-19 13:05:16,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 349 transitions, 722 flow [2022-01-19 13:05:16,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 335 transitions, 688 flow [2022-01-19 13:05:16,472 INFO L129 PetriNetUnfolder]: 26/334 cut-off events. [2022-01-19 13:05:16,472 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:05:16,472 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:16,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:16,473 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -742994273, now seen corresponding path program 1 times [2022-01-19 13:05:16,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:16,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322830242] [2022-01-19 13:05:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:16,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:16,912 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 13:05:16,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:16,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322830242] [2022-01-19 13:05:16,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322830242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:16,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:16,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:05:16,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564067765] [2022-01-19 13:05:16,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:16,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:05:16,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:05:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:05:16,947 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 349 [2022-01-19 13:05:16,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 335 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 316.0) internal successors, (1896), 6 states have internal predecessors, (1896), 0 states have call successors, (0), 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 13:05:16,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:16,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 349 [2022-01-19 13:05:16,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:17,144 INFO L129 PetriNetUnfolder]: 31/543 cut-off events. [2022-01-19 13:05:17,144 INFO L130 PetriNetUnfolder]: For 33/39 co-relation queries the response was YES. [2022-01-19 13:05:17,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 543 events. 31/543 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1602 event pairs, 6 based on Foata normal form. 77/572 useless extension candidates. Maximal degree in co-relation 509. Up to 31 conditions per place. [2022-01-19 13:05:17,152 INFO L132 encePairwiseOnDemand]: 327/349 looper letters, 26 selfloop transitions, 3 changer transitions 7/336 dead transitions. [2022-01-19 13:05:17,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 336 transitions, 789 flow [2022-01-19 13:05:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 13:05:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 13:05:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2580 transitions. [2022-01-19 13:05:17,170 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240687679083095 [2022-01-19 13:05:17,171 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2580 transitions. [2022-01-19 13:05:17,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2580 transitions. [2022-01-19 13:05:17,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:17,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2580 transitions. [2022-01-19 13:05:17,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 322.5) internal successors, (2580), 8 states have internal predecessors, (2580), 0 states have call successors, (0), 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 13:05:17,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 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 13:05:17,198 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 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 13:05:17,199 INFO L186 Difference]: Start difference. First operand has 319 places, 335 transitions, 688 flow. Second operand 8 states and 2580 transitions. [2022-01-19 13:05:17,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 336 transitions, 789 flow [2022-01-19 13:05:17,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 336 transitions, 759 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 13:05:17,211 INFO L242 Difference]: Finished difference. Result has 325 places, 321 transitions, 669 flow [2022-01-19 13:05:17,213 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=669, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2022-01-19 13:05:17,218 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 6 predicate places. [2022-01-19 13:05:17,219 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 669 flow [2022-01-19 13:05:17,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.0) internal successors, (1896), 6 states have internal predecessors, (1896), 0 states have call successors, (0), 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 13:05:17,220 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:17,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:17,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:05:17,221 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1186332343, now seen corresponding path program 1 times [2022-01-19 13:05:17,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362954535] [2022-01-19 13:05:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:17,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:17,445 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 13:05:17,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:17,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362954535] [2022-01-19 13:05:17,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362954535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:17,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:17,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:05:17,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433913527] [2022-01-19 13:05:17,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:17,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:05:17,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:05:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:05:17,451 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:17,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 669 flow. Second operand has 7 states, 7 states have (on average 312.85714285714283) internal successors, (2190), 7 states have internal predecessors, (2190), 0 states have call successors, (0), 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 13:05:17,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:17,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:17,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:17,659 INFO L129 PetriNetUnfolder]: 54/751 cut-off events. [2022-01-19 13:05:17,660 INFO L130 PetriNetUnfolder]: For 26/44 co-relation queries the response was YES. [2022-01-19 13:05:17,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 751 events. 54/751 cut-off events. For 26/44 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3042 event pairs, 18 based on Foata normal form. 1/683 useless extension candidates. Maximal degree in co-relation 893. Up to 64 conditions per place. [2022-01-19 13:05:17,668 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 33 selfloop transitions, 5 changer transitions 6/341 dead transitions. [2022-01-19 13:05:17,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 341 transitions, 818 flow [2022-01-19 13:05:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:05:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:05:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2833 transitions. [2022-01-19 13:05:17,672 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9019420566698504 [2022-01-19 13:05:17,672 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2833 transitions. [2022-01-19 13:05:17,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2833 transitions. [2022-01-19 13:05:17,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:17,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2833 transitions. [2022-01-19 13:05:17,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 314.77777777777777) internal successors, (2833), 9 states have internal predecessors, (2833), 0 states have call successors, (0), 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 13:05:17,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 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 13:05:17,683 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 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 13:05:17,683 INFO L186 Difference]: Start difference. First operand has 325 places, 321 transitions, 669 flow. Second operand 9 states and 2833 transitions. [2022-01-19 13:05:17,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 341 transitions, 818 flow [2022-01-19 13:05:17,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 341 transitions, 811 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-01-19 13:05:17,690 INFO L242 Difference]: Finished difference. Result has 332 places, 323 transitions, 697 flow [2022-01-19 13:05:17,691 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=697, PETRI_PLACES=332, PETRI_TRANSITIONS=323} [2022-01-19 13:05:17,735 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 13 predicate places. [2022-01-19 13:05:17,735 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 323 transitions, 697 flow [2022-01-19 13:05:17,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 312.85714285714283) internal successors, (2190), 7 states have internal predecessors, (2190), 0 states have call successors, (0), 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 13:05:17,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:17,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:17,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:05:17,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1589507655, now seen corresponding path program 1 times [2022-01-19 13:05:17,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:17,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147539910] [2022-01-19 13:05:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:17,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:17,924 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 13:05:17,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147539910] [2022-01-19 13:05:17,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147539910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:17,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:17,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:17,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673875928] [2022-01-19 13:05:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:17,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:17,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:17,930 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 349 [2022-01-19 13:05:17,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 323 transitions, 697 flow. Second operand has 8 states, 8 states have (on average 309.75) internal successors, (2478), 8 states have internal predecessors, (2478), 0 states have call successors, (0), 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 13:05:17,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:17,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 349 [2022-01-19 13:05:17,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:18,121 INFO L129 PetriNetUnfolder]: 67/775 cut-off events. [2022-01-19 13:05:18,121 INFO L130 PetriNetUnfolder]: For 51/77 co-relation queries the response was YES. [2022-01-19 13:05:18,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 775 events. 67/775 cut-off events. For 51/77 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3273 event pairs, 26 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 1013. Up to 84 conditions per place. [2022-01-19 13:05:18,132 INFO L132 encePairwiseOnDemand]: 338/349 looper letters, 41 selfloop transitions, 8 changer transitions 8/351 dead transitions. [2022-01-19 13:05:18,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 351 transitions, 904 flow [2022-01-19 13:05:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:05:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:05:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3738 transitions. [2022-01-19 13:05:18,137 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8925501432664756 [2022-01-19 13:05:18,137 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3738 transitions. [2022-01-19 13:05:18,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3738 transitions. [2022-01-19 13:05:18,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:18,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3738 transitions. [2022-01-19 13:05:18,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 311.5) internal successors, (3738), 12 states have internal predecessors, (3738), 0 states have call successors, (0), 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 13:05:18,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 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 13:05:18,150 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 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 13:05:18,150 INFO L186 Difference]: Start difference. First operand has 332 places, 323 transitions, 697 flow. Second operand 12 states and 3738 transitions. [2022-01-19 13:05:18,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 351 transitions, 904 flow [2022-01-19 13:05:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 351 transitions, 885 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-01-19 13:05:18,156 INFO L242 Difference]: Finished difference. Result has 343 places, 325 transitions, 729 flow [2022-01-19 13:05:18,157 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=343, PETRI_TRANSITIONS=325} [2022-01-19 13:05:18,158 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 24 predicate places. [2022-01-19 13:05:18,158 INFO L470 AbstractCegarLoop]: Abstraction has has 343 places, 325 transitions, 729 flow [2022-01-19 13:05:18,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 309.75) internal successors, (2478), 8 states have internal predecessors, (2478), 0 states have call successors, (0), 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 13:05:18,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:18,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:18,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:05:18,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash -232079166, now seen corresponding path program 1 times [2022-01-19 13:05:18,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:18,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295737898] [2022-01-19 13:05:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:18,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:18,298 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 13:05:18,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:18,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295737898] [2022-01-19 13:05:18,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295737898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:18,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:18,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 13:05:18,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981185545] [2022-01-19 13:05:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:18,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:05:18,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:18,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:05:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:05:18,305 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 349 [2022-01-19 13:05:18,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 325 transitions, 729 flow. Second operand has 9 states, 9 states have (on average 306.6666666666667) internal successors, (2760), 9 states have internal predecessors, (2760), 0 states have call successors, (0), 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 13:05:18,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:18,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 349 [2022-01-19 13:05:18,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:18,540 INFO L129 PetriNetUnfolder]: 88/957 cut-off events. [2022-01-19 13:05:18,540 INFO L130 PetriNetUnfolder]: For 96/130 co-relation queries the response was YES. [2022-01-19 13:05:18,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 957 events. 88/957 cut-off events. For 96/130 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4751 event pairs, 36 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 1301. Up to 109 conditions per place. [2022-01-19 13:05:18,552 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 48 selfloop transitions, 10 changer transitions 10/359 dead transitions. [2022-01-19 13:05:18,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 359 transitions, 984 flow [2022-01-19 13:05:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 13:05:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 13:05:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4319 transitions. [2022-01-19 13:05:18,558 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839541547277937 [2022-01-19 13:05:18,558 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4319 transitions. [2022-01-19 13:05:18,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4319 transitions. [2022-01-19 13:05:18,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:18,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4319 transitions. [2022-01-19 13:05:18,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 308.5) internal successors, (4319), 14 states have internal predecessors, (4319), 0 states have call successors, (0), 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 13:05:18,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 349.0) internal successors, (5235), 15 states have internal predecessors, (5235), 0 states have call successors, (0), 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 13:05:18,572 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 349.0) internal successors, (5235), 15 states have internal predecessors, (5235), 0 states have call successors, (0), 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 13:05:18,572 INFO L186 Difference]: Start difference. First operand has 343 places, 325 transitions, 729 flow. Second operand 14 states and 4319 transitions. [2022-01-19 13:05:18,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 359 transitions, 984 flow [2022-01-19 13:05:18,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 359 transitions, 950 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-01-19 13:05:18,579 INFO L242 Difference]: Finished difference. Result has 354 places, 327 transitions, 760 flow [2022-01-19 13:05:18,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=760, PETRI_PLACES=354, PETRI_TRANSITIONS=327} [2022-01-19 13:05:18,580 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 35 predicate places. [2022-01-19 13:05:18,580 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 327 transitions, 760 flow [2022-01-19 13:05:18,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 306.6666666666667) internal successors, (2760), 9 states have internal predecessors, (2760), 0 states have call successors, (0), 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 13:05:18,590 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:18,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:05:18,590 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:18,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:18,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1840379948, now seen corresponding path program 1 times [2022-01-19 13:05:18,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:18,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838242901] [2022-01-19 13:05:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:18,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:18,700 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 13:05:18,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838242901] [2022-01-19 13:05:18,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838242901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:18,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:18,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:18,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903969606] [2022-01-19 13:05:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:18,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:18,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:18,705 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 13:05:18,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 327 transitions, 760 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:18,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:18,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 13:05:18,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:18,950 INFO L129 PetriNetUnfolder]: 179/969 cut-off events. [2022-01-19 13:05:18,951 INFO L130 PetriNetUnfolder]: For 127/143 co-relation queries the response was YES. [2022-01-19 13:05:18,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 969 events. 179/969 cut-off events. For 127/143 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5687 event pairs, 66 based on Foata normal form. 5/899 useless extension candidates. Maximal degree in co-relation 1328. Up to 154 conditions per place. [2022-01-19 13:05:18,963 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 49 selfloop transitions, 3 changer transitions 26/381 dead transitions. [2022-01-19 13:05:18,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 381 transitions, 1058 flow [2022-01-19 13:05:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:05:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:05:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 4083 transitions. [2022-01-19 13:05:18,970 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.899933877011241 [2022-01-19 13:05:18,970 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 4083 transitions. [2022-01-19 13:05:18,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 4083 transitions. [2022-01-19 13:05:18,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:18,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 4083 transitions. [2022-01-19 13:05:18,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 314.0769230769231) internal successors, (4083), 13 states have internal predecessors, (4083), 0 states have call successors, (0), 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 13:05:18,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 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 13:05:18,982 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 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 13:05:18,982 INFO L186 Difference]: Start difference. First operand has 354 places, 327 transitions, 760 flow. Second operand 13 states and 4083 transitions. [2022-01-19 13:05:18,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 381 transitions, 1058 flow [2022-01-19 13:05:18,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 381 transitions, 1012 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-01-19 13:05:18,987 INFO L242 Difference]: Finished difference. Result has 360 places, 329 transitions, 769 flow [2022-01-19 13:05:18,988 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=769, PETRI_PLACES=360, PETRI_TRANSITIONS=329} [2022-01-19 13:05:18,990 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 41 predicate places. [2022-01-19 13:05:18,990 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 329 transitions, 769 flow [2022-01-19 13:05:18,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:18,990 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:18,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:18,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:05:18,991 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -27308194, now seen corresponding path program 2 times [2022-01-19 13:05:18,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966466822] [2022-01-19 13:05:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:18,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:19,098 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 13:05:19,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:19,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966466822] [2022-01-19 13:05:19,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966466822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:19,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:19,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:19,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176452488] [2022-01-19 13:05:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:19,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:19,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:19,102 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 13:05:19,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 329 transitions, 769 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:19,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:19,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 13:05:19,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:19,395 INFO L129 PetriNetUnfolder]: 255/1411 cut-off events. [2022-01-19 13:05:19,395 INFO L130 PetriNetUnfolder]: For 780/805 co-relation queries the response was YES. [2022-01-19 13:05:19,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1411 events. 255/1411 cut-off events. For 780/805 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10442 event pairs, 130 based on Foata normal form. 1/1299 useless extension candidates. Maximal degree in co-relation 2451. Up to 257 conditions per place. [2022-01-19 13:05:19,414 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 56 selfloop transitions, 3 changer transitions 25/387 dead transitions. [2022-01-19 13:05:19,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 387 transitions, 1182 flow [2022-01-19 13:05:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:05:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:05:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 4081 transitions. [2022-01-19 13:05:19,420 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8994930570861803 [2022-01-19 13:05:19,420 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 4081 transitions. [2022-01-19 13:05:19,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 4081 transitions. [2022-01-19 13:05:19,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:19,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 4081 transitions. [2022-01-19 13:05:19,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 313.9230769230769) internal successors, (4081), 13 states have internal predecessors, (4081), 0 states have call successors, (0), 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 13:05:19,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 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 13:05:19,431 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 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 13:05:19,431 INFO L186 Difference]: Start difference. First operand has 360 places, 329 transitions, 769 flow. Second operand 13 states and 4081 transitions. [2022-01-19 13:05:19,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 387 transitions, 1182 flow [2022-01-19 13:05:19,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 387 transitions, 1140 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-01-19 13:05:19,439 INFO L242 Difference]: Finished difference. Result has 368 places, 331 transitions, 803 flow [2022-01-19 13:05:19,439 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=803, PETRI_PLACES=368, PETRI_TRANSITIONS=331} [2022-01-19 13:05:19,441 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 49 predicate places. [2022-01-19 13:05:19,441 INFO L470 AbstractCegarLoop]: Abstraction has has 368 places, 331 transitions, 803 flow [2022-01-19 13:05:19,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:19,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:19,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:19,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:05:19,442 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash 157564496, now seen corresponding path program 3 times [2022-01-19 13:05:19,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:19,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012063321] [2022-01-19 13:05:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:19,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:19,577 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 13:05:19,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:19,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012063321] [2022-01-19 13:05:19,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012063321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:19,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:19,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:19,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315149131] [2022-01-19 13:05:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:19,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:19,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:19,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:19,583 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 13:05:19,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 331 transitions, 803 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:19,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:19,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 13:05:19,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:19,878 INFO L129 PetriNetUnfolder]: 270/1432 cut-off events. [2022-01-19 13:05:19,879 INFO L130 PetriNetUnfolder]: For 1504/1523 co-relation queries the response was YES. [2022-01-19 13:05:19,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1432 events. 270/1432 cut-off events. For 1504/1523 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10660 event pairs, 163 based on Foata normal form. 1/1312 useless extension candidates. Maximal degree in co-relation 2853. Up to 350 conditions per place. [2022-01-19 13:05:19,897 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 38 selfloop transitions, 8 changer transitions 20/369 dead transitions. [2022-01-19 13:05:19,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 1143 flow [2022-01-19 13:05:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:05:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:05:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3759 transitions. [2022-01-19 13:05:19,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8975644699140402 [2022-01-19 13:05:19,902 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3759 transitions. [2022-01-19 13:05:19,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3759 transitions. [2022-01-19 13:05:19,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:19,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3759 transitions. [2022-01-19 13:05:19,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 313.25) internal successors, (3759), 12 states have internal predecessors, (3759), 0 states have call successors, (0), 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 13:05:19,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 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 13:05:19,913 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 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 13:05:19,913 INFO L186 Difference]: Start difference. First operand has 368 places, 331 transitions, 803 flow. Second operand 12 states and 3759 transitions. [2022-01-19 13:05:19,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 1143 flow [2022-01-19 13:05:19,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 369 transitions, 1115 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-01-19 13:05:19,922 INFO L242 Difference]: Finished difference. Result has 371 places, 338 transitions, 893 flow [2022-01-19 13:05:19,923 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=893, PETRI_PLACES=371, PETRI_TRANSITIONS=338} [2022-01-19 13:05:19,923 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 52 predicate places. [2022-01-19 13:05:19,923 INFO L470 AbstractCegarLoop]: Abstraction has has 371 places, 338 transitions, 893 flow [2022-01-19 13:05:19,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:19,924 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:19,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:19,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:05:19,924 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2047788938, now seen corresponding path program 4 times [2022-01-19 13:05:19,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:19,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447451349] [2022-01-19 13:05:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:19,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:20,023 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 13:05:20,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447451349] [2022-01-19 13:05:20,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447451349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:20,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:20,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:20,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969459555] [2022-01-19 13:05:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:20,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:20,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:20,026 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 13:05:20,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 338 transitions, 893 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:20,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:20,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 13:05:20,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:20,379 INFO L129 PetriNetUnfolder]: 262/1412 cut-off events. [2022-01-19 13:05:20,379 INFO L130 PetriNetUnfolder]: For 1807/1837 co-relation queries the response was YES. [2022-01-19 13:05:20,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1412 events. 262/1412 cut-off events. For 1807/1837 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10482 event pairs, 151 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 2963. Up to 346 conditions per place. [2022-01-19 13:05:20,395 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 38 selfloop transitions, 12 changer transitions 19/372 dead transitions. [2022-01-19 13:05:20,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 372 transitions, 1231 flow [2022-01-19 13:05:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:05:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:05:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3450 transitions. [2022-01-19 13:05:20,400 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8986715290440219 [2022-01-19 13:05:20,400 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3450 transitions. [2022-01-19 13:05:20,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3450 transitions. [2022-01-19 13:05:20,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:20,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3450 transitions. [2022-01-19 13:05:20,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 313.6363636363636) internal successors, (3450), 11 states have internal predecessors, (3450), 0 states have call successors, (0), 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 13:05:20,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 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 13:05:20,410 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 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 13:05:20,410 INFO L186 Difference]: Start difference. First operand has 371 places, 338 transitions, 893 flow. Second operand 11 states and 3450 transitions. [2022-01-19 13:05:20,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 372 transitions, 1231 flow [2022-01-19 13:05:20,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 372 transitions, 1209 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-01-19 13:05:20,420 INFO L242 Difference]: Finished difference. Result has 380 places, 343 transitions, 984 flow [2022-01-19 13:05:20,421 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=984, PETRI_PLACES=380, PETRI_TRANSITIONS=343} [2022-01-19 13:05:20,421 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 61 predicate places. [2022-01-19 13:05:20,421 INFO L470 AbstractCegarLoop]: Abstraction has has 380 places, 343 transitions, 984 flow [2022-01-19 13:05:20,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:20,422 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:20,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:05:20,422 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1545102218, now seen corresponding path program 5 times [2022-01-19 13:05:20,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:20,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331951392] [2022-01-19 13:05:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:20,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:20,538 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 13:05:20,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331951392] [2022-01-19 13:05:20,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331951392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:20,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:20,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:20,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877272436] [2022-01-19 13:05:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:20,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:20,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:20,542 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 13:05:20,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 343 transitions, 984 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:20,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:20,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 13:05:20,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:20,866 INFO L129 PetriNetUnfolder]: 247/1398 cut-off events. [2022-01-19 13:05:20,867 INFO L130 PetriNetUnfolder]: For 2357/2376 co-relation queries the response was YES. [2022-01-19 13:05:20,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1398 events. 247/1398 cut-off events. For 2357/2376 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10446 event pairs, 155 based on Foata normal form. 1/1283 useless extension candidates. Maximal degree in co-relation 3057. Up to 347 conditions per place. [2022-01-19 13:05:20,885 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 36 selfloop transitions, 4 changer transitions 26/369 dead transitions. [2022-01-19 13:05:20,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 369 transitions, 1263 flow [2022-01-19 13:05:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:05:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:05:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3446 transitions. [2022-01-19 13:05:20,890 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8976295910393332 [2022-01-19 13:05:20,890 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3446 transitions. [2022-01-19 13:05:20,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3446 transitions. [2022-01-19 13:05:20,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:20,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3446 transitions. [2022-01-19 13:05:20,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 313.27272727272725) internal successors, (3446), 11 states have internal predecessors, (3446), 0 states have call successors, (0), 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 13:05:20,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 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 13:05:20,899 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 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 13:05:20,899 INFO L186 Difference]: Start difference. First operand has 380 places, 343 transitions, 984 flow. Second operand 11 states and 3446 transitions. [2022-01-19 13:05:20,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 369 transitions, 1263 flow [2022-01-19 13:05:20,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 369 transitions, 1220 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-01-19 13:05:20,910 INFO L242 Difference]: Finished difference. Result has 385 places, 337 transitions, 898 flow [2022-01-19 13:05:20,910 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=898, PETRI_PLACES=385, PETRI_TRANSITIONS=337} [2022-01-19 13:05:20,910 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 66 predicate places. [2022-01-19 13:05:20,911 INFO L470 AbstractCegarLoop]: Abstraction has has 385 places, 337 transitions, 898 flow [2022-01-19 13:05:20,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:20,911 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:20,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:20,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:05:20,912 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2112607538, now seen corresponding path program 6 times [2022-01-19 13:05:20,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136529476] [2022-01-19 13:05:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:20,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:21,008 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 13:05:21,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:21,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136529476] [2022-01-19 13:05:21,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136529476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:21,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:21,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:21,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798390451] [2022-01-19 13:05:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:21,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:21,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:21,012 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 13:05:21,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 337 transitions, 898 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:21,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:21,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 13:05:21,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:21,291 INFO L129 PetriNetUnfolder]: 221/1226 cut-off events. [2022-01-19 13:05:21,291 INFO L130 PetriNetUnfolder]: For 2122/2146 co-relation queries the response was YES. [2022-01-19 13:05:21,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1226 events. 221/1226 cut-off events. For 2122/2146 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8559 event pairs, 145 based on Foata normal form. 2/1121 useless extension candidates. Maximal degree in co-relation 2618. Up to 300 conditions per place. [2022-01-19 13:05:21,303 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 31 selfloop transitions, 2 changer transitions 28/364 dead transitions. [2022-01-19 13:05:21,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 364 transitions, 1162 flow [2022-01-19 13:05:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:05:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:05:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3756 transitions. [2022-01-19 13:05:21,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8968481375358166 [2022-01-19 13:05:21,308 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3756 transitions. [2022-01-19 13:05:21,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3756 transitions. [2022-01-19 13:05:21,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:21,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3756 transitions. [2022-01-19 13:05:21,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 313.0) internal successors, (3756), 12 states have internal predecessors, (3756), 0 states have call successors, (0), 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 13:05:21,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 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 13:05:21,318 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 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 13:05:21,318 INFO L186 Difference]: Start difference. First operand has 385 places, 337 transitions, 898 flow. Second operand 12 states and 3756 transitions. [2022-01-19 13:05:21,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 364 transitions, 1162 flow [2022-01-19 13:05:21,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 364 transitions, 1112 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-01-19 13:05:21,327 INFO L242 Difference]: Finished difference. Result has 380 places, 331 transitions, 826 flow [2022-01-19 13:05:21,328 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=826, PETRI_PLACES=380, PETRI_TRANSITIONS=331} [2022-01-19 13:05:21,328 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 61 predicate places. [2022-01-19 13:05:21,329 INFO L470 AbstractCegarLoop]: Abstraction has has 380 places, 331 transitions, 826 flow [2022-01-19 13:05:21,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 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 13:05:21,329 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:21,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:21,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:05:21,329 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1595665028, now seen corresponding path program 1 times [2022-01-19 13:05:21,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:21,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930829650] [2022-01-19 13:05:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:21,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:21,382 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 13:05:21,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:21,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930829650] [2022-01-19 13:05:21,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930829650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:21,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:21,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:21,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323399702] [2022-01-19 13:05:21,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:21,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:21,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:21,384 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:21,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 331 transitions, 826 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:21,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:21,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:21,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:21,805 INFO L129 PetriNetUnfolder]: 560/3302 cut-off events. [2022-01-19 13:05:21,805 INFO L130 PetriNetUnfolder]: For 2780/2878 co-relation queries the response was YES. [2022-01-19 13:05:21,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 3302 events. 560/3302 cut-off events. For 2780/2878 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29590 event pairs, 318 based on Foata normal form. 7/2795 useless extension candidates. Maximal degree in co-relation 5917. Up to 427 conditions per place. [2022-01-19 13:05:21,838 INFO L132 encePairwiseOnDemand]: 345/349 looper letters, 37 selfloop transitions, 2 changer transitions 4/348 dead transitions. [2022-01-19 13:05:21,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 348 transitions, 949 flow [2022-01-19 13:05:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:05:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:05:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1283 transitions. [2022-01-19 13:05:21,840 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.919054441260745 [2022-01-19 13:05:21,840 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1283 transitions. [2022-01-19 13:05:21,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1283 transitions. [2022-01-19 13:05:21,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:21,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1283 transitions. [2022-01-19 13:05:21,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 320.75) internal successors, (1283), 4 states have internal predecessors, (1283), 0 states have call successors, (0), 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 13:05:21,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:21,843 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:21,843 INFO L186 Difference]: Start difference. First operand has 380 places, 331 transitions, 826 flow. Second operand 4 states and 1283 transitions. [2022-01-19 13:05:21,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 348 transitions, 949 flow [2022-01-19 13:05:21,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 348 transitions, 921 flow, removed 10 selfloop flow, removed 13 redundant places. [2022-01-19 13:05:21,860 INFO L242 Difference]: Finished difference. Result has 360 places, 330 transitions, 803 flow [2022-01-19 13:05:21,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=803, PETRI_PLACES=360, PETRI_TRANSITIONS=330} [2022-01-19 13:05:21,860 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 41 predicate places. [2022-01-19 13:05:21,860 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 330 transitions, 803 flow [2022-01-19 13:05:21,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:21,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:21,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:21,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 13:05:21,861 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1521460524, now seen corresponding path program 2 times [2022-01-19 13:05:21,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:21,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054341405] [2022-01-19 13:05:21,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:21,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:21,904 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 13:05:21,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:21,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054341405] [2022-01-19 13:05:21,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054341405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:21,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:21,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:21,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49470057] [2022-01-19 13:05:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:21,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:21,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:21,907 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:21,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 330 transitions, 803 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:21,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:21,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:21,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:22,337 INFO L129 PetriNetUnfolder]: 477/3426 cut-off events. [2022-01-19 13:05:22,337 INFO L130 PetriNetUnfolder]: For 1643/1728 co-relation queries the response was YES. [2022-01-19 13:05:22,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 3426 events. 477/3426 cut-off events. For 1643/1728 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 32829 event pairs, 140 based on Foata normal form. 16/3146 useless extension candidates. Maximal degree in co-relation 5362. Up to 314 conditions per place. [2022-01-19 13:05:22,378 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 47 selfloop transitions, 8 changer transitions 1/361 dead transitions. [2022-01-19 13:05:22,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 361 transitions, 1003 flow [2022-01-19 13:05:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1607 transitions. [2022-01-19 13:05:22,380 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9209169054441261 [2022-01-19 13:05:22,380 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1607 transitions. [2022-01-19 13:05:22,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1607 transitions. [2022-01-19 13:05:22,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:22,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1607 transitions. [2022-01-19 13:05:22,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.4) internal successors, (1607), 5 states have internal predecessors, (1607), 0 states have call successors, (0), 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 13:05:22,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:22,384 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:22,384 INFO L186 Difference]: Start difference. First operand has 360 places, 330 transitions, 803 flow. Second operand 5 states and 1607 transitions. [2022-01-19 13:05:22,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 361 transitions, 1003 flow [2022-01-19 13:05:22,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 361 transitions, 997 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 13:05:22,398 INFO L242 Difference]: Finished difference. Result has 360 places, 337 transitions, 864 flow [2022-01-19 13:05:22,399 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=864, PETRI_PLACES=360, PETRI_TRANSITIONS=337} [2022-01-19 13:05:22,399 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 41 predicate places. [2022-01-19 13:05:22,399 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 337 transitions, 864 flow [2022-01-19 13:05:22,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:22,400 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:22,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:22,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 13:05:22,400 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1161190256, now seen corresponding path program 3 times [2022-01-19 13:05:22,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:22,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006607636] [2022-01-19 13:05:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:22,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:22,437 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 13:05:22,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:22,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006607636] [2022-01-19 13:05:22,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006607636] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:22,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:22,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:22,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726102170] [2022-01-19 13:05:22,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:22,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:22,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:22,440 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:22,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 337 transitions, 864 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:22,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:22,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:22,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:22,967 INFO L129 PetriNetUnfolder]: 619/4557 cut-off events. [2022-01-19 13:05:22,967 INFO L130 PetriNetUnfolder]: For 3052/3180 co-relation queries the response was YES. [2022-01-19 13:05:22,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8185 conditions, 4557 events. 619/4557 cut-off events. For 3052/3180 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 45101 event pairs, 408 based on Foata normal form. 14/4147 useless extension candidates. Maximal degree in co-relation 6982. Up to 475 conditions per place. [2022-01-19 13:05:23,001 INFO L132 encePairwiseOnDemand]: 345/349 looper letters, 45 selfloop transitions, 4 changer transitions 1/355 dead transitions. [2022-01-19 13:05:23,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 1036 flow [2022-01-19 13:05:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:05:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:05:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1282 transitions. [2022-01-19 13:05:23,003 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9183381088825215 [2022-01-19 13:05:23,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1282 transitions. [2022-01-19 13:05:23,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1282 transitions. [2022-01-19 13:05:23,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:23,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1282 transitions. [2022-01-19 13:05:23,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 320.5) internal successors, (1282), 4 states have internal predecessors, (1282), 0 states have call successors, (0), 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 13:05:23,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:23,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:23,006 INFO L186 Difference]: Start difference. First operand has 360 places, 337 transitions, 864 flow. Second operand 4 states and 1282 transitions. [2022-01-19 13:05:23,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 355 transitions, 1036 flow [2022-01-19 13:05:23,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 355 transitions, 1026 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-01-19 13:05:23,018 INFO L242 Difference]: Finished difference. Result has 365 places, 338 transitions, 883 flow [2022-01-19 13:05:23,019 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=883, PETRI_PLACES=365, PETRI_TRANSITIONS=338} [2022-01-19 13:05:23,019 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 46 predicate places. [2022-01-19 13:05:23,019 INFO L470 AbstractCegarLoop]: Abstraction has has 365 places, 338 transitions, 883 flow [2022-01-19 13:05:23,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:23,019 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:23,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:23,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:05:23,020 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash -773437546, now seen corresponding path program 4 times [2022-01-19 13:05:23,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:23,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368864628] [2022-01-19 13:05:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:23,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:23,067 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 13:05:23,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368864628] [2022-01-19 13:05:23,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368864628] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:23,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:23,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:23,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74490376] [2022-01-19 13:05:23,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:23,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:23,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:23,069 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:23,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 338 transitions, 883 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:23,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:23,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:23,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:23,640 INFO L129 PetriNetUnfolder]: 547/4175 cut-off events. [2022-01-19 13:05:23,641 INFO L130 PetriNetUnfolder]: For 3851/3952 co-relation queries the response was YES. [2022-01-19 13:05:23,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8323 conditions, 4175 events. 547/4175 cut-off events. For 3851/3952 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 42253 event pairs, 246 based on Foata normal form. 24/3952 useless extension candidates. Maximal degree in co-relation 7106. Up to 361 conditions per place. [2022-01-19 13:05:23,679 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 48 selfloop transitions, 12 changer transitions 5/370 dead transitions. [2022-01-19 13:05:23,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 370 transitions, 1162 flow [2022-01-19 13:05:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1606 transitions. [2022-01-19 13:05:23,682 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9203438395415473 [2022-01-19 13:05:23,682 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1606 transitions. [2022-01-19 13:05:23,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1606 transitions. [2022-01-19 13:05:23,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:23,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1606 transitions. [2022-01-19 13:05:23,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.2) internal successors, (1606), 5 states have internal predecessors, (1606), 0 states have call successors, (0), 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 13:05:23,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:23,686 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:23,686 INFO L186 Difference]: Start difference. First operand has 365 places, 338 transitions, 883 flow. Second operand 5 states and 1606 transitions. [2022-01-19 13:05:23,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 370 transitions, 1162 flow [2022-01-19 13:05:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 370 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:23,708 INFO L242 Difference]: Finished difference. Result has 372 places, 346 transitions, 987 flow [2022-01-19 13:05:23,708 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=987, PETRI_PLACES=372, PETRI_TRANSITIONS=346} [2022-01-19 13:05:23,709 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 53 predicate places. [2022-01-19 13:05:23,709 INFO L470 AbstractCegarLoop]: Abstraction has has 372 places, 346 transitions, 987 flow [2022-01-19 13:05:23,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:23,709 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:23,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:23,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:05:23,710 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash 90776712, now seen corresponding path program 5 times [2022-01-19 13:05:23,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:23,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131889807] [2022-01-19 13:05:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:23,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:23,760 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 13:05:23,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:23,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131889807] [2022-01-19 13:05:23,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131889807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:23,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:23,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:23,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213914142] [2022-01-19 13:05:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:23,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:23,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:23,763 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:23,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 346 transitions, 987 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:23,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:23,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:23,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:24,440 INFO L129 PetriNetUnfolder]: 569/4622 cut-off events. [2022-01-19 13:05:24,440 INFO L130 PetriNetUnfolder]: For 4614/4690 co-relation queries the response was YES. [2022-01-19 13:05:24,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9089 conditions, 4622 events. 569/4622 cut-off events. For 4614/4690 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 46908 event pairs, 333 based on Foata normal form. 22/4303 useless extension candidates. Maximal degree in co-relation 8034. Up to 393 conditions per place. [2022-01-19 13:05:24,469 INFO L132 encePairwiseOnDemand]: 339/349 looper letters, 57 selfloop transitions, 10 changer transitions 7/379 dead transitions. [2022-01-19 13:05:24,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 1291 flow [2022-01-19 13:05:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2022-01-19 13:05:24,471 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92378223495702 [2022-01-19 13:05:24,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2022-01-19 13:05:24,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2022-01-19 13:05:24,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:24,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2022-01-19 13:05:24,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 0 states have call successors, (0), 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 13:05:24,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:24,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:24,475 INFO L186 Difference]: Start difference. First operand has 372 places, 346 transitions, 987 flow. Second operand 5 states and 1612 transitions. [2022-01-19 13:05:24,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 1291 flow [2022-01-19 13:05:24,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 1273 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:24,493 INFO L242 Difference]: Finished difference. Result has 377 places, 349 transitions, 1038 flow [2022-01-19 13:05:24,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=377, PETRI_TRANSITIONS=349} [2022-01-19 13:05:24,494 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 58 predicate places. [2022-01-19 13:05:24,494 INFO L470 AbstractCegarLoop]: Abstraction has has 377 places, 349 transitions, 1038 flow [2022-01-19 13:05:24,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:24,495 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:24,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:24,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:05:24,495 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1887567964, now seen corresponding path program 1 times [2022-01-19 13:05:24,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:24,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712226350] [2022-01-19 13:05:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:24,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:24,536 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 13:05:24,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:24,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712226350] [2022-01-19 13:05:24,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712226350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:24,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:24,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:24,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813085883] [2022-01-19 13:05:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:24,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:24,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:24,540 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:24,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 349 transitions, 1038 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:24,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:24,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:24,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:25,160 INFO L129 PetriNetUnfolder]: 512/4437 cut-off events. [2022-01-19 13:05:25,161 INFO L130 PetriNetUnfolder]: For 4786/5070 co-relation queries the response was YES. [2022-01-19 13:05:25,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 4437 events. 512/4437 cut-off events. For 4786/5070 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 46298 event pairs, 221 based on Foata normal form. 12/4117 useless extension candidates. Maximal degree in co-relation 7690. Up to 301 conditions per place. [2022-01-19 13:05:25,207 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 67 selfloop transitions, 14 changer transitions 5/391 dead transitions. [2022-01-19 13:05:25,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 391 transitions, 1516 flow [2022-01-19 13:05:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1608 transitions. [2022-01-19 13:05:25,210 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9214899713467049 [2022-01-19 13:05:25,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1608 transitions. [2022-01-19 13:05:25,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1608 transitions. [2022-01-19 13:05:25,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:25,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1608 transitions. [2022-01-19 13:05:25,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.6) internal successors, (1608), 5 states have internal predecessors, (1608), 0 states have call successors, (0), 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 13:05:25,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:25,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:25,214 INFO L186 Difference]: Start difference. First operand has 377 places, 349 transitions, 1038 flow. Second operand 5 states and 1608 transitions. [2022-01-19 13:05:25,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 391 transitions, 1516 flow [2022-01-19 13:05:25,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 391 transitions, 1498 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-01-19 13:05:25,237 INFO L242 Difference]: Finished difference. Result has 380 places, 360 transitions, 1184 flow [2022-01-19 13:05:25,238 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1184, PETRI_PLACES=380, PETRI_TRANSITIONS=360} [2022-01-19 13:05:25,238 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 61 predicate places. [2022-01-19 13:05:25,238 INFO L470 AbstractCegarLoop]: Abstraction has has 380 places, 360 transitions, 1184 flow [2022-01-19 13:05:25,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:25,238 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:25,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:25,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 13:05:25,239 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1134796298, now seen corresponding path program 2 times [2022-01-19 13:05:25,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:25,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443434223] [2022-01-19 13:05:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:25,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:25,273 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 13:05:25,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:25,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443434223] [2022-01-19 13:05:25,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443434223] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:25,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:25,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:25,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917640883] [2022-01-19 13:05:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:25,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:25,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:25,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:25,275 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:25,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 360 transitions, 1184 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:25,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:25,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:25,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:25,872 INFO L129 PetriNetUnfolder]: 547/4727 cut-off events. [2022-01-19 13:05:25,873 INFO L130 PetriNetUnfolder]: For 5598/5914 co-relation queries the response was YES. [2022-01-19 13:05:25,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9128 conditions, 4727 events. 547/4727 cut-off events. For 5598/5914 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 47793 event pairs, 318 based on Foata normal form. 30/4358 useless extension candidates. Maximal degree in co-relation 9062. Up to 391 conditions per place. [2022-01-19 13:05:25,918 INFO L132 encePairwiseOnDemand]: 339/349 looper letters, 66 selfloop transitions, 16 changer transitions 4/391 dead transitions. [2022-01-19 13:05:25,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 391 transitions, 1530 flow [2022-01-19 13:05:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2022-01-19 13:05:25,920 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92378223495702 [2022-01-19 13:05:25,920 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2022-01-19 13:05:25,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2022-01-19 13:05:25,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:25,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2022-01-19 13:05:25,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 0 states have call successors, (0), 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 13:05:25,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:25,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:25,924 INFO L186 Difference]: Start difference. First operand has 380 places, 360 transitions, 1184 flow. Second operand 5 states and 1612 transitions. [2022-01-19 13:05:25,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 391 transitions, 1530 flow [2022-01-19 13:05:25,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 391 transitions, 1514 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:25,947 INFO L242 Difference]: Finished difference. Result has 386 places, 365 transitions, 1287 flow [2022-01-19 13:05:25,947 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1287, PETRI_PLACES=386, PETRI_TRANSITIONS=365} [2022-01-19 13:05:25,948 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 67 predicate places. [2022-01-19 13:05:25,948 INFO L470 AbstractCegarLoop]: Abstraction has has 386 places, 365 transitions, 1287 flow [2022-01-19 13:05:25,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:25,948 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:25,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:25,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 13:05:25,948 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1721851518, now seen corresponding path program 3 times [2022-01-19 13:05:25,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:25,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261472027] [2022-01-19 13:05:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:25,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:25,988 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 13:05:25,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:25,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261472027] [2022-01-19 13:05:25,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261472027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:25,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:25,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:25,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951606108] [2022-01-19 13:05:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:25,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:25,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:25,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:25,990 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:25,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 365 transitions, 1287 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:25,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:25,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:25,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:26,548 INFO L129 PetriNetUnfolder]: 441/3936 cut-off events. [2022-01-19 13:05:26,549 INFO L130 PetriNetUnfolder]: For 6155/6468 co-relation queries the response was YES. [2022-01-19 13:05:26,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8493 conditions, 3936 events. 441/3936 cut-off events. For 6155/6468 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 39176 event pairs, 204 based on Foata normal form. 11/3664 useless extension candidates. Maximal degree in co-relation 7279. Up to 281 conditions per place. [2022-01-19 13:05:26,582 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 68 selfloop transitions, 20 changer transitions 1/394 dead transitions. [2022-01-19 13:05:26,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 394 transitions, 1702 flow [2022-01-19 13:05:26,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2022-01-19 13:05:26,584 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9191977077363896 [2022-01-19 13:05:26,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2022-01-19 13:05:26,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2022-01-19 13:05:26,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:26,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2022-01-19 13:05:26,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 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 13:05:26,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:26,587 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:26,587 INFO L186 Difference]: Start difference. First operand has 386 places, 365 transitions, 1287 flow. Second operand 5 states and 1604 transitions. [2022-01-19 13:05:26,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 394 transitions, 1702 flow [2022-01-19 13:05:26,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 394 transitions, 1684 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-01-19 13:05:26,612 INFO L242 Difference]: Finished difference. Result has 393 places, 374 transitions, 1460 flow [2022-01-19 13:05:26,612 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1460, PETRI_PLACES=393, PETRI_TRANSITIONS=374} [2022-01-19 13:05:26,613 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 74 predicate places. [2022-01-19 13:05:26,613 INFO L470 AbstractCegarLoop]: Abstraction has has 393 places, 374 transitions, 1460 flow [2022-01-19 13:05:26,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:26,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:26,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:26,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:05:26,613 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 332516982, now seen corresponding path program 4 times [2022-01-19 13:05:26,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906218357] [2022-01-19 13:05:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:26,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:26,647 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 13:05:26,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:26,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906218357] [2022-01-19 13:05:26,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906218357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:26,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:26,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:26,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330298493] [2022-01-19 13:05:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:26,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:26,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:26,649 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:26,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 374 transitions, 1460 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:26,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:26,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:26,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:27,372 INFO L129 PetriNetUnfolder]: 510/4611 cut-off events. [2022-01-19 13:05:27,373 INFO L130 PetriNetUnfolder]: For 8247/8827 co-relation queries the response was YES. [2022-01-19 13:05:27,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9553 conditions, 4611 events. 510/4611 cut-off events. For 8247/8827 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 46563 event pairs, 330 based on Foata normal form. 7/4247 useless extension candidates. Maximal degree in co-relation 8193. Up to 524 conditions per place. [2022-01-19 13:05:27,408 INFO L132 encePairwiseOnDemand]: 346/349 looper letters, 67 selfloop transitions, 4 changer transitions 7/383 dead transitions. [2022-01-19 13:05:27,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 383 transitions, 1688 flow [2022-01-19 13:05:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:05:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:05:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1277 transitions. [2022-01-19 13:05:27,410 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.914756446991404 [2022-01-19 13:05:27,410 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1277 transitions. [2022-01-19 13:05:27,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1277 transitions. [2022-01-19 13:05:27,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:27,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1277 transitions. [2022-01-19 13:05:27,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 319.25) internal successors, (1277), 4 states have internal predecessors, (1277), 0 states have call successors, (0), 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 13:05:27,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:27,415 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:27,415 INFO L186 Difference]: Start difference. First operand has 393 places, 374 transitions, 1460 flow. Second operand 4 states and 1277 transitions. [2022-01-19 13:05:27,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 383 transitions, 1688 flow [2022-01-19 13:05:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 383 transitions, 1672 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-01-19 13:05:27,446 INFO L242 Difference]: Finished difference. Result has 398 places, 370 transitions, 1405 flow [2022-01-19 13:05:27,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1405, PETRI_PLACES=398, PETRI_TRANSITIONS=370} [2022-01-19 13:05:27,447 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 79 predicate places. [2022-01-19 13:05:27,447 INFO L470 AbstractCegarLoop]: Abstraction has has 398 places, 370 transitions, 1405 flow [2022-01-19 13:05:27,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:27,447 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:27,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:27,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 13:05:27,448 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2139981444, now seen corresponding path program 5 times [2022-01-19 13:05:27,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:27,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242712170] [2022-01-19 13:05:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:27,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:27,498 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 13:05:27,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:27,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242712170] [2022-01-19 13:05:27,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242712170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:27,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:27,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:27,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654026649] [2022-01-19 13:05:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:27,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:27,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:27,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:27,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 370 transitions, 1405 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:27,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:27,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:27,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:28,170 INFO L129 PetriNetUnfolder]: 490/4282 cut-off events. [2022-01-19 13:05:28,170 INFO L130 PetriNetUnfolder]: For 8466/9151 co-relation queries the response was YES. [2022-01-19 13:05:28,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 4282 events. 490/4282 cut-off events. For 8466/9151 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 41809 event pairs, 300 based on Foata normal form. 10/3936 useless extension candidates. Maximal degree in co-relation 8792. Up to 462 conditions per place. [2022-01-19 13:05:28,214 INFO L132 encePairwiseOnDemand]: 346/349 looper letters, 65 selfloop transitions, 6 changer transitions 4/380 dead transitions. [2022-01-19 13:05:28,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 380 transitions, 1625 flow [2022-01-19 13:05:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:05:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:05:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1279 transitions. [2022-01-19 13:05:28,216 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.916189111747851 [2022-01-19 13:05:28,216 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1279 transitions. [2022-01-19 13:05:28,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1279 transitions. [2022-01-19 13:05:28,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:28,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1279 transitions. [2022-01-19 13:05:28,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 319.75) internal successors, (1279), 4 states have internal predecessors, (1279), 0 states have call successors, (0), 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 13:05:28,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:28,219 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 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 13:05:28,219 INFO L186 Difference]: Start difference. First operand has 398 places, 370 transitions, 1405 flow. Second operand 4 states and 1279 transitions. [2022-01-19 13:05:28,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 380 transitions, 1625 flow [2022-01-19 13:05:28,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 380 transitions, 1618 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:28,242 INFO L242 Difference]: Finished difference. Result has 400 places, 367 transitions, 1374 flow [2022-01-19 13:05:28,242 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1374, PETRI_PLACES=400, PETRI_TRANSITIONS=367} [2022-01-19 13:05:28,242 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 81 predicate places. [2022-01-19 13:05:28,243 INFO L470 AbstractCegarLoop]: Abstraction has has 400 places, 367 transitions, 1374 flow [2022-01-19 13:05:28,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:28,243 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:28,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:28,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 13:05:28,243 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1581629290, now seen corresponding path program 1 times [2022-01-19 13:05:28,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:28,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642464177] [2022-01-19 13:05:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:28,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:28,277 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 13:05:28,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:28,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642464177] [2022-01-19 13:05:28,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642464177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:28,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:28,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:28,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270587310] [2022-01-19 13:05:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:28,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:28,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:28,280 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:28,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 367 transitions, 1374 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:28,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:28,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:28,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:28,889 INFO L129 PetriNetUnfolder]: 510/4189 cut-off events. [2022-01-19 13:05:28,889 INFO L130 PetriNetUnfolder]: For 9021/9134 co-relation queries the response was YES. [2022-01-19 13:05:28,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9015 conditions, 4189 events. 510/4189 cut-off events. For 9021/9134 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 41226 event pairs, 151 based on Foata normal form. 20/3913 useless extension candidates. Maximal degree in co-relation 8965. Up to 408 conditions per place. [2022-01-19 13:05:28,924 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 87 selfloop transitions, 16 changer transitions 14/422 dead transitions. [2022-01-19 13:05:28,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 422 transitions, 2227 flow [2022-01-19 13:05:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1608 transitions. [2022-01-19 13:05:28,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9214899713467049 [2022-01-19 13:05:28,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1608 transitions. [2022-01-19 13:05:28,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1608 transitions. [2022-01-19 13:05:28,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:28,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1608 transitions. [2022-01-19 13:05:28,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.6) internal successors, (1608), 5 states have internal predecessors, (1608), 0 states have call successors, (0), 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 13:05:28,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:28,928 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:28,928 INFO L186 Difference]: Start difference. First operand has 400 places, 367 transitions, 1374 flow. Second operand 5 states and 1608 transitions. [2022-01-19 13:05:28,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 422 transitions, 2227 flow [2022-01-19 13:05:28,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 422 transitions, 2206 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:28,954 INFO L242 Difference]: Finished difference. Result has 405 places, 377 transitions, 1556 flow [2022-01-19 13:05:28,955 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1556, PETRI_PLACES=405, PETRI_TRANSITIONS=377} [2022-01-19 13:05:28,955 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 86 predicate places. [2022-01-19 13:05:28,955 INFO L470 AbstractCegarLoop]: Abstraction has has 405 places, 377 transitions, 1556 flow [2022-01-19 13:05:28,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:28,955 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:28,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:28,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 13:05:28,956 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 4879054, now seen corresponding path program 2 times [2022-01-19 13:05:28,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:28,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117348933] [2022-01-19 13:05:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:28,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:28,995 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 13:05:28,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117348933] [2022-01-19 13:05:28,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117348933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:28,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:28,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:05:28,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004021749] [2022-01-19 13:05:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:28,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:05:28,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:28,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:05:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:05:28,997 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:05:28,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 377 transitions, 1556 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:28,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:28,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:05:28,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:29,594 INFO L129 PetriNetUnfolder]: 509/4129 cut-off events. [2022-01-19 13:05:29,594 INFO L130 PetriNetUnfolder]: For 10638/11294 co-relation queries the response was YES. [2022-01-19 13:05:29,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 4129 events. 509/4129 cut-off events. For 10638/11294 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 40226 event pairs, 169 based on Foata normal form. 30/3836 useless extension candidates. Maximal degree in co-relation 9012. Up to 361 conditions per place. [2022-01-19 13:05:29,645 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 81 selfloop transitions, 25 changer transitions 6/417 dead transitions. [2022-01-19 13:05:29,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 417 transitions, 2255 flow [2022-01-19 13:05:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:05:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:05:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1606 transitions. [2022-01-19 13:05:29,647 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9203438395415473 [2022-01-19 13:05:29,647 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1606 transitions. [2022-01-19 13:05:29,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1606 transitions. [2022-01-19 13:05:29,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:29,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1606 transitions. [2022-01-19 13:05:29,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.2) internal successors, (1606), 5 states have internal predecessors, (1606), 0 states have call successors, (0), 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 13:05:29,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:29,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:05:29,649 INFO L186 Difference]: Start difference. First operand has 405 places, 377 transitions, 1556 flow. Second operand 5 states and 1606 transitions. [2022-01-19 13:05:29,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 417 transitions, 2255 flow [2022-01-19 13:05:29,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 417 transitions, 2229 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-01-19 13:05:29,679 INFO L242 Difference]: Finished difference. Result has 413 places, 387 transitions, 1785 flow [2022-01-19 13:05:29,679 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1785, PETRI_PLACES=413, PETRI_TRANSITIONS=387} [2022-01-19 13:05:29,679 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 94 predicate places. [2022-01-19 13:05:29,680 INFO L470 AbstractCegarLoop]: Abstraction has has 413 places, 387 transitions, 1785 flow [2022-01-19 13:05:29,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:05:29,680 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:29,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:29,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 13:05:29,680 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash 757831568, now seen corresponding path program 1 times [2022-01-19 13:05:29,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:29,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247739509] [2022-01-19 13:05:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:29,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:29,761 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 13:05:29,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:29,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247739509] [2022-01-19 13:05:29,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247739509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:29,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:29,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:29,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515085611] [2022-01-19 13:05:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:29,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:29,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:29,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:29,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:29,766 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:29,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 387 transitions, 1785 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:29,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:29,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:29,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:31,114 INFO L129 PetriNetUnfolder]: 2277/7802 cut-off events. [2022-01-19 13:05:31,114 INFO L130 PetriNetUnfolder]: For 9907/10179 co-relation queries the response was YES. [2022-01-19 13:05:31,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17755 conditions, 7802 events. 2277/7802 cut-off events. For 9907/10179 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 82356 event pairs, 1433 based on Foata normal form. 8/6970 useless extension candidates. Maximal degree in co-relation 17698. Up to 2942 conditions per place. [2022-01-19 13:05:31,207 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 80 selfloop transitions, 30 changer transitions 28/491 dead transitions. [2022-01-19 13:05:31,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 491 transitions, 2440 flow [2022-01-19 13:05:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 13:05:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 13:05:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7383 transitions. [2022-01-19 13:05:31,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814469914040115 [2022-01-19 13:05:31,211 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7383 transitions. [2022-01-19 13:05:31,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7383 transitions. [2022-01-19 13:05:31,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:31,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7383 transitions. [2022-01-19 13:05:31,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 307.625) internal successors, (7383), 24 states have internal predecessors, (7383), 0 states have call successors, (0), 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 13:05:31,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 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 13:05:31,222 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 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 13:05:31,222 INFO L186 Difference]: Start difference. First operand has 413 places, 387 transitions, 1785 flow. Second operand 24 states and 7383 transitions. [2022-01-19 13:05:31,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 491 transitions, 2440 flow [2022-01-19 13:05:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 491 transitions, 2412 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-01-19 13:05:31,269 INFO L242 Difference]: Finished difference. Result has 456 places, 416 transitions, 2047 flow [2022-01-19 13:05:31,269 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2047, PETRI_PLACES=456, PETRI_TRANSITIONS=416} [2022-01-19 13:05:31,270 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 137 predicate places. [2022-01-19 13:05:31,270 INFO L470 AbstractCegarLoop]: Abstraction has has 456 places, 416 transitions, 2047 flow [2022-01-19 13:05:31,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:31,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:31,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 13:05:31,271 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2144117028, now seen corresponding path program 2 times [2022-01-19 13:05:31,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:31,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937595947] [2022-01-19 13:05:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:31,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:31,352 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 13:05:31,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:31,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937595947] [2022-01-19 13:05:31,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937595947] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:31,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:31,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:31,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690947642] [2022-01-19 13:05:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:31,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:31,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:31,354 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:31,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 416 transitions, 2047 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:31,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:31,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:31,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:33,170 INFO L129 PetriNetUnfolder]: 2368/8386 cut-off events. [2022-01-19 13:05:33,170 INFO L130 PetriNetUnfolder]: For 23901/24541 co-relation queries the response was YES. [2022-01-19 13:05:33,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24974 conditions, 8386 events. 2368/8386 cut-off events. For 23901/24541 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 89120 event pairs, 1328 based on Foata normal form. 10/7520 useless extension candidates. Maximal degree in co-relation 24896. Up to 2658 conditions per place. [2022-01-19 13:05:33,380 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 113 selfloop transitions, 45 changer transitions 26/537 dead transitions. [2022-01-19 13:05:33,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 537 transitions, 3124 flow [2022-01-19 13:05:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 13:05:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 13:05:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7380 transitions. [2022-01-19 13:05:33,385 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810888252148997 [2022-01-19 13:05:33,385 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7380 transitions. [2022-01-19 13:05:33,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7380 transitions. [2022-01-19 13:05:33,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:33,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7380 transitions. [2022-01-19 13:05:33,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 307.5) internal successors, (7380), 24 states have internal predecessors, (7380), 0 states have call successors, (0), 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 13:05:33,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 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 13:05:33,402 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 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 13:05:33,402 INFO L186 Difference]: Start difference. First operand has 456 places, 416 transitions, 2047 flow. Second operand 24 states and 7380 transitions. [2022-01-19 13:05:33,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 537 transitions, 3124 flow [2022-01-19 13:05:33,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 537 transitions, 3012 flow, removed 56 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:33,558 INFO L242 Difference]: Finished difference. Result has 495 places, 445 transitions, 2451 flow [2022-01-19 13:05:33,558 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2451, PETRI_PLACES=495, PETRI_TRANSITIONS=445} [2022-01-19 13:05:33,558 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 176 predicate places. [2022-01-19 13:05:33,558 INFO L470 AbstractCegarLoop]: Abstraction has has 495 places, 445 transitions, 2451 flow [2022-01-19 13:05:33,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:33,559 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:33,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:33,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 13:05:33,559 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1078131910, now seen corresponding path program 3 times [2022-01-19 13:05:33,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:33,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231067967] [2022-01-19 13:05:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:33,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:33,658 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 13:05:33,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:33,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231067967] [2022-01-19 13:05:33,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231067967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:33,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:33,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:33,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229095854] [2022-01-19 13:05:33,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:33,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:33,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:33,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:33,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:33,661 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:33,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 445 transitions, 2451 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:33,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:33,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:33,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:35,755 INFO L129 PetriNetUnfolder]: 2540/8738 cut-off events. [2022-01-19 13:05:35,755 INFO L130 PetriNetUnfolder]: For 39420/39738 co-relation queries the response was YES. [2022-01-19 13:05:35,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30805 conditions, 8738 events. 2540/8738 cut-off events. For 39420/39738 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 93968 event pairs, 1604 based on Foata normal form. 14/7810 useless extension candidates. Maximal degree in co-relation 30708. Up to 3411 conditions per place. [2022-01-19 13:05:35,884 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 101 selfloop transitions, 56 changer transitions 24/534 dead transitions. [2022-01-19 13:05:35,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 534 transitions, 3699 flow [2022-01-19 13:05:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 13:05:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 13:05:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6761 transitions. [2022-01-19 13:05:35,889 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8805678562125554 [2022-01-19 13:05:35,980 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6761 transitions. [2022-01-19 13:05:35,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6761 transitions. [2022-01-19 13:05:35,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:35,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6761 transitions. [2022-01-19 13:05:35,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 307.3181818181818) internal successors, (6761), 22 states have internal predecessors, (6761), 0 states have call successors, (0), 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 13:05:35,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 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 13:05:35,989 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 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 13:05:35,989 INFO L186 Difference]: Start difference. First operand has 495 places, 445 transitions, 2451 flow. Second operand 22 states and 6761 transitions. [2022-01-19 13:05:35,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 534 transitions, 3699 flow [2022-01-19 13:05:36,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 534 transitions, 3429 flow, removed 135 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:36,306 INFO L242 Difference]: Finished difference. Result has 526 places, 475 transitions, 2896 flow [2022-01-19 13:05:36,307 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2896, PETRI_PLACES=526, PETRI_TRANSITIONS=475} [2022-01-19 13:05:36,307 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 207 predicate places. [2022-01-19 13:05:36,307 INFO L470 AbstractCegarLoop]: Abstraction has has 526 places, 475 transitions, 2896 flow [2022-01-19 13:05:36,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:36,307 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:36,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:36,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 13:05:36,308 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1289019372, now seen corresponding path program 4 times [2022-01-19 13:05:36,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:36,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729051289] [2022-01-19 13:05:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:36,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:36,383 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 13:05:36,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:36,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729051289] [2022-01-19 13:05:36,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729051289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:36,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:36,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:36,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929917482] [2022-01-19 13:05:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:36,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:36,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:36,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:36,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:36,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 475 transitions, 2896 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:36,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:36,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:36,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:38,754 INFO L129 PetriNetUnfolder]: 2744/9522 cut-off events. [2022-01-19 13:05:38,754 INFO L130 PetriNetUnfolder]: For 51212/52096 co-relation queries the response was YES. [2022-01-19 13:05:38,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34355 conditions, 9522 events. 2744/9522 cut-off events. For 51212/52096 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 103517 event pairs, 1599 based on Foata normal form. 10/8546 useless extension candidates. Maximal degree in co-relation 34245. Up to 3196 conditions per place. [2022-01-19 13:05:38,887 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 120 selfloop transitions, 61 changer transitions 22/556 dead transitions. [2022-01-19 13:05:38,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 556 transitions, 4212 flow [2022-01-19 13:05:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 13:05:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 13:05:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 6152 transitions. [2022-01-19 13:05:38,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8813753581661891 [2022-01-19 13:05:38,891 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 6152 transitions. [2022-01-19 13:05:38,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 6152 transitions. [2022-01-19 13:05:38,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:38,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 6152 transitions. [2022-01-19 13:05:38,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 307.6) internal successors, (6152), 20 states have internal predecessors, (6152), 0 states have call successors, (0), 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 13:05:38,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 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 13:05:38,898 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 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 13:05:38,898 INFO L186 Difference]: Start difference. First operand has 526 places, 475 transitions, 2896 flow. Second operand 20 states and 6152 transitions. [2022-01-19 13:05:38,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 556 transitions, 4212 flow [2022-01-19 13:05:39,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 556 transitions, 3962 flow, removed 125 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:39,255 INFO L242 Difference]: Finished difference. Result has 556 places, 507 transitions, 3422 flow [2022-01-19 13:05:39,255 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3422, PETRI_PLACES=556, PETRI_TRANSITIONS=507} [2022-01-19 13:05:39,256 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 237 predicate places. [2022-01-19 13:05:39,256 INFO L470 AbstractCegarLoop]: Abstraction has has 556 places, 507 transitions, 3422 flow [2022-01-19 13:05:39,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:39,256 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:39,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:39,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 13:05:39,257 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1782446198, now seen corresponding path program 5 times [2022-01-19 13:05:39,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:39,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82319754] [2022-01-19 13:05:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:39,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:39,336 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 13:05:39,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:39,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82319754] [2022-01-19 13:05:39,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82319754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:39,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:39,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:39,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915510241] [2022-01-19 13:05:39,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:39,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:39,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:39,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:39,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:39,338 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:39,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 507 transitions, 3422 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:39,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:39,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:39,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:41,875 INFO L129 PetriNetUnfolder]: 2810/9678 cut-off events. [2022-01-19 13:05:41,875 INFO L130 PetriNetUnfolder]: For 68924/69292 co-relation queries the response was YES. [2022-01-19 13:05:41,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37936 conditions, 9678 events. 2810/9678 cut-off events. For 68924/69292 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 106602 event pairs, 1672 based on Foata normal form. 13/8667 useless extension candidates. Maximal degree in co-relation 37812. Up to 3693 conditions per place. [2022-01-19 13:05:42,014 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 139 selfloop transitions, 78 changer transitions 19/589 dead transitions. [2022-01-19 13:05:42,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 589 transitions, 4901 flow [2022-01-19 13:05:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 13:05:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 13:05:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 6148 transitions. [2022-01-19 13:05:42,018 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8808022922636103 [2022-01-19 13:05:42,018 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 6148 transitions. [2022-01-19 13:05:42,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 6148 transitions. [2022-01-19 13:05:42,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:42,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 6148 transitions. [2022-01-19 13:05:42,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 307.4) internal successors, (6148), 20 states have internal predecessors, (6148), 0 states have call successors, (0), 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 13:05:42,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 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 13:05:42,025 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 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 13:05:42,025 INFO L186 Difference]: Start difference. First operand has 556 places, 507 transitions, 3422 flow. Second operand 20 states and 6148 transitions. [2022-01-19 13:05:42,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 589 transitions, 4901 flow [2022-01-19 13:05:42,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 589 transitions, 4517 flow, removed 192 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:42,602 INFO L242 Difference]: Finished difference. Result has 586 places, 538 transitions, 3957 flow [2022-01-19 13:05:42,603 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3957, PETRI_PLACES=586, PETRI_TRANSITIONS=538} [2022-01-19 13:05:42,603 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 267 predicate places. [2022-01-19 13:05:42,603 INFO L470 AbstractCegarLoop]: Abstraction has has 586 places, 538 transitions, 3957 flow [2022-01-19 13:05:42,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:42,604 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:42,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:42,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 13:05:42,604 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 907104584, now seen corresponding path program 6 times [2022-01-19 13:05:42,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:42,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332261074] [2022-01-19 13:05:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:42,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:42,690 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 13:05:42,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:42,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332261074] [2022-01-19 13:05:42,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332261074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:42,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:42,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:42,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738810379] [2022-01-19 13:05:42,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:42,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:42,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:42,692 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:42,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 538 transitions, 3957 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:42,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:42,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:42,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:45,445 INFO L129 PetriNetUnfolder]: 2850/9990 cut-off events. [2022-01-19 13:05:45,445 INFO L130 PetriNetUnfolder]: For 77438/77826 co-relation queries the response was YES. [2022-01-19 13:05:45,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39780 conditions, 9990 events. 2850/9990 cut-off events. For 77438/77826 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 111681 event pairs, 1660 based on Foata normal form. 24/9002 useless extension candidates. Maximal degree in co-relation 39642. Up to 3717 conditions per place. [2022-01-19 13:05:45,612 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 140 selfloop transitions, 96 changer transitions 17/606 dead transitions. [2022-01-19 13:05:45,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 606 transitions, 5344 flow [2022-01-19 13:05:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:05:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:05:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5537 transitions. [2022-01-19 13:05:45,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814071951607768 [2022-01-19 13:05:45,615 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5537 transitions. [2022-01-19 13:05:45,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5537 transitions. [2022-01-19 13:05:45,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:45,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5537 transitions. [2022-01-19 13:05:45,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.6111111111111) internal successors, (5537), 18 states have internal predecessors, (5537), 0 states have call successors, (0), 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 13:05:45,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:05:45,622 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:05:45,622 INFO L186 Difference]: Start difference. First operand has 586 places, 538 transitions, 3957 flow. Second operand 18 states and 5537 transitions. [2022-01-19 13:05:45,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 606 transitions, 5344 flow [2022-01-19 13:05:46,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 606 transitions, 4928 flow, removed 208 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:46,386 INFO L242 Difference]: Finished difference. Result has 607 places, 559 transitions, 4350 flow [2022-01-19 13:05:46,387 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3735, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4350, PETRI_PLACES=607, PETRI_TRANSITIONS=559} [2022-01-19 13:05:46,387 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 288 predicate places. [2022-01-19 13:05:46,387 INFO L470 AbstractCegarLoop]: Abstraction has has 607 places, 559 transitions, 4350 flow [2022-01-19 13:05:46,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:46,387 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:46,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:46,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 13:05:46,388 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1145114812, now seen corresponding path program 7 times [2022-01-19 13:05:46,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:46,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029197392] [2022-01-19 13:05:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:46,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:46,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 13:05:46,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:46,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029197392] [2022-01-19 13:05:46,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029197392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:46,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:46,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:46,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888948789] [2022-01-19 13:05:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:46,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:46,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:46,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:46,489 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:46,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 559 transitions, 4350 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:46,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:46,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:46,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:49,449 INFO L129 PetriNetUnfolder]: 2946/10266 cut-off events. [2022-01-19 13:05:49,449 INFO L130 PetriNetUnfolder]: For 61426/61810 co-relation queries the response was YES. [2022-01-19 13:05:49,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40314 conditions, 10266 events. 2946/10266 cut-off events. For 61426/61810 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 115471 event pairs, 1680 based on Foata normal form. 19/9243 useless extension candidates. Maximal degree in co-relation 40169. Up to 3795 conditions per place. [2022-01-19 13:05:49,596 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 151 selfloop transitions, 100 changer transitions 16/620 dead transitions. [2022-01-19 13:05:49,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 620 transitions, 5603 flow [2022-01-19 13:05:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:05:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:05:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5234 transitions. [2022-01-19 13:05:49,598 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8821843923815945 [2022-01-19 13:05:49,598 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5234 transitions. [2022-01-19 13:05:49,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5234 transitions. [2022-01-19 13:05:49,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:49,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5234 transitions. [2022-01-19 13:05:49,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.88235294117646) internal successors, (5234), 17 states have internal predecessors, (5234), 0 states have call successors, (0), 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 13:05:49,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:05:49,604 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:05:49,604 INFO L186 Difference]: Start difference. First operand has 607 places, 559 transitions, 4350 flow. Second operand 17 states and 5234 transitions. [2022-01-19 13:05:49,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 620 transitions, 5603 flow [2022-01-19 13:05:50,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 620 transitions, 5421 flow, removed 91 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:50,094 INFO L242 Difference]: Finished difference. Result has 628 places, 580 transitions, 4857 flow [2022-01-19 13:05:50,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=4202, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4857, PETRI_PLACES=628, PETRI_TRANSITIONS=580} [2022-01-19 13:05:50,095 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 309 predicate places. [2022-01-19 13:05:50,095 INFO L470 AbstractCegarLoop]: Abstraction has has 628 places, 580 transitions, 4857 flow [2022-01-19 13:05:50,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:50,095 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:50,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:50,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 13:05:50,096 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1457870368, now seen corresponding path program 8 times [2022-01-19 13:05:50,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:50,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981163451] [2022-01-19 13:05:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:50,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:50,174 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 13:05:50,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:50,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981163451] [2022-01-19 13:05:50,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981163451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:50,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:50,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:50,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707451821] [2022-01-19 13:05:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:50,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:50,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:50,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:50,177 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:50,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 580 transitions, 4857 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:50,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:50,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:50,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:53,030 INFO L129 PetriNetUnfolder]: 2948/10438 cut-off events. [2022-01-19 13:05:53,030 INFO L130 PetriNetUnfolder]: For 67266/67651 co-relation queries the response was YES. [2022-01-19 13:05:53,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41743 conditions, 10438 events. 2948/10438 cut-off events. For 67266/67651 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 118466 event pairs, 1674 based on Foata normal form. 24/9431 useless extension candidates. Maximal degree in co-relation 41590. Up to 3849 conditions per place. [2022-01-19 13:05:53,229 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 151 selfloop transitions, 107 changer transitions 19/630 dead transitions. [2022-01-19 13:05:53,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 630 transitions, 5875 flow [2022-01-19 13:05:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 13:05:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 13:05:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4926 transitions. [2022-01-19 13:05:53,232 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8821633237822349 [2022-01-19 13:05:53,232 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4926 transitions. [2022-01-19 13:05:53,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4926 transitions. [2022-01-19 13:05:53,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:53,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4926 transitions. [2022-01-19 13:05:53,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 307.875) internal successors, (4926), 16 states have internal predecessors, (4926), 0 states have call successors, (0), 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 13:05:53,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 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 13:05:53,239 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 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 13:05:53,239 INFO L186 Difference]: Start difference. First operand has 628 places, 580 transitions, 4857 flow. Second operand 16 states and 4926 transitions. [2022-01-19 13:05:53,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 630 transitions, 5875 flow [2022-01-19 13:05:53,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 630 transitions, 5727 flow, removed 74 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:53,962 INFO L242 Difference]: Finished difference. Result has 646 places, 588 transitions, 5123 flow [2022-01-19 13:05:53,962 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=4713, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5123, PETRI_PLACES=646, PETRI_TRANSITIONS=588} [2022-01-19 13:05:53,963 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 327 predicate places. [2022-01-19 13:05:53,963 INFO L470 AbstractCegarLoop]: Abstraction has has 646 places, 588 transitions, 5123 flow [2022-01-19 13:05:53,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:53,963 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:53,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:53,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 13:05:53,964 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1919101692, now seen corresponding path program 9 times [2022-01-19 13:05:53,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15675408] [2022-01-19 13:05:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:53,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:54,053 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 13:05:54,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15675408] [2022-01-19 13:05:54,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15675408] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:54,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:54,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:54,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83303482] [2022-01-19 13:05:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:54,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:54,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:54,056 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:54,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 588 transitions, 5123 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:54,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:54,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:54,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:57,034 INFO L129 PetriNetUnfolder]: 3008/10670 cut-off events. [2022-01-19 13:05:57,034 INFO L130 PetriNetUnfolder]: For 73009/73394 co-relation queries the response was YES. [2022-01-19 13:05:57,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43956 conditions, 10670 events. 3008/10670 cut-off events. For 73009/73394 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 121864 event pairs, 1670 based on Foata normal form. 19/9627 useless extension candidates. Maximal degree in co-relation 43797. Up to 3745 conditions per place. [2022-01-19 13:05:57,238 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 185 selfloop transitions, 98 changer transitions 23/659 dead transitions. [2022-01-19 13:05:57,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 659 transitions, 6641 flow [2022-01-19 13:05:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 13:05:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 13:05:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6458 transitions. [2022-01-19 13:05:57,242 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8811570473461591 [2022-01-19 13:05:57,242 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6458 transitions. [2022-01-19 13:05:57,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6458 transitions. [2022-01-19 13:05:57,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:57,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6458 transitions. [2022-01-19 13:05:57,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 307.5238095238095) internal successors, (6458), 21 states have internal predecessors, (6458), 0 states have call successors, (0), 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 13:05:57,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 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 13:05:57,250 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 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 13:05:57,251 INFO L186 Difference]: Start difference. First operand has 646 places, 588 transitions, 5123 flow. Second operand 21 states and 6458 transitions. [2022-01-19 13:05:57,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 659 transitions, 6641 flow [2022-01-19 13:05:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 659 transitions, 6522 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-01-19 13:05:57,848 INFO L242 Difference]: Finished difference. Result has 675 places, 612 transitions, 5858 flow [2022-01-19 13:05:57,848 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=5036, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5858, PETRI_PLACES=675, PETRI_TRANSITIONS=612} [2022-01-19 13:05:57,849 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 356 predicate places. [2022-01-19 13:05:57,849 INFO L470 AbstractCegarLoop]: Abstraction has has 675 places, 612 transitions, 5858 flow [2022-01-19 13:05:57,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:57,849 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:57,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:57,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 13:05:57,850 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2078172640, now seen corresponding path program 10 times [2022-01-19 13:05:57,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:57,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532525433] [2022-01-19 13:05:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:57,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:57,933 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 13:05:57,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:57,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532525433] [2022-01-19 13:05:57,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532525433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:57,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:57,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:57,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557183871] [2022-01-19 13:05:57,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:57,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:57,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:57,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:57,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:57,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:05:57,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 612 transitions, 5858 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:05:57,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:57,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:05:57,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:00,939 INFO L129 PetriNetUnfolder]: 3038/10836 cut-off events. [2022-01-19 13:06:00,939 INFO L130 PetriNetUnfolder]: For 83989/84386 co-relation queries the response was YES. [2022-01-19 13:06:01,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46368 conditions, 10836 events. 3038/10836 cut-off events. For 83989/84386 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 124256 event pairs, 1718 based on Foata normal form. 19/9775 useless extension candidates. Maximal degree in co-relation 46197. Up to 3953 conditions per place. [2022-01-19 13:06:01,284 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 167 selfloop transitions, 120 changer transitions 20/660 dead transitions. [2022-01-19 13:06:01,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 660 transitions, 7031 flow [2022-01-19 13:06:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:06:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:06:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5537 transitions. [2022-01-19 13:06:01,290 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814071951607768 [2022-01-19 13:06:01,290 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5537 transitions. [2022-01-19 13:06:01,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5537 transitions. [2022-01-19 13:06:01,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:01,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5537 transitions. [2022-01-19 13:06:01,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.6111111111111) internal successors, (5537), 18 states have internal predecessors, (5537), 0 states have call successors, (0), 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 13:06:01,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:01,297 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:01,298 INFO L186 Difference]: Start difference. First operand has 675 places, 612 transitions, 5858 flow. Second operand 18 states and 5537 transitions. [2022-01-19 13:06:01,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 660 transitions, 7031 flow [2022-01-19 13:06:02,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 660 transitions, 6773 flow, removed 129 selfloop flow, removed 2 redundant places. [2022-01-19 13:06:02,051 INFO L242 Difference]: Finished difference. Result has 696 places, 626 transitions, 6232 flow [2022-01-19 13:06:02,051 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6232, PETRI_PLACES=696, PETRI_TRANSITIONS=626} [2022-01-19 13:06:02,051 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 377 predicate places. [2022-01-19 13:06:02,052 INFO L470 AbstractCegarLoop]: Abstraction has has 696 places, 626 transitions, 6232 flow [2022-01-19 13:06:02,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:02,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:02,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:02,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 13:06:02,052 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2085660946, now seen corresponding path program 11 times [2022-01-19 13:06:02,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:02,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126803289] [2022-01-19 13:06:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:02,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:02,151 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 13:06:02,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:02,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126803289] [2022-01-19 13:06:02,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126803289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:02,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:02,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:02,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093409580] [2022-01-19 13:06:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:02,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:02,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:02,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:02,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 626 transitions, 6232 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:02,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:02,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:02,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:05,368 INFO L129 PetriNetUnfolder]: 3078/11112 cut-off events. [2022-01-19 13:06:05,369 INFO L130 PetriNetUnfolder]: For 85922/86331 co-relation queries the response was YES. [2022-01-19 13:06:05,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47790 conditions, 11112 events. 3078/11112 cut-off events. For 85922/86331 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 128684 event pairs, 1716 based on Foata normal form. 19/10040 useless extension candidates. Maximal degree in co-relation 47612. Up to 4005 conditions per place. [2022-01-19 13:06:05,577 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 197 selfloop transitions, 113 changer transitions 15/678 dead transitions. [2022-01-19 13:06:05,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 678 transitions, 7567 flow [2022-01-19 13:06:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:06:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:06:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5234 transitions. [2022-01-19 13:06:05,579 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8821843923815945 [2022-01-19 13:06:05,579 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5234 transitions. [2022-01-19 13:06:05,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5234 transitions. [2022-01-19 13:06:05,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:05,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5234 transitions. [2022-01-19 13:06:05,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.88235294117646) internal successors, (5234), 17 states have internal predecessors, (5234), 0 states have call successors, (0), 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 13:06:05,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:06:05,585 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:06:05,585 INFO L186 Difference]: Start difference. First operand has 696 places, 626 transitions, 6232 flow. Second operand 17 states and 5234 transitions. [2022-01-19 13:06:05,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 678 transitions, 7567 flow [2022-01-19 13:06:06,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 678 transitions, 7382 flow, removed 43 selfloop flow, removed 4 redundant places. [2022-01-19 13:06:06,443 INFO L242 Difference]: Finished difference. Result has 714 places, 644 transitions, 6785 flow [2022-01-19 13:06:06,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6059, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6785, PETRI_PLACES=714, PETRI_TRANSITIONS=644} [2022-01-19 13:06:06,444 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 395 predicate places. [2022-01-19 13:06:06,444 INFO L470 AbstractCegarLoop]: Abstraction has has 714 places, 644 transitions, 6785 flow [2022-01-19 13:06:06,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:06,445 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:06,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:06,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 13:06:06,445 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash -732126942, now seen corresponding path program 12 times [2022-01-19 13:06:06,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:06,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829863330] [2022-01-19 13:06:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:06,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:06,544 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 13:06:06,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829863330] [2022-01-19 13:06:06,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829863330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:06,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:06,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:06,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537314066] [2022-01-19 13:06:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:06,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:06,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:06,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:06,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:06,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:06,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 644 transitions, 6785 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:06,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:06,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:06,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:10,007 INFO L129 PetriNetUnfolder]: 3074/11304 cut-off events. [2022-01-19 13:06:10,007 INFO L130 PetriNetUnfolder]: For 86741/87158 co-relation queries the response was YES. [2022-01-19 13:06:10,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48497 conditions, 11304 events. 3074/11304 cut-off events. For 86741/87158 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 131624 event pairs, 1702 based on Foata normal form. 19/10241 useless extension candidates. Maximal degree in co-relation 48313. Up to 3987 conditions per place. [2022-01-19 13:06:10,197 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 195 selfloop transitions, 116 changer transitions 24/688 dead transitions. [2022-01-19 13:06:10,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 688 transitions, 7906 flow [2022-01-19 13:06:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:06:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:06:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5541 transitions. [2022-01-19 13:06:10,200 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8820439350525311 [2022-01-19 13:06:10,200 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5541 transitions. [2022-01-19 13:06:10,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5541 transitions. [2022-01-19 13:06:10,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:10,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5541 transitions. [2022-01-19 13:06:10,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.8333333333333) internal successors, (5541), 18 states have internal predecessors, (5541), 0 states have call successors, (0), 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 13:06:10,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:10,206 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:10,206 INFO L186 Difference]: Start difference. First operand has 714 places, 644 transitions, 6785 flow. Second operand 18 states and 5541 transitions. [2022-01-19 13:06:10,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 688 transitions, 7906 flow [2022-01-19 13:06:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 688 transitions, 7644 flow, removed 106 selfloop flow, removed 3 redundant places. [2022-01-19 13:06:11,028 INFO L242 Difference]: Finished difference. Result has 733 places, 653 transitions, 7049 flow [2022-01-19 13:06:11,029 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6563, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7049, PETRI_PLACES=733, PETRI_TRANSITIONS=653} [2022-01-19 13:06:11,029 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 414 predicate places. [2022-01-19 13:06:11,029 INFO L470 AbstractCegarLoop]: Abstraction has has 733 places, 653 transitions, 7049 flow [2022-01-19 13:06:11,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:11,030 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:11,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:11,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 13:06:11,030 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1594563102, now seen corresponding path program 13 times [2022-01-19 13:06:11,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515222277] [2022-01-19 13:06:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:11,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:11,138 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 13:06:11,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515222277] [2022-01-19 13:06:11,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515222277] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:11,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:11,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:11,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315429531] [2022-01-19 13:06:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:11,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:11,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:11,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:11,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:11,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:11,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 653 transitions, 7049 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:11,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:11,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:11,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:14,999 INFO L129 PetriNetUnfolder]: 3236/11920 cut-off events. [2022-01-19 13:06:14,999 INFO L130 PetriNetUnfolder]: For 108705/110718 co-relation queries the response was YES. [2022-01-19 13:06:15,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52138 conditions, 11920 events. 3236/11920 cut-off events. For 108705/110718 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 139539 event pairs, 1563 based on Foata normal form. 15/10857 useless extension candidates. Maximal degree in co-relation 51949. Up to 3628 conditions per place. [2022-01-19 13:06:15,208 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 219 selfloop transitions, 143 changer transitions 23/738 dead transitions. [2022-01-19 13:06:15,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 738 transitions, 8856 flow [2022-01-19 13:06:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 13:06:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 13:06:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6759 transitions. [2022-01-19 13:06:15,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8803073717113832 [2022-01-19 13:06:15,211 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6759 transitions. [2022-01-19 13:06:15,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6759 transitions. [2022-01-19 13:06:15,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:15,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6759 transitions. [2022-01-19 13:06:15,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 307.22727272727275) internal successors, (6759), 22 states have internal predecessors, (6759), 0 states have call successors, (0), 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 13:06:15,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 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 13:06:15,219 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 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 13:06:15,219 INFO L186 Difference]: Start difference. First operand has 733 places, 653 transitions, 7049 flow. Second operand 22 states and 6759 transitions. [2022-01-19 13:06:15,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 738 transitions, 8856 flow [2022-01-19 13:06:16,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 738 transitions, 8668 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-01-19 13:06:16,050 INFO L242 Difference]: Finished difference. Result has 763 places, 685 transitions, 7931 flow [2022-01-19 13:06:16,051 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6876, PETRI_DIFFERENCE_MINUEND_PLACES=728, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7931, PETRI_PLACES=763, PETRI_TRANSITIONS=685} [2022-01-19 13:06:16,051 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 444 predicate places. [2022-01-19 13:06:16,051 INFO L470 AbstractCegarLoop]: Abstraction has has 763 places, 685 transitions, 7931 flow [2022-01-19 13:06:16,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:16,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:16,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:16,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 13:06:16,052 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 405814724, now seen corresponding path program 14 times [2022-01-19 13:06:16,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:16,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382852314] [2022-01-19 13:06:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:16,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:16,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 13:06:16,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:16,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382852314] [2022-01-19 13:06:16,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382852314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:16,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:16,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:16,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977482487] [2022-01-19 13:06:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:16,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:16,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:16,135 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:16,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 685 transitions, 7931 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:16,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:16,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:16,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:20,374 INFO L129 PetriNetUnfolder]: 3294/12092 cut-off events. [2022-01-19 13:06:20,375 INFO L130 PetriNetUnfolder]: For 124248/126482 co-relation queries the response was YES. [2022-01-19 13:06:20,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55642 conditions, 12092 events. 3294/12092 cut-off events. For 124248/126482 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 141771 event pairs, 1591 based on Foata normal form. 15/10987 useless extension candidates. Maximal degree in co-relation 55440. Up to 3666 conditions per place. [2022-01-19 13:06:20,590 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 273 selfloop transitions, 105 changer transitions 21/752 dead transitions. [2022-01-19 13:06:20,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 752 transitions, 9648 flow [2022-01-19 13:06:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 13:06:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 13:06:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6455 transitions. [2022-01-19 13:06:20,593 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807477145586028 [2022-01-19 13:06:20,594 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6455 transitions. [2022-01-19 13:06:20,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6455 transitions. [2022-01-19 13:06:20,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:20,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6455 transitions. [2022-01-19 13:06:20,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 307.3809523809524) internal successors, (6455), 21 states have internal predecessors, (6455), 0 states have call successors, (0), 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 13:06:20,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 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 13:06:20,600 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 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 13:06:20,601 INFO L186 Difference]: Start difference. First operand has 763 places, 685 transitions, 7931 flow. Second operand 21 states and 6455 transitions. [2022-01-19 13:06:20,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 752 transitions, 9648 flow [2022-01-19 13:06:21,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 779 places, 752 transitions, 9454 flow, removed 97 selfloop flow, removed 2 redundant places. [2022-01-19 13:06:21,611 INFO L242 Difference]: Finished difference. Result has 793 places, 709 transitions, 8615 flow [2022-01-19 13:06:21,612 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=7751, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8615, PETRI_PLACES=793, PETRI_TRANSITIONS=709} [2022-01-19 13:06:21,612 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 474 predicate places. [2022-01-19 13:06:21,612 INFO L470 AbstractCegarLoop]: Abstraction has has 793 places, 709 transitions, 8615 flow [2022-01-19 13:06:21,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:21,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:21,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:21,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 13:06:21,613 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 992327226, now seen corresponding path program 15 times [2022-01-19 13:06:21,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:21,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814299854] [2022-01-19 13:06:21,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:21,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:21,698 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 13:06:21,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:21,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814299854] [2022-01-19 13:06:21,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814299854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:21,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:21,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:21,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740644252] [2022-01-19 13:06:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:21,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:21,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:21,702 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:21,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 793 places, 709 transitions, 8615 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:21,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:21,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:21,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:26,025 INFO L129 PetriNetUnfolder]: 3334/12328 cut-off events. [2022-01-19 13:06:26,025 INFO L130 PetriNetUnfolder]: For 137683/140006 co-relation queries the response was YES. [2022-01-19 13:06:26,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58057 conditions, 12328 events. 3334/12328 cut-off events. For 137683/140006 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 145748 event pairs, 1571 based on Foata normal form. 15/11240 useless extension candidates. Maximal degree in co-relation 57842. Up to 3776 conditions per place. [2022-01-19 13:06:26,265 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 240 selfloop transitions, 161 changer transitions 18/772 dead transitions. [2022-01-19 13:06:26,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 772 transitions, 10235 flow [2022-01-19 13:06:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:06:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:06:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5537 transitions. [2022-01-19 13:06:26,267 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814071951607768 [2022-01-19 13:06:26,267 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5537 transitions. [2022-01-19 13:06:26,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5537 transitions. [2022-01-19 13:06:26,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:26,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5537 transitions. [2022-01-19 13:06:26,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.6111111111111) internal successors, (5537), 18 states have internal predecessors, (5537), 0 states have call successors, (0), 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 13:06:26,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:26,273 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:26,273 INFO L186 Difference]: Start difference. First operand has 793 places, 709 transitions, 8615 flow. Second operand 18 states and 5537 transitions. [2022-01-19 13:06:26,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 772 transitions, 10235 flow [2022-01-19 13:06:27,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 772 transitions, 10037 flow, removed 99 selfloop flow, removed 2 redundant places. [2022-01-19 13:06:27,367 INFO L242 Difference]: Finished difference. Result has 814 places, 730 transitions, 9301 flow [2022-01-19 13:06:27,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=8419, PETRI_DIFFERENCE_MINUEND_PLACES=789, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9301, PETRI_PLACES=814, PETRI_TRANSITIONS=730} [2022-01-19 13:06:27,368 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 495 predicate places. [2022-01-19 13:06:27,368 INFO L470 AbstractCegarLoop]: Abstraction has has 814 places, 730 transitions, 9301 flow [2022-01-19 13:06:27,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:27,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:27,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:27,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 13:06:27,368 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1700939714, now seen corresponding path program 16 times [2022-01-19 13:06:27,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856896296] [2022-01-19 13:06:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:27,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:27,459 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 13:06:27,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:27,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856896296] [2022-01-19 13:06:27,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856896296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:27,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:27,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:27,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915869275] [2022-01-19 13:06:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:27,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:27,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:27,461 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:27,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 730 transitions, 9301 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:27,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:27,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:27,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:31,939 INFO L129 PetriNetUnfolder]: 3426/12628 cut-off events. [2022-01-19 13:06:31,939 INFO L130 PetriNetUnfolder]: For 146796/149147 co-relation queries the response was YES. [2022-01-19 13:06:32,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61446 conditions, 12628 events. 3426/12628 cut-off events. For 146796/149147 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 150703 event pairs, 1601 based on Foata normal form. 15/11499 useless extension candidates. Maximal degree in co-relation 61224. Up to 3842 conditions per place. [2022-01-19 13:06:32,209 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 283 selfloop transitions, 134 changer transitions 16/786 dead transitions. [2022-01-19 13:06:32,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 786 transitions, 10957 flow [2022-01-19 13:06:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:06:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:06:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5233 transitions. [2022-01-19 13:06:32,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8820158435867184 [2022-01-19 13:06:32,211 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5233 transitions. [2022-01-19 13:06:32,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5233 transitions. [2022-01-19 13:06:32,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:32,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5233 transitions. [2022-01-19 13:06:32,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.8235294117647) internal successors, (5233), 17 states have internal predecessors, (5233), 0 states have call successors, (0), 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 13:06:32,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:06:32,217 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:06:32,217 INFO L186 Difference]: Start difference. First operand has 814 places, 730 transitions, 9301 flow. Second operand 17 states and 5233 transitions. [2022-01-19 13:06:32,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 786 transitions, 10957 flow [2022-01-19 13:06:33,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 786 transitions, 10699 flow, removed 129 selfloop flow, removed 2 redundant places. [2022-01-19 13:06:33,533 INFO L242 Difference]: Finished difference. Result has 835 places, 751 transitions, 9927 flow [2022-01-19 13:06:33,534 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=9087, PETRI_DIFFERENCE_MINUEND_PLACES=810, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9927, PETRI_PLACES=835, PETRI_TRANSITIONS=751} [2022-01-19 13:06:33,534 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 516 predicate places. [2022-01-19 13:06:33,535 INFO L470 AbstractCegarLoop]: Abstraction has has 835 places, 751 transitions, 9927 flow [2022-01-19 13:06:33,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:33,535 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:33,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:33,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 13:06:33,535 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1869694260, now seen corresponding path program 17 times [2022-01-19 13:06:33,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:33,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711422103] [2022-01-19 13:06:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:33,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:33,744 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 13:06:33,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:33,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711422103] [2022-01-19 13:06:33,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711422103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:33,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:33,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:33,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140807407] [2022-01-19 13:06:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:33,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:33,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:33,747 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:33,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 751 transitions, 9927 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:33,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:33,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:33,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:38,206 INFO L129 PetriNetUnfolder]: 3466/12864 cut-off events. [2022-01-19 13:06:38,207 INFO L130 PetriNetUnfolder]: For 154633/157205 co-relation queries the response was YES. [2022-01-19 13:06:38,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63638 conditions, 12864 events. 3466/12864 cut-off events. For 154633/157205 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 154724 event pairs, 1599 based on Foata normal form. 15/11724 useless extension candidates. Maximal degree in co-relation 63408. Up to 3896 conditions per place. [2022-01-19 13:06:38,473 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 308 selfloop transitions, 126 changer transitions 17/804 dead transitions. [2022-01-19 13:06:38,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 804 transitions, 11584 flow [2022-01-19 13:06:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:06:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:06:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5540 transitions. [2022-01-19 13:06:38,475 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8818847500795924 [2022-01-19 13:06:38,476 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5540 transitions. [2022-01-19 13:06:38,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5540 transitions. [2022-01-19 13:06:38,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:38,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5540 transitions. [2022-01-19 13:06:38,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.77777777777777) internal successors, (5540), 18 states have internal predecessors, (5540), 0 states have call successors, (0), 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 13:06:38,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:38,482 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:38,482 INFO L186 Difference]: Start difference. First operand has 835 places, 751 transitions, 9927 flow. Second operand 18 states and 5540 transitions. [2022-01-19 13:06:38,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 804 transitions, 11584 flow [2022-01-19 13:06:39,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 848 places, 804 transitions, 11414 flow, removed 85 selfloop flow, removed 2 redundant places. [2022-01-19 13:06:39,910 INFO L242 Difference]: Finished difference. Result has 856 places, 770 transitions, 10584 flow [2022-01-19 13:06:39,911 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=9761, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10584, PETRI_PLACES=856, PETRI_TRANSITIONS=770} [2022-01-19 13:06:39,911 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 537 predicate places. [2022-01-19 13:06:39,911 INFO L470 AbstractCegarLoop]: Abstraction has has 856 places, 770 transitions, 10584 flow [2022-01-19 13:06:39,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:39,912 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:39,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:39,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 13:06:39,912 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1197953896, now seen corresponding path program 18 times [2022-01-19 13:06:39,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:39,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473668896] [2022-01-19 13:06:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:39,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:39,997 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 13:06:39,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473668896] [2022-01-19 13:06:39,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473668896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:39,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:39,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:39,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017620098] [2022-01-19 13:06:39,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:39,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:39,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:39,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:40,000 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:40,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 770 transitions, 10584 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:40,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:40,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:40,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:44,754 INFO L129 PetriNetUnfolder]: 3474/13044 cut-off events. [2022-01-19 13:06:44,754 INFO L130 PetriNetUnfolder]: For 165434/168194 co-relation queries the response was YES. [2022-01-19 13:06:45,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65101 conditions, 13044 events. 3474/13044 cut-off events. For 165434/168194 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 157524 event pairs, 1581 based on Foata normal form. 15/11928 useless extension candidates. Maximal degree in co-relation 64864. Up to 3936 conditions per place. [2022-01-19 13:06:45,061 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 264 selfloop transitions, 178 changer transitions 22/817 dead transitions. [2022-01-19 13:06:45,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 817 transitions, 11931 flow [2022-01-19 13:06:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 13:06:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 13:06:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4929 transitions. [2022-01-19 13:06:45,064 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827005730659025 [2022-01-19 13:06:45,064 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4929 transitions. [2022-01-19 13:06:45,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4929 transitions. [2022-01-19 13:06:45,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:45,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4929 transitions. [2022-01-19 13:06:45,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 308.0625) internal successors, (4929), 16 states have internal predecessors, (4929), 0 states have call successors, (0), 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 13:06:45,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 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 13:06:45,072 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 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 13:06:45,072 INFO L186 Difference]: Start difference. First operand has 856 places, 770 transitions, 10584 flow. Second operand 16 states and 4929 transitions. [2022-01-19 13:06:45,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 817 transitions, 11931 flow [2022-01-19 13:06:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 867 places, 817 transitions, 11717 flow, removed 107 selfloop flow, removed 2 redundant places. [2022-01-19 13:06:46,553 INFO L242 Difference]: Finished difference. Result has 874 places, 778 transitions, 10950 flow [2022-01-19 13:06:46,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=10372, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10950, PETRI_PLACES=874, PETRI_TRANSITIONS=778} [2022-01-19 13:06:46,554 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 555 predicate places. [2022-01-19 13:06:46,554 INFO L470 AbstractCegarLoop]: Abstraction has has 874 places, 778 transitions, 10950 flow [2022-01-19 13:06:46,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:46,554 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:46,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:46,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 13:06:46,555 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2002777388, now seen corresponding path program 19 times [2022-01-19 13:06:46,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:46,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533105630] [2022-01-19 13:06:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:46,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:46,634 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 13:06:46,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:46,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533105630] [2022-01-19 13:06:46,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533105630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:46,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:46,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:46,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144028424] [2022-01-19 13:06:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:46,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:46,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:46,637 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:46,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 778 transitions, 10950 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:46,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:46,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:46,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:51,720 INFO L129 PetriNetUnfolder]: 3508/13142 cut-off events. [2022-01-19 13:06:51,720 INFO L130 PetriNetUnfolder]: For 172540/175300 co-relation queries the response was YES. [2022-01-19 13:06:51,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67430 conditions, 13142 events. 3508/13142 cut-off events. For 172540/175300 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 159320 event pairs, 1621 based on Foata normal form. 15/11978 useless extension candidates. Maximal degree in co-relation 67187. Up to 3968 conditions per place. [2022-01-19 13:06:52,039 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 297 selfloop transitions, 152 changer transitions 23/825 dead transitions. [2022-01-19 13:06:52,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 889 places, 825 transitions, 12446 flow [2022-01-19 13:06:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:06:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:06:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5540 transitions. [2022-01-19 13:06:52,041 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8818847500795924 [2022-01-19 13:06:52,041 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5540 transitions. [2022-01-19 13:06:52,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5540 transitions. [2022-01-19 13:06:52,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:52,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5540 transitions. [2022-01-19 13:06:52,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.77777777777777) internal successors, (5540), 18 states have internal predecessors, (5540), 0 states have call successors, (0), 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 13:06:52,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:52,047 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 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 13:06:52,047 INFO L186 Difference]: Start difference. First operand has 874 places, 778 transitions, 10950 flow. Second operand 18 states and 5540 transitions. [2022-01-19 13:06:52,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 889 places, 825 transitions, 12446 flow [2022-01-19 13:06:53,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 884 places, 825 transitions, 12136 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-01-19 13:06:53,636 INFO L242 Difference]: Finished difference. Result has 891 places, 792 transitions, 11376 flow [2022-01-19 13:06:53,636 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=10660, PETRI_DIFFERENCE_MINUEND_PLACES=867, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11376, PETRI_PLACES=891, PETRI_TRANSITIONS=792} [2022-01-19 13:06:53,636 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 572 predicate places. [2022-01-19 13:06:53,636 INFO L470 AbstractCegarLoop]: Abstraction has has 891 places, 792 transitions, 11376 flow [2022-01-19 13:06:53,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:53,637 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:53,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 13:06:53,637 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1661105862, now seen corresponding path program 20 times [2022-01-19 13:06:53,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:53,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098616281] [2022-01-19 13:06:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:53,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:53,714 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 13:06:53,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:53,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098616281] [2022-01-19 13:06:53,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098616281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:53,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:53,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:06:53,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565595783] [2022-01-19 13:06:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:53,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:06:53,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:06:53,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:06:53,717 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 13:06:53,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 792 transitions, 11376 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:06:53,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:53,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 13:06:53,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:58,569 INFO L129 PetriNetUnfolder]: 3508/13260 cut-off events. [2022-01-19 13:06:58,569 INFO L130 PetriNetUnfolder]: For 172604/175364 co-relation queries the response was YES. [2022-01-19 13:06:58,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67808 conditions, 13260 events. 3508/13260 cut-off events. For 172604/175364 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 161275 event pairs, 1605 based on Foata normal form. 15/12112 useless extension candidates. Maximal degree in co-relation 67560. Up to 3964 conditions per place. [2022-01-19 13:06:58,876 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 318 selfloop transitions, 137 changer transitions 27/832 dead transitions. [2022-01-19 13:06:58,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 832 transitions, 12705 flow [2022-01-19 13:06:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:06:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:06:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5237 transitions. [2022-01-19 13:06:58,879 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8826900387662229 [2022-01-19 13:06:58,879 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5237 transitions. [2022-01-19 13:06:58,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5237 transitions. [2022-01-19 13:06:58,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:58,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5237 transitions. [2022-01-19 13:06:58,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 308.05882352941177) internal successors, (5237), 17 states have internal predecessors, (5237), 0 states have call successors, (0), 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 13:06:58,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:06:58,885 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 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 13:06:58,885 INFO L186 Difference]: Start difference. First operand has 891 places, 792 transitions, 11376 flow. Second operand 17 states and 5237 transitions. [2022-01-19 13:06:58,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 832 transitions, 12705 flow [2022-01-19 13:07:00,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 832 transitions, 12514 flow, removed 58 selfloop flow, removed 4 redundant places. [2022-01-19 13:07:00,420 INFO L242 Difference]: Finished difference. Result has 908 places, 797 transitions, 11669 flow [2022-01-19 13:07:00,420 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=11191, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11669, PETRI_PLACES=908, PETRI_TRANSITIONS=797} [2022-01-19 13:07:00,420 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 589 predicate places. [2022-01-19 13:07:00,420 INFO L470 AbstractCegarLoop]: Abstraction has has 908 places, 797 transitions, 11669 flow [2022-01-19 13:07:00,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 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 13:07:00,421 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:00,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:00,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 13:07:00,421 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash -492528208, now seen corresponding path program 1 times [2022-01-19 13:07:00,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:00,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498039265] [2022-01-19 13:07:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:00,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:00,455 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 13:07:00,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:00,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498039265] [2022-01-19 13:07:00,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498039265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:00,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:00,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:00,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973362122] [2022-01-19 13:07:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:00,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:00,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:00,458 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:00,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 797 transitions, 11669 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:00,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:00,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:00,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:03,432 INFO L129 PetriNetUnfolder]: 1295/9118 cut-off events. [2022-01-19 13:07:03,432 INFO L130 PetriNetUnfolder]: For 116110/116168 co-relation queries the response was YES. [2022-01-19 13:07:03,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46894 conditions, 9118 events. 1295/9118 cut-off events. For 116110/116168 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 107907 event pairs, 129 based on Foata normal form. 35/8911 useless extension candidates. Maximal degree in co-relation 46642. Up to 579 conditions per place. [2022-01-19 13:07:03,626 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 77 selfloop transitions, 19 changer transitions 421/830 dead transitions. [2022-01-19 13:07:03,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 830 transitions, 12225 flow [2022-01-19 13:07:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1605 transitions. [2022-01-19 13:07:03,628 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9197707736389685 [2022-01-19 13:07:03,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1605 transitions. [2022-01-19 13:07:03,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1605 transitions. [2022-01-19 13:07:03,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:03,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1605 transitions. [2022-01-19 13:07:03,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 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 13:07:03,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:03,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:03,630 INFO L186 Difference]: Start difference. First operand has 908 places, 797 transitions, 11669 flow. Second operand 5 states and 1605 transitions. [2022-01-19 13:07:03,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 830 transitions, 12225 flow [2022-01-19 13:07:04,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 830 transitions, 12037 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:04,780 INFO L242 Difference]: Finished difference. Result has 911 places, 391 transitions, 2103 flow [2022-01-19 13:07:04,780 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=11435, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2103, PETRI_PLACES=911, PETRI_TRANSITIONS=391} [2022-01-19 13:07:04,781 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 592 predicate places. [2022-01-19 13:07:04,781 INFO L470 AbstractCegarLoop]: Abstraction has has 911 places, 391 transitions, 2103 flow [2022-01-19 13:07:04,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:04,781 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:04,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:04,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 13:07:04,781 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1249328010, now seen corresponding path program 3 times [2022-01-19 13:07:04,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:04,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446601833] [2022-01-19 13:07:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:04,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:04,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 13:07:04,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:04,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446601833] [2022-01-19 13:07:04,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446601833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:04,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:04,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:04,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334617405] [2022-01-19 13:07:04,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:04,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:04,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:04,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:04,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:04,817 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:04,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 391 transitions, 2103 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:04,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:04,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:04,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:05,800 INFO L129 PetriNetUnfolder]: 361/3193 cut-off events. [2022-01-19 13:07:05,801 INFO L130 PetriNetUnfolder]: For 28480/28883 co-relation queries the response was YES. [2022-01-19 13:07:05,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11263 conditions, 3193 events. 361/3193 cut-off events. For 28480/28883 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 29119 event pairs, 165 based on Foata normal form. 22/2980 useless extension candidates. Maximal degree in co-relation 11010. Up to 383 conditions per place. [2022-01-19 13:07:05,897 INFO L132 encePairwiseOnDemand]: 342/349 looper letters, 91 selfloop transitions, 12 changer transitions 0/416 dead transitions. [2022-01-19 13:07:05,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 416 transitions, 2590 flow [2022-01-19 13:07:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1601 transitions. [2022-01-19 13:07:05,898 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9174785100286533 [2022-01-19 13:07:05,898 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1601 transitions. [2022-01-19 13:07:05,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1601 transitions. [2022-01-19 13:07:05,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:05,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1601 transitions. [2022-01-19 13:07:05,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.2) internal successors, (1601), 5 states have internal predecessors, (1601), 0 states have call successors, (0), 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 13:07:05,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:05,900 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:05,900 INFO L186 Difference]: Start difference. First operand has 911 places, 391 transitions, 2103 flow. Second operand 5 states and 1601 transitions. [2022-01-19 13:07:05,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 416 transitions, 2590 flow [2022-01-19 13:07:06,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 416 transitions, 2256 flow, removed 114 selfloop flow, removed 118 redundant places. [2022-01-19 13:07:06,004 INFO L242 Difference]: Finished difference. Result has 532 places, 398 transitions, 1938 flow [2022-01-19 13:07:06,004 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1938, PETRI_PLACES=532, PETRI_TRANSITIONS=398} [2022-01-19 13:07:06,004 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 213 predicate places. [2022-01-19 13:07:06,005 INFO L470 AbstractCegarLoop]: Abstraction has has 532 places, 398 transitions, 1938 flow [2022-01-19 13:07:06,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:06,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:06,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:06,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 13:07:06,005 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1669880470, now seen corresponding path program 4 times [2022-01-19 13:07:06,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:06,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507608533] [2022-01-19 13:07:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:06,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:06,039 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 13:07:06,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:06,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507608533] [2022-01-19 13:07:06,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507608533] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:06,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:06,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:06,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572284656] [2022-01-19 13:07:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:06,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:06,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:06,041 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:06,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 398 transitions, 1938 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:06,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:06,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:06,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:06,710 INFO L129 PetriNetUnfolder]: 384/3178 cut-off events. [2022-01-19 13:07:06,710 INFO L130 PetriNetUnfolder]: For 8918/9065 co-relation queries the response was YES. [2022-01-19 13:07:06,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7857 conditions, 3178 events. 384/3178 cut-off events. For 8918/9065 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29099 event pairs, 135 based on Foata normal form. 20/2964 useless extension candidates. Maximal degree in co-relation 7698. Up to 289 conditions per place. [2022-01-19 13:07:06,768 INFO L132 encePairwiseOnDemand]: 343/349 looper letters, 78 selfloop transitions, 13 changer transitions 23/427 dead transitions. [2022-01-19 13:07:06,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 427 transitions, 2530 flow [2022-01-19 13:07:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2022-01-19 13:07:06,769 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9191977077363896 [2022-01-19 13:07:06,769 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2022-01-19 13:07:06,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2022-01-19 13:07:06,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:06,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2022-01-19 13:07:06,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 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 13:07:06,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:06,771 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:06,771 INFO L186 Difference]: Start difference. First operand has 532 places, 398 transitions, 1938 flow. Second operand 5 states and 1604 transitions. [2022-01-19 13:07:06,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 427 transitions, 2530 flow [2022-01-19 13:07:06,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 427 transitions, 2488 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:06,816 INFO L242 Difference]: Finished difference. Result has 538 places, 390 transitions, 1822 flow [2022-01-19 13:07:06,817 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1822, PETRI_PLACES=538, PETRI_TRANSITIONS=390} [2022-01-19 13:07:06,817 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 219 predicate places. [2022-01-19 13:07:06,817 INFO L470 AbstractCegarLoop]: Abstraction has has 538 places, 390 transitions, 1822 flow [2022-01-19 13:07:06,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:06,818 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:06,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:06,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-19 13:07:06,818 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:06,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 916627046, now seen corresponding path program 2 times [2022-01-19 13:07:06,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:06,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378827909] [2022-01-19 13:07:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:06,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:06,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 13:07:06,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:06,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378827909] [2022-01-19 13:07:06,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378827909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:06,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:06,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:06,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093531927] [2022-01-19 13:07:06,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:06,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:06,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:06,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:06,861 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:06,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 390 transitions, 1822 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:06,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:06,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:06,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:07,461 INFO L129 PetriNetUnfolder]: 313/2808 cut-off events. [2022-01-19 13:07:07,461 INFO L130 PetriNetUnfolder]: For 9347/9761 co-relation queries the response was YES. [2022-01-19 13:07:07,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7030 conditions, 2808 events. 313/2808 cut-off events. For 9347/9761 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 24654 event pairs, 159 based on Foata normal form. 14/2617 useless extension candidates. Maximal degree in co-relation 6869. Up to 367 conditions per place. [2022-01-19 13:07:07,505 INFO L132 encePairwiseOnDemand]: 343/349 looper letters, 73 selfloop transitions, 10 changer transitions 6/402 dead transitions. [2022-01-19 13:07:07,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 402 transitions, 2092 flow [2022-01-19 13:07:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-01-19 13:07:07,507 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9128939828080229 [2022-01-19 13:07:07,507 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1593 transitions. [2022-01-19 13:07:07,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1593 transitions. [2022-01-19 13:07:07,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:07,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1593 transitions. [2022-01-19 13:07:07,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 0 states have call successors, (0), 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 13:07:07,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:07,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:07,509 INFO L186 Difference]: Start difference. First operand has 538 places, 390 transitions, 1822 flow. Second operand 5 states and 1593 transitions. [2022-01-19 13:07:07,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 402 transitions, 2092 flow [2022-01-19 13:07:07,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 402 transitions, 2058 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 13:07:07,548 INFO L242 Difference]: Finished difference. Result has 540 places, 387 transitions, 1786 flow [2022-01-19 13:07:07,548 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1786, PETRI_PLACES=540, PETRI_TRANSITIONS=387} [2022-01-19 13:07:07,548 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 221 predicate places. [2022-01-19 13:07:07,548 INFO L470 AbstractCegarLoop]: Abstraction has has 540 places, 387 transitions, 1786 flow [2022-01-19 13:07:07,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:07,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:07,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:07,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-19 13:07:07,549 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2006279322, now seen corresponding path program 3 times [2022-01-19 13:07:07,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208687833] [2022-01-19 13:07:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:07,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:07,581 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 13:07:07,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:07,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208687833] [2022-01-19 13:07:07,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208687833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:07,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:07,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:07,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410587260] [2022-01-19 13:07:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:07,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:07,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:07,583 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:07,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 387 transitions, 1786 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:07,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:07,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:07,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:08,152 INFO L129 PetriNetUnfolder]: 329/2788 cut-off events. [2022-01-19 13:07:08,152 INFO L130 PetriNetUnfolder]: For 9066/9469 co-relation queries the response was YES. [2022-01-19 13:07:08,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 2788 events. 329/2788 cut-off events. For 9066/9469 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 24038 event pairs, 111 based on Foata normal form. 19/2593 useless extension candidates. Maximal degree in co-relation 6715. Up to 256 conditions per place. [2022-01-19 13:07:08,260 INFO L132 encePairwiseOnDemand]: 345/349 looper letters, 71 selfloop transitions, 15 changer transitions 2/401 dead transitions. [2022-01-19 13:07:08,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 401 transitions, 2128 flow [2022-01-19 13:07:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1591 transitions. [2022-01-19 13:07:08,262 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9117478510028654 [2022-01-19 13:07:08,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1591 transitions. [2022-01-19 13:07:08,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1591 transitions. [2022-01-19 13:07:08,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:08,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1591 transitions. [2022-01-19 13:07:08,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 318.2) internal successors, (1591), 5 states have internal predecessors, (1591), 0 states have call successors, (0), 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 13:07:08,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:08,264 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:08,264 INFO L186 Difference]: Start difference. First operand has 540 places, 387 transitions, 1786 flow. Second operand 5 states and 1591 transitions. [2022-01-19 13:07:08,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 401 transitions, 2128 flow [2022-01-19 13:07:08,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 401 transitions, 2088 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-01-19 13:07:08,297 INFO L242 Difference]: Finished difference. Result has 537 places, 386 transitions, 1755 flow [2022-01-19 13:07:08,297 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1755, PETRI_PLACES=537, PETRI_TRANSITIONS=386} [2022-01-19 13:07:08,297 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 218 predicate places. [2022-01-19 13:07:08,297 INFO L470 AbstractCegarLoop]: Abstraction has has 537 places, 386 transitions, 1755 flow [2022-01-19 13:07:08,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 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 13:07:08,298 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:08,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:08,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-19 13:07:08,298 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash 293277038, now seen corresponding path program 1 times [2022-01-19 13:07:08,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:08,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91839262] [2022-01-19 13:07:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:08,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:08,335 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 13:07:08,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91839262] [2022-01-19 13:07:08,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91839262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:08,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:08,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:08,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849466833] [2022-01-19 13:07:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:08,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:08,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:08,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:08,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 386 transitions, 1755 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:08,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:08,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:08,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:08,873 INFO L129 PetriNetUnfolder]: 373/2913 cut-off events. [2022-01-19 13:07:08,873 INFO L130 PetriNetUnfolder]: For 8402/8449 co-relation queries the response was YES. [2022-01-19 13:07:08,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7337 conditions, 2913 events. 373/2913 cut-off events. For 8402/8449 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25867 event pairs, 122 based on Foata normal form. 29/2730 useless extension candidates. Maximal degree in co-relation 7180. Up to 202 conditions per place. [2022-01-19 13:07:08,929 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 83 selfloop transitions, 21 changer transitions 13/427 dead transitions. [2022-01-19 13:07:08,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 427 transitions, 2531 flow [2022-01-19 13:07:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2022-01-19 13:07:08,931 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9191977077363896 [2022-01-19 13:07:08,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2022-01-19 13:07:08,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2022-01-19 13:07:08,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:08,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2022-01-19 13:07:08,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 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 13:07:08,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:08,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:08,933 INFO L186 Difference]: Start difference. First operand has 537 places, 386 transitions, 1755 flow. Second operand 5 states and 1604 transitions. [2022-01-19 13:07:08,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 427 transitions, 2531 flow [2022-01-19 13:07:08,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 427 transitions, 2523 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:08,967 INFO L242 Difference]: Finished difference. Result has 545 places, 391 transitions, 1963 flow [2022-01-19 13:07:08,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1963, PETRI_PLACES=545, PETRI_TRANSITIONS=391} [2022-01-19 13:07:08,967 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 226 predicate places. [2022-01-19 13:07:08,968 INFO L470 AbstractCegarLoop]: Abstraction has has 545 places, 391 transitions, 1963 flow [2022-01-19 13:07:08,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:08,968 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:08,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:08,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-19 13:07:08,968 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1851766016, now seen corresponding path program 1 times [2022-01-19 13:07:08,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973801205] [2022-01-19 13:07:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:08,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:09,002 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 13:07:09,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:09,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973801205] [2022-01-19 13:07:09,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973801205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:09,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:09,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:09,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728165757] [2022-01-19 13:07:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:09,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:09,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:09,005 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:09,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 391 transitions, 1963 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:09,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:09,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:09,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:09,659 INFO L129 PetriNetUnfolder]: 371/3171 cut-off events. [2022-01-19 13:07:09,659 INFO L130 PetriNetUnfolder]: For 11078/11713 co-relation queries the response was YES. [2022-01-19 13:07:09,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 3171 events. 371/3171 cut-off events. For 11078/11713 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 28369 event pairs, 121 based on Foata normal form. 43/2963 useless extension candidates. Maximal degree in co-relation 7652. Up to 198 conditions per place. [2022-01-19 13:07:09,725 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 97 selfloop transitions, 26 changer transitions 10/443 dead transitions. [2022-01-19 13:07:09,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 443 transitions, 3002 flow [2022-01-19 13:07:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1605 transitions. [2022-01-19 13:07:09,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9197707736389685 [2022-01-19 13:07:09,727 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1605 transitions. [2022-01-19 13:07:09,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1605 transitions. [2022-01-19 13:07:09,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:09,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1605 transitions. [2022-01-19 13:07:09,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 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 13:07:09,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:09,729 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:09,729 INFO L186 Difference]: Start difference. First operand has 545 places, 391 transitions, 1963 flow. Second operand 5 states and 1605 transitions. [2022-01-19 13:07:09,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 443 transitions, 3002 flow [2022-01-19 13:07:09,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 443 transitions, 2918 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:09,781 INFO L242 Difference]: Finished difference. Result has 546 places, 402 transitions, 2254 flow [2022-01-19 13:07:09,781 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2254, PETRI_PLACES=546, PETRI_TRANSITIONS=402} [2022-01-19 13:07:09,782 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 227 predicate places. [2022-01-19 13:07:09,782 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 402 transitions, 2254 flow [2022-01-19 13:07:09,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:09,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:09,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:09,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-19 13:07:09,783 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1708910834, now seen corresponding path program 2 times [2022-01-19 13:07:09,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:09,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031384592] [2022-01-19 13:07:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:09,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:09,813 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 13:07:09,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:09,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031384592] [2022-01-19 13:07:09,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031384592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:09,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:09,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:09,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403960867] [2022-01-19 13:07:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:09,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:09,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:09,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:09,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:09,815 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:09,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 402 transitions, 2254 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:09,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:09,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:09,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:10,439 INFO L129 PetriNetUnfolder]: 363/3151 cut-off events. [2022-01-19 13:07:10,439 INFO L130 PetriNetUnfolder]: For 11393/11990 co-relation queries the response was YES. [2022-01-19 13:07:10,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7806 conditions, 3151 events. 363/3151 cut-off events. For 11393/11990 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28417 event pairs, 127 based on Foata normal form. 37/2949 useless extension candidates. Maximal degree in co-relation 7644. Up to 326 conditions per place. [2022-01-19 13:07:10,496 INFO L132 encePairwiseOnDemand]: 343/349 looper letters, 95 selfloop transitions, 13 changer transitions 7/425 dead transitions. [2022-01-19 13:07:10,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 425 transitions, 2772 flow [2022-01-19 13:07:10,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-01-19 13:07:10,561 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9163323782234957 [2022-01-19 13:07:10,561 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1599 transitions. [2022-01-19 13:07:10,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1599 transitions. [2022-01-19 13:07:10,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:10,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1599 transitions. [2022-01-19 13:07:10,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 319.8) internal successors, (1599), 5 states have internal predecessors, (1599), 0 states have call successors, (0), 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 13:07:10,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:10,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:10,563 INFO L186 Difference]: Start difference. First operand has 546 places, 402 transitions, 2254 flow. Second operand 5 states and 1599 transitions. [2022-01-19 13:07:10,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 425 transitions, 2772 flow [2022-01-19 13:07:10,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 425 transitions, 2726 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:10,606 INFO L242 Difference]: Finished difference. Result has 552 places, 405 transitions, 2308 flow [2022-01-19 13:07:10,607 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2308, PETRI_PLACES=552, PETRI_TRANSITIONS=405} [2022-01-19 13:07:10,607 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 233 predicate places. [2022-01-19 13:07:10,607 INFO L470 AbstractCegarLoop]: Abstraction has has 552 places, 405 transitions, 2308 flow [2022-01-19 13:07:10,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:10,607 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:10,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:10,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-19 13:07:10,607 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -333599300, now seen corresponding path program 3 times [2022-01-19 13:07:10,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:10,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996250021] [2022-01-19 13:07:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:10,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:10,640 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 13:07:10,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:10,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996250021] [2022-01-19 13:07:10,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996250021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:10,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:10,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:10,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377923803] [2022-01-19 13:07:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:10,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:10,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:10,642 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:10,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 405 transitions, 2308 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:10,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:10,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:10,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:11,199 INFO L129 PetriNetUnfolder]: 320/2815 cut-off events. [2022-01-19 13:07:11,199 INFO L130 PetriNetUnfolder]: For 11102/11873 co-relation queries the response was YES. [2022-01-19 13:07:11,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6950 conditions, 2815 events. 320/2815 cut-off events. For 11102/11873 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 24669 event pairs, 88 based on Foata normal form. 43/2647 useless extension candidates. Maximal degree in co-relation 6785. Up to 163 conditions per place. [2022-01-19 13:07:11,256 INFO L132 encePairwiseOnDemand]: 339/349 looper letters, 92 selfloop transitions, 28 changer transitions 23/453 dead transitions. [2022-01-19 13:07:11,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 453 transitions, 3324 flow [2022-01-19 13:07:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1607 transitions. [2022-01-19 13:07:11,258 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9209169054441261 [2022-01-19 13:07:11,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1607 transitions. [2022-01-19 13:07:11,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1607 transitions. [2022-01-19 13:07:11,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:11,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1607 transitions. [2022-01-19 13:07:11,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.4) internal successors, (1607), 5 states have internal predecessors, (1607), 0 states have call successors, (0), 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 13:07:11,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:11,260 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:11,260 INFO L186 Difference]: Start difference. First operand has 552 places, 405 transitions, 2308 flow. Second operand 5 states and 1607 transitions. [2022-01-19 13:07:11,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 453 transitions, 3324 flow [2022-01-19 13:07:11,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 453 transitions, 3290 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:11,304 INFO L242 Difference]: Finished difference. Result has 558 places, 406 transitions, 2434 flow [2022-01-19 13:07:11,304 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2434, PETRI_PLACES=558, PETRI_TRANSITIONS=406} [2022-01-19 13:07:11,304 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 239 predicate places. [2022-01-19 13:07:11,304 INFO L470 AbstractCegarLoop]: Abstraction has has 558 places, 406 transitions, 2434 flow [2022-01-19 13:07:11,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:11,305 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:11,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:11,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-19 13:07:11,305 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash -814484826, now seen corresponding path program 4 times [2022-01-19 13:07:11,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:11,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909822957] [2022-01-19 13:07:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:11,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:11,335 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 13:07:11,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:11,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909822957] [2022-01-19 13:07:11,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909822957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:11,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:11,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:11,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667105525] [2022-01-19 13:07:11,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:11,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:11,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:11,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:11,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 406 transitions, 2434 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:11,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:11,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:11,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:11,826 INFO L129 PetriNetUnfolder]: 286/2409 cut-off events. [2022-01-19 13:07:11,826 INFO L130 PetriNetUnfolder]: For 10319/11149 co-relation queries the response was YES. [2022-01-19 13:07:11,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 2409 events. 286/2409 cut-off events. For 10319/11149 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 19575 event pairs, 84 based on Foata normal form. 25/2233 useless extension candidates. Maximal degree in co-relation 5799. Up to 194 conditions per place. [2022-01-19 13:07:11,871 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 80 selfloop transitions, 24 changer transitions 10/424 dead transitions. [2022-01-19 13:07:11,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 424 transitions, 2890 flow [2022-01-19 13:07:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-01-19 13:07:11,872 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9128939828080229 [2022-01-19 13:07:11,872 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1593 transitions. [2022-01-19 13:07:11,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1593 transitions. [2022-01-19 13:07:11,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:11,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1593 transitions. [2022-01-19 13:07:11,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 0 states have call successors, (0), 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 13:07:11,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:11,874 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:11,874 INFO L186 Difference]: Start difference. First operand has 558 places, 406 transitions, 2434 flow. Second operand 5 states and 1593 transitions. [2022-01-19 13:07:11,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 424 transitions, 2890 flow [2022-01-19 13:07:11,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 424 transitions, 2762 flow, removed 61 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:11,916 INFO L242 Difference]: Finished difference. Result has 560 places, 406 transitions, 2376 flow [2022-01-19 13:07:11,916 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2376, PETRI_PLACES=560, PETRI_TRANSITIONS=406} [2022-01-19 13:07:11,916 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 241 predicate places. [2022-01-19 13:07:11,916 INFO L470 AbstractCegarLoop]: Abstraction has has 560 places, 406 transitions, 2376 flow [2022-01-19 13:07:11,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:11,916 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:11,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:11,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-19 13:07:11,917 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash 26134532, now seen corresponding path program 2 times [2022-01-19 13:07:11,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:11,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507867145] [2022-01-19 13:07:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:11,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:11,952 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 13:07:11,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:11,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507867145] [2022-01-19 13:07:11,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507867145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:11,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:11,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:11,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048702608] [2022-01-19 13:07:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:11,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:11,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:11,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:11,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:11,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 406 transitions, 2376 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:11,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:11,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:11,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:12,413 INFO L129 PetriNetUnfolder]: 255/2244 cut-off events. [2022-01-19 13:07:12,414 INFO L130 PetriNetUnfolder]: For 7634/8061 co-relation queries the response was YES. [2022-01-19 13:07:12,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 2244 events. 255/2244 cut-off events. For 7634/8061 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 17817 event pairs, 69 based on Foata normal form. 22/2082 useless extension candidates. Maximal degree in co-relation 5257. Up to 141 conditions per place. [2022-01-19 13:07:12,457 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 84 selfloop transitions, 22 changer transitions 1/417 dead transitions. [2022-01-19 13:07:12,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 417 transitions, 2714 flow [2022-01-19 13:07:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1589 transitions. [2022-01-19 13:07:12,459 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9106017191977077 [2022-01-19 13:07:12,459 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1589 transitions. [2022-01-19 13:07:12,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1589 transitions. [2022-01-19 13:07:12,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:12,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1589 transitions. [2022-01-19 13:07:12,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 317.8) internal successors, (1589), 5 states have internal predecessors, (1589), 0 states have call successors, (0), 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 13:07:12,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:12,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:12,461 INFO L186 Difference]: Start difference. First operand has 560 places, 406 transitions, 2376 flow. Second operand 5 states and 1589 transitions. [2022-01-19 13:07:12,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 417 transitions, 2714 flow [2022-01-19 13:07:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 417 transitions, 2555 flow, removed 53 selfloop flow, removed 10 redundant places. [2022-01-19 13:07:12,502 INFO L242 Difference]: Finished difference. Result has 556 places, 406 transitions, 2295 flow [2022-01-19 13:07:12,502 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2295, PETRI_PLACES=556, PETRI_TRANSITIONS=406} [2022-01-19 13:07:12,502 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 237 predicate places. [2022-01-19 13:07:12,503 INFO L470 AbstractCegarLoop]: Abstraction has has 556 places, 406 transitions, 2295 flow [2022-01-19 13:07:12,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:12,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:12,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:12,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-19 13:07:12,503 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2052984068, now seen corresponding path program 3 times [2022-01-19 13:07:12,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:12,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062798842] [2022-01-19 13:07:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:12,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:12,540 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 13:07:12,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:12,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062798842] [2022-01-19 13:07:12,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062798842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:12,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:12,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:12,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298773164] [2022-01-19 13:07:12,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:12,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:12,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:12,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:12,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:12,542 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 13:07:12,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 406 transitions, 2295 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:12,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:12,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 13:07:12,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:12,997 INFO L129 PetriNetUnfolder]: 262/2200 cut-off events. [2022-01-19 13:07:12,997 INFO L130 PetriNetUnfolder]: For 7344/7704 co-relation queries the response was YES. [2022-01-19 13:07:13,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 2200 events. 262/2200 cut-off events. For 7344/7704 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17360 event pairs, 90 based on Foata normal form. 8/2019 useless extension candidates. Maximal degree in co-relation 5055. Up to 266 conditions per place. [2022-01-19 13:07:13,048 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 86 selfloop transitions, 13 changer transitions 1/410 dead transitions. [2022-01-19 13:07:13,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 410 transitions, 2531 flow [2022-01-19 13:07:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1584 transitions. [2022-01-19 13:07:13,049 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9077363896848137 [2022-01-19 13:07:13,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1584 transitions. [2022-01-19 13:07:13,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1584 transitions. [2022-01-19 13:07:13,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:13,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1584 transitions. [2022-01-19 13:07:13,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.8) internal successors, (1584), 5 states have internal predecessors, (1584), 0 states have call successors, (0), 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 13:07:13,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:13,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 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 13:07:13,052 INFO L186 Difference]: Start difference. First operand has 556 places, 406 transitions, 2295 flow. Second operand 5 states and 1584 transitions. [2022-01-19 13:07:13,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 410 transitions, 2531 flow [2022-01-19 13:07:13,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 410 transitions, 2510 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:13,086 INFO L242 Difference]: Finished difference. Result has 559 places, 405 transitions, 2292 flow [2022-01-19 13:07:13,086 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2292, PETRI_PLACES=559, PETRI_TRANSITIONS=405} [2022-01-19 13:07:13,086 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 240 predicate places. [2022-01-19 13:07:13,086 INFO L470 AbstractCegarLoop]: Abstraction has has 559 places, 405 transitions, 2292 flow [2022-01-19 13:07:13,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 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 13:07:13,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:13,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:13,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-19 13:07:13,087 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1168206114, now seen corresponding path program 1 times [2022-01-19 13:07:13,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:13,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099463166] [2022-01-19 13:07:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:13,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:13,179 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 13:07:13,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099463166] [2022-01-19 13:07:13,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099463166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:13,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:13,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:07:13,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604199500] [2022-01-19 13:07:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:13,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:07:13,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:07:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:07:13,181 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:07:13,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 405 transitions, 2292 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:13,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:13,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:07:13,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:15,353 INFO L129 PetriNetUnfolder]: 2842/7869 cut-off events. [2022-01-19 13:07:15,353 INFO L130 PetriNetUnfolder]: For 10931/11141 co-relation queries the response was YES. [2022-01-19 13:07:15,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20074 conditions, 7869 events. 2842/7869 cut-off events. For 10931/11141 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 74910 event pairs, 1141 based on Foata normal form. 15/7204 useless extension candidates. Maximal degree in co-relation 19912. Up to 2638 conditions per place. [2022-01-19 13:07:15,535 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 180 selfloop transitions, 74 changer transitions 44/657 dead transitions. [2022-01-19 13:07:15,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 657 transitions, 4009 flow [2022-01-19 13:07:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 13:07:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 13:07:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 14158 transitions. [2022-01-19 13:07:15,541 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8631347924160214 [2022-01-19 13:07:15,541 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 14158 transitions. [2022-01-19 13:07:15,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 14158 transitions. [2022-01-19 13:07:15,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:15,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 14158 transitions. [2022-01-19 13:07:15,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 301.2340425531915) internal successors, (14158), 47 states have internal predecessors, (14158), 0 states have call successors, (0), 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 13:07:15,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 349.0) internal successors, (16752), 48 states have internal predecessors, (16752), 0 states have call successors, (0), 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 13:07:15,556 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 349.0) internal successors, (16752), 48 states have internal predecessors, (16752), 0 states have call successors, (0), 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 13:07:15,556 INFO L186 Difference]: Start difference. First operand has 559 places, 405 transitions, 2292 flow. Second operand 47 states and 14158 transitions. [2022-01-19 13:07:15,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 657 transitions, 4009 flow [2022-01-19 13:07:15,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 657 transitions, 3999 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:15,609 INFO L242 Difference]: Finished difference. Result has 646 places, 477 transitions, 3011 flow [2022-01-19 13:07:15,609 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3011, PETRI_PLACES=646, PETRI_TRANSITIONS=477} [2022-01-19 13:07:15,610 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 327 predicate places. [2022-01-19 13:07:15,610 INFO L470 AbstractCegarLoop]: Abstraction has has 646 places, 477 transitions, 3011 flow [2022-01-19 13:07:15,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:15,610 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:15,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:15,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-19 13:07:15,610 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash -563903552, now seen corresponding path program 2 times [2022-01-19 13:07:15,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:15,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215307936] [2022-01-19 13:07:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:15,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:15,707 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 13:07:15,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:15,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215307936] [2022-01-19 13:07:15,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215307936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:15,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:15,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:07:15,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786822495] [2022-01-19 13:07:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:15,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:07:15,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:07:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:07:15,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:07:15,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 477 transitions, 3011 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:15,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:15,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:07:15,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:19,678 INFO L129 PetriNetUnfolder]: 4276/12103 cut-off events. [2022-01-19 13:07:19,679 INFO L130 PetriNetUnfolder]: For 59026/60137 co-relation queries the response was YES. [2022-01-19 13:07:20,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48620 conditions, 12103 events. 4276/12103 cut-off events. For 59026/60137 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 127161 event pairs, 1848 based on Foata normal form. 14/11268 useless extension candidates. Maximal degree in co-relation 48416. Up to 3920 conditions per place. [2022-01-19 13:07:20,120 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 239 selfloop transitions, 101 changer transitions 82/781 dead transitions. [2022-01-19 13:07:20,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 781 transitions, 5967 flow [2022-01-19 13:07:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-19 13:07:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-01-19 13:07:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 14468 transitions. [2022-01-19 13:07:20,128 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636580706781279 [2022-01-19 13:07:20,128 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 14468 transitions. [2022-01-19 13:07:20,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 14468 transitions. [2022-01-19 13:07:20,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:20,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 14468 transitions. [2022-01-19 13:07:20,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 301.4166666666667) internal successors, (14468), 48 states have internal predecessors, (14468), 0 states have call successors, (0), 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 13:07:20,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 349.0) internal successors, (17101), 49 states have internal predecessors, (17101), 0 states have call successors, (0), 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 13:07:20,149 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 349.0) internal successors, (17101), 49 states have internal predecessors, (17101), 0 states have call successors, (0), 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 13:07:20,149 INFO L186 Difference]: Start difference. First operand has 646 places, 477 transitions, 3011 flow. Second operand 48 states and 14468 transitions. [2022-01-19 13:07:20,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 781 transitions, 5967 flow [2022-01-19 13:07:20,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 781 transitions, 5629 flow, removed 169 selfloop flow, removed 2 redundant places. [2022-01-19 13:07:20,973 INFO L242 Difference]: Finished difference. Result has 732 places, 528 transitions, 3858 flow [2022-01-19 13:07:20,973 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3858, PETRI_PLACES=732, PETRI_TRANSITIONS=528} [2022-01-19 13:07:20,974 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 413 predicate places. [2022-01-19 13:07:20,974 INFO L470 AbstractCegarLoop]: Abstraction has has 732 places, 528 transitions, 3858 flow [2022-01-19 13:07:20,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:20,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:20,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:20,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-19 13:07:20,974 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:20,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash -221499084, now seen corresponding path program 3 times [2022-01-19 13:07:20,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:20,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441945796] [2022-01-19 13:07:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:20,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:21,089 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 13:07:21,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:21,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441945796] [2022-01-19 13:07:21,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441945796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:21,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:21,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:07:21,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417491250] [2022-01-19 13:07:21,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:21,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:07:21,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:21,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:07:21,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:07:21,092 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:07:21,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 528 transitions, 3858 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:21,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:21,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:07:21,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:26,074 INFO L129 PetriNetUnfolder]: 5085/13495 cut-off events. [2022-01-19 13:07:26,074 INFO L130 PetriNetUnfolder]: For 159017/160064 co-relation queries the response was YES. [2022-01-19 13:07:26,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72304 conditions, 13495 events. 5085/13495 cut-off events. For 159017/160064 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 141921 event pairs, 2235 based on Foata normal form. 50/12291 useless extension candidates. Maximal degree in co-relation 72058. Up to 5008 conditions per place. [2022-01-19 13:07:26,507 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 208 selfloop transitions, 111 changer transitions 38/716 dead transitions. [2022-01-19 13:07:26,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 716 transitions, 6886 flow [2022-01-19 13:07:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 13:07:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 13:07:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 10851 transitions. [2022-01-19 13:07:26,511 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636580706781279 [2022-01-19 13:07:26,511 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 10851 transitions. [2022-01-19 13:07:26,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 10851 transitions. [2022-01-19 13:07:26,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:26,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 10851 transitions. [2022-01-19 13:07:26,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 301.4166666666667) internal successors, (10851), 36 states have internal predecessors, (10851), 0 states have call successors, (0), 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 13:07:26,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 349.0) internal successors, (12913), 37 states have internal predecessors, (12913), 0 states have call successors, (0), 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 13:07:26,523 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 349.0) internal successors, (12913), 37 states have internal predecessors, (12913), 0 states have call successors, (0), 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 13:07:26,523 INFO L186 Difference]: Start difference. First operand has 732 places, 528 transitions, 3858 flow. Second operand 36 states and 10851 transitions. [2022-01-19 13:07:26,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 716 transitions, 6886 flow [2022-01-19 13:07:28,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 716 transitions, 6172 flow, removed 338 selfloop flow, removed 13 redundant places. [2022-01-19 13:07:28,204 INFO L242 Difference]: Finished difference. Result has 769 places, 583 transitions, 4697 flow [2022-01-19 13:07:28,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4697, PETRI_PLACES=769, PETRI_TRANSITIONS=583} [2022-01-19 13:07:28,204 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 450 predicate places. [2022-01-19 13:07:28,204 INFO L470 AbstractCegarLoop]: Abstraction has has 769 places, 583 transitions, 4697 flow [2022-01-19 13:07:28,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:28,205 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:28,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:28,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-19 13:07:28,205 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1347417692, now seen corresponding path program 4 times [2022-01-19 13:07:28,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:28,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731926833] [2022-01-19 13:07:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:28,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:28,305 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 13:07:28,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731926833] [2022-01-19 13:07:28,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731926833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:28,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:28,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:07:28,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106806787] [2022-01-19 13:07:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:28,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:07:28,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:28,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:07:28,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:07:28,308 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:07:28,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 583 transitions, 4697 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:28,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:28,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:07:28,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:33,623 INFO L129 PetriNetUnfolder]: 5527/15293 cut-off events. [2022-01-19 13:07:33,624 INFO L130 PetriNetUnfolder]: For 226905/228561 co-relation queries the response was YES. [2022-01-19 13:07:34,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88045 conditions, 15293 events. 5527/15293 cut-off events. For 226905/228561 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 165770 event pairs, 2672 based on Foata normal form. 22/14152 useless extension candidates. Maximal degree in co-relation 87784. Up to 5365 conditions per place. [2022-01-19 13:07:34,219 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 235 selfloop transitions, 104 changer transitions 35/733 dead transitions. [2022-01-19 13:07:34,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 733 transitions, 7592 flow [2022-01-19 13:07:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 13:07:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 13:07:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 9950 transitions. [2022-01-19 13:07:34,223 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8639402622210645 [2022-01-19 13:07:34,223 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 9950 transitions. [2022-01-19 13:07:34,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 9950 transitions. [2022-01-19 13:07:34,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:34,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 9950 transitions. [2022-01-19 13:07:34,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 301.5151515151515) internal successors, (9950), 33 states have internal predecessors, (9950), 0 states have call successors, (0), 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 13:07:34,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 349.0) internal successors, (11866), 34 states have internal predecessors, (11866), 0 states have call successors, (0), 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 13:07:34,234 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 349.0) internal successors, (11866), 34 states have internal predecessors, (11866), 0 states have call successors, (0), 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 13:07:34,235 INFO L186 Difference]: Start difference. First operand has 769 places, 583 transitions, 4697 flow. Second operand 33 states and 9950 transitions. [2022-01-19 13:07:34,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 733 transitions, 7592 flow [2022-01-19 13:07:36,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 733 transitions, 7080 flow, removed 256 selfloop flow, removed 2 redundant places. [2022-01-19 13:07:36,885 INFO L242 Difference]: Finished difference. Result has 824 places, 642 transitions, 5800 flow [2022-01-19 13:07:36,885 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=4187, PETRI_DIFFERENCE_MINUEND_PLACES=765, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5800, PETRI_PLACES=824, PETRI_TRANSITIONS=642} [2022-01-19 13:07:36,886 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 505 predicate places. [2022-01-19 13:07:36,886 INFO L470 AbstractCegarLoop]: Abstraction has has 824 places, 642 transitions, 5800 flow [2022-01-19 13:07:36,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:36,886 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:36,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:36,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-19 13:07:36,887 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1230362342, now seen corresponding path program 5 times [2022-01-19 13:07:36,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:36,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803942597] [2022-01-19 13:07:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:36,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:36,993 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 13:07:36,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803942597] [2022-01-19 13:07:36,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803942597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:36,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:36,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:07:36,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739163607] [2022-01-19 13:07:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:36,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:07:36,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:36,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:07:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:07:36,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:07:36,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 824 places, 642 transitions, 5800 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:36,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:36,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:07:36,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:43,303 INFO L129 PetriNetUnfolder]: 6251/16271 cut-off events. [2022-01-19 13:07:43,303 INFO L130 PetriNetUnfolder]: For 303658/305831 co-relation queries the response was YES. [2022-01-19 13:07:44,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101936 conditions, 16271 events. 6251/16271 cut-off events. For 303658/305831 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 174784 event pairs, 2465 based on Foata normal form. 30/14742 useless extension candidates. Maximal degree in co-relation 101649. Up to 5681 conditions per place. [2022-01-19 13:07:44,419 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 300 selfloop transitions, 154 changer transitions 30/843 dead transitions. [2022-01-19 13:07:44,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 843 transitions, 9986 flow [2022-01-19 13:07:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 13:07:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 13:07:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 12053 transitions. [2022-01-19 13:07:44,424 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8633954154727793 [2022-01-19 13:07:44,424 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 12053 transitions. [2022-01-19 13:07:44,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 12053 transitions. [2022-01-19 13:07:44,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:44,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 12053 transitions. [2022-01-19 13:07:44,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 301.325) internal successors, (12053), 40 states have internal predecessors, (12053), 0 states have call successors, (0), 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 13:07:44,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 349.0) internal successors, (14309), 41 states have internal predecessors, (14309), 0 states have call successors, (0), 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 13:07:44,438 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 349.0) internal successors, (14309), 41 states have internal predecessors, (14309), 0 states have call successors, (0), 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 13:07:44,438 INFO L186 Difference]: Start difference. First operand has 824 places, 642 transitions, 5800 flow. Second operand 40 states and 12053 transitions. [2022-01-19 13:07:44,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 843 transitions, 9986 flow [2022-01-19 13:07:48,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 843 transitions, 8848 flow, removed 569 selfloop flow, removed 2 redundant places. [2022-01-19 13:07:48,714 INFO L242 Difference]: Finished difference. Result has 892 places, 720 transitions, 7098 flow [2022-01-19 13:07:48,715 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=5048, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=7098, PETRI_PLACES=892, PETRI_TRANSITIONS=720} [2022-01-19 13:07:48,715 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 573 predicate places. [2022-01-19 13:07:48,715 INFO L470 AbstractCegarLoop]: Abstraction has has 892 places, 720 transitions, 7098 flow [2022-01-19 13:07:48,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:48,716 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:48,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:48,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-19 13:07:48,716 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 931605594, now seen corresponding path program 6 times [2022-01-19 13:07:48,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138614076] [2022-01-19 13:07:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:48,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:48,811 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 13:07:48,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:48,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138614076] [2022-01-19 13:07:48,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138614076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:48,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:48,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:07:48,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127472288] [2022-01-19 13:07:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:48,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:07:48,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:07:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:07:48,814 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:07:48,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 892 places, 720 transitions, 7098 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:07:48,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:48,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:07:48,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:57,753 INFO L129 PetriNetUnfolder]: 6449/17040 cut-off events. [2022-01-19 13:07:57,753 INFO L130 PetriNetUnfolder]: For 349822/352714 co-relation queries the response was YES. [2022-01-19 13:07:58,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108553 conditions, 17040 events. 6449/17040 cut-off events. For 349822/352714 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 186533 event pairs, 2355 based on Foata normal form. 94/15553 useless extension candidates. Maximal degree in co-relation 108234. Up to 5708 conditions per place. [2022-01-19 13:07:58,368 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 306 selfloop transitions, 194 changer transitions 29/888 dead transitions. [2022-01-19 13:07:58,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 888 transitions, 10970 flow [2022-01-19 13:07:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 13:07:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 13:07:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9052 transitions. [2022-01-19 13:07:58,371 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8645654250238778 [2022-01-19 13:07:58,371 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9052 transitions. [2022-01-19 13:07:58,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9052 transitions. [2022-01-19 13:07:58,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:58,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9052 transitions. [2022-01-19 13:07:58,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 301.73333333333335) internal successors, (9052), 30 states have internal predecessors, (9052), 0 states have call successors, (0), 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 13:07:58,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 349.0) internal successors, (10819), 31 states have internal predecessors, (10819), 0 states have call successors, (0), 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 13:07:58,382 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 349.0) internal successors, (10819), 31 states have internal predecessors, (10819), 0 states have call successors, (0), 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 13:07:58,382 INFO L186 Difference]: Start difference. First operand has 892 places, 720 transitions, 7098 flow. Second operand 30 states and 9052 transitions. [2022-01-19 13:07:58,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 888 transitions, 10970 flow [2022-01-19 13:08:03,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 888 transitions, 9496 flow, removed 737 selfloop flow, removed 2 redundant places. [2022-01-19 13:08:03,300 INFO L242 Difference]: Finished difference. Result has 934 places, 763 transitions, 7637 flow [2022-01-19 13:08:03,301 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6342, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7637, PETRI_PLACES=934, PETRI_TRANSITIONS=763} [2022-01-19 13:08:03,301 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 615 predicate places. [2022-01-19 13:08:03,301 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 763 transitions, 7637 flow [2022-01-19 13:08:03,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:08:03,302 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:08:03,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:03,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-19 13:08:03,302 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:08:03,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:08:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -241786468, now seen corresponding path program 7 times [2022-01-19 13:08:03,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:08:03,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530702014] [2022-01-19 13:08:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:08:03,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:08:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:08:03,393 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 13:08:03,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:08:03,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530702014] [2022-01-19 13:08:03,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530702014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:08:03,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:08:03,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:08:03,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118495780] [2022-01-19 13:08:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:08:03,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:08:03,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:08:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:08:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:08:03,395 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:08:03,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 763 transitions, 7637 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:08:03,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:08:03,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:08:03,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:08:11,366 INFO L129 PetriNetUnfolder]: 6655/17537 cut-off events. [2022-01-19 13:08:11,367 INFO L130 PetriNetUnfolder]: For 250542/253600 co-relation queries the response was YES. [2022-01-19 13:08:11,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105595 conditions, 17537 events. 6655/17537 cut-off events. For 250542/253600 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 193223 event pairs, 2385 based on Foata normal form. 94/15995 useless extension candidates. Maximal degree in co-relation 105260. Up to 5942 conditions per place. [2022-01-19 13:08:11,960 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 325 selfloop transitions, 219 changer transitions 16/919 dead transitions. [2022-01-19 13:08:11,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 919 transitions, 10951 flow [2022-01-19 13:08:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 13:08:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 13:08:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7255 transitions. [2022-01-19 13:08:11,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8661652340019103 [2022-01-19 13:08:11,964 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7255 transitions. [2022-01-19 13:08:11,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7255 transitions. [2022-01-19 13:08:11,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:08:11,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7255 transitions. [2022-01-19 13:08:11,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 302.2916666666667) internal successors, (7255), 24 states have internal predecessors, (7255), 0 states have call successors, (0), 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 13:08:11,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 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 13:08:11,971 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 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 13:08:11,972 INFO L186 Difference]: Start difference. First operand has 934 places, 763 transitions, 7637 flow. Second operand 24 states and 7255 transitions. [2022-01-19 13:08:11,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 919 transitions, 10951 flow [2022-01-19 13:08:15,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 919 transitions, 10545 flow, removed 203 selfloop flow, removed 2 redundant places. [2022-01-19 13:08:15,296 INFO L242 Difference]: Finished difference. Result has 967 places, 798 transitions, 8579 flow [2022-01-19 13:08:15,297 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=7287, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8579, PETRI_PLACES=967, PETRI_TRANSITIONS=798} [2022-01-19 13:08:15,297 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 648 predicate places. [2022-01-19 13:08:15,297 INFO L470 AbstractCegarLoop]: Abstraction has has 967 places, 798 transitions, 8579 flow [2022-01-19 13:08:15,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:08:15,297 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:08:15,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:15,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-19 13:08:15,298 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:08:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:08:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1039084578, now seen corresponding path program 8 times [2022-01-19 13:08:15,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:08:15,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117395920] [2022-01-19 13:08:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:08:15,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:08:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:08:15,402 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 13:08:15,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:08:15,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117395920] [2022-01-19 13:08:15,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117395920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:08:15,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:08:15,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 13:08:15,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518512611] [2022-01-19 13:08:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:08:15,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 13:08:15,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:08:15,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 13:08:15,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-19 13:08:15,405 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 13:08:15,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 798 transitions, 8579 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 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 13:08:15,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:08:15,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 13:08:15,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:08:24,376 INFO L129 PetriNetUnfolder]: 7172/18753 cut-off events. [2022-01-19 13:08:24,376 INFO L130 PetriNetUnfolder]: For 319766/322852 co-relation queries the response was YES. [2022-01-19 13:08:25,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121160 conditions, 18753 events. 7172/18753 cut-off events. For 319766/322852 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 207149 event pairs, 2596 based on Foata normal form. 47/17024 useless extension candidates. Maximal degree in co-relation 120812. Up to 6069 conditions per place. [2022-01-19 13:08:25,222 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 357 selfloop transitions, 218 changer transitions 26/960 dead transitions. [2022-01-19 13:08:25,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 960 transitions, 12786 flow [2022-01-19 13:08:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 13:08:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 13:08:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 11157 transitions. [2022-01-19 13:08:25,227 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8640130101448154 [2022-01-19 13:08:25,227 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 11157 transitions. [2022-01-19 13:08:25,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 11157 transitions. [2022-01-19 13:08:25,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:08:25,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 11157 transitions. [2022-01-19 13:08:25,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 301.5405405405405) internal successors, (11157), 37 states have internal predecessors, (11157), 0 states have call successors, (0), 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 13:08:25,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 349.0) internal successors, (13262), 38 states have internal predecessors, (13262), 0 states have call successors, (0), 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 13:08:25,239 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 349.0) internal successors, (13262), 38 states have internal predecessors, (13262), 0 states have call successors, (0), 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 13:08:25,240 INFO L186 Difference]: Start difference. First operand has 967 places, 798 transitions, 8579 flow. Second operand 37 states and 11157 transitions. [2022-01-19 13:08:25,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 960 transitions, 12786 flow