/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:45:26,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:45:26,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:45:26,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:45:26,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:45:26,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:45:26,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:45:26,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:45:26,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:45:26,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:45:26,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:45:26,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:45:26,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:45:26,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:45:26,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:45:26,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:45:26,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:45:26,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:45:26,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:45:26,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:45:26,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:45:26,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:45:26,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:45:26,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:45:26,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:45:26,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:45:26,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:45:26,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:45:26,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:45:26,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:45:26,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:45:26,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:45:26,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:45:26,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:45:26,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:45:26,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:45:26,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:45:26,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:45:26,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:45:26,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:45:26,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:45:26,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 00:45:26,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:45:26,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:45:26,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:45:26,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:45:26,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:45:26,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:45:26,750 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:45:26,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:45:26,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:45:26,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:45:26,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:45:26,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:45:26,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:45:26,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:45:26,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:45:26,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:45:26,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:45:26,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:45:26,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:45:26,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:45:26,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:45:26,753 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:45:26,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:45:26,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 00:45:26,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:45:26,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:45:26,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:45:26,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:45:26,928 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:45:26,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2022-01-19 00:45:26,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8dd72a7/18b6f47516aa4eb3914a9f11ad0ece4c/FLAG37533ade6 [2022-01-19 00:45:27,257 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:45:27,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2022-01-19 00:45:27,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8dd72a7/18b6f47516aa4eb3914a9f11ad0ece4c/FLAG37533ade6 [2022-01-19 00:45:27,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8dd72a7/18b6f47516aa4eb3914a9f11ad0ece4c [2022-01-19 00:45:27,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:45:27,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:45:27,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:45:27,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:45:27,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:45:27,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a7b214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27, skipping insertion in model container [2022-01-19 00:45:27,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:45:27,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:45:27,852 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-node-subst.wvr.c[3996,4009] [2022-01-19 00:45:27,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:45:27,878 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:45:27,895 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-node-subst.wvr.c[3996,4009] [2022-01-19 00:45:27,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:45:27,907 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:45:27,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27 WrapperNode [2022-01-19 00:45:27,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:45:27,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:45:27,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:45:27,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:45:27,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,944 INFO L137 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 437 [2022-01-19 00:45:27,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:45:27,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:45:27,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:45:27,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:45:27,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:27,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:45:27,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:45:27,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:45:27,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:45:28,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (1/1) ... [2022-01-19 00:45:28,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:45:28,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:45:28,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:45:28,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:45:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:45:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:45:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:45:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:45:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:45:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:45:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:45:28,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:45:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 00:45:28,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 00:45:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:45:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 00:45:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:45:28,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:45:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:45:28,080 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:45:28,193 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:45:28,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:45:28,602 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:45:28,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:45:28,616 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 00:45:28,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:45:28 BoogieIcfgContainer [2022-01-19 00:45:28,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:45:28,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:45:28,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:45:28,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:45:28,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:45:27" (1/3) ... [2022-01-19 00:45:28,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b297ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:45:28, skipping insertion in model container [2022-01-19 00:45:28,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:45:27" (2/3) ... [2022-01-19 00:45:28,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b297ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:45:28, skipping insertion in model container [2022-01-19 00:45:28,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:45:28" (3/3) ... [2022-01-19 00:45:28,624 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2022-01-19 00:45:28,627 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:45:28,627 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:45:28,627 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:45:28,709 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,716 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,718 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,718 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,718 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,718 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,718 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,718 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,719 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,723 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,723 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,727 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,743 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,744 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,745 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,761 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,761 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,761 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,761 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,762 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,763 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,764 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,768 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,770 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,770 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,770 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,770 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,771 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,772 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,772 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,772 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,772 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,772 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,772 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,773 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,774 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,774 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,774 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,774 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,774 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,775 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,776 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,777 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,778 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,779 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,780 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,783 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,784 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,784 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,784 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,784 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,784 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,784 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,786 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,786 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,786 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,786 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,787 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,788 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,793 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:45:28,796 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 00:45:28,840 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:45:28,844 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:45:28,844 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 00:45:28,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 537 places, 574 transitions, 1172 flow [2022-01-19 00:45:29,035 INFO L129 PetriNetUnfolder]: 47/571 cut-off events. [2022-01-19 00:45:29,035 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:45:29,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 571 events. 47/571 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 849 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 479. Up to 2 conditions per place. [2022-01-19 00:45:29,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 537 places, 574 transitions, 1172 flow [2022-01-19 00:45:29,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 523 places, 560 transitions, 1138 flow [2022-01-19 00:45:29,128 INFO L129 PetriNetUnfolder]: 47/559 cut-off events. [2022-01-19 00:45:29,128 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:45:29,128 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:29,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:29,130 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 00:45:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1302692842, now seen corresponding path program 1 times [2022-01-19 00:45:29,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:29,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516636817] [2022-01-19 00:45:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:29,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:29,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:29,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516636817] [2022-01-19 00:45:29,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516636817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:29,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:29,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 00:45:29,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286090972] [2022-01-19 00:45:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:29,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 00:45:29,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 00:45:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 00:45:29,465 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 538 out of 574 [2022-01-19 00:45:29,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 560 transitions, 1138 flow. Second operand has 2 states, 2 states have (on average 543.0) internal successors, (1086), 2 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:29,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 538 of 574 [2022-01-19 00:45:29,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:29,608 INFO L129 PetriNetUnfolder]: 18/531 cut-off events. [2022-01-19 00:45:29,609 INFO L130 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-01-19 00:45:29,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 531 events. 18/531 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 818 event pairs, 0 based on Foata normal form. 34/524 useless extension candidates. Maximal degree in co-relation 455. Up to 7 conditions per place. [2022-01-19 00:45:29,614 INFO L132 encePairwiseOnDemand]: 545/574 looper letters, 6 selfloop transitions, 0 changer transitions 17/531 dead transitions. [2022-01-19 00:45:29,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 531 transitions, 1092 flow [2022-01-19 00:45:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 00:45:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 00:45:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1111 transitions. [2022-01-19 00:45:29,628 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9677700348432056 [2022-01-19 00:45:29,629 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1111 transitions. [2022-01-19 00:45:29,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1111 transitions. [2022-01-19 00:45:29,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:29,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1111 transitions. [2022-01-19 00:45:29,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 555.5) internal successors, (1111), 2 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 574.0) internal successors, (1722), 3 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,652 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 574.0) internal successors, (1722), 3 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,653 INFO L186 Difference]: Start difference. First operand has 523 places, 560 transitions, 1138 flow. Second operand 2 states and 1111 transitions. [2022-01-19 00:45:29,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 531 transitions, 1092 flow [2022-01-19 00:45:29,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 531 transitions, 1080 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 00:45:29,673 INFO L242 Difference]: Finished difference. Result has 518 places, 514 transitions, 1034 flow [2022-01-19 00:45:29,675 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1034, PETRI_PLACES=518, PETRI_TRANSITIONS=514} [2022-01-19 00:45:29,678 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, -5 predicate places. [2022-01-19 00:45:29,679 INFO L470 AbstractCegarLoop]: Abstraction has has 518 places, 514 transitions, 1034 flow [2022-01-19 00:45:29,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 543.0) internal successors, (1086), 2 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,680 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:29,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:45:29,680 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 00:45:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 357575324, now seen corresponding path program 1 times [2022-01-19 00:45:29,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:29,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319775391] [2022-01-19 00:45:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:29,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:29,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:29,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319775391] [2022-01-19 00:45:29,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319775391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:29,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:29,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:45:29,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883130972] [2022-01-19 00:45:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:29,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:45:29,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:29,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:45:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:45:29,845 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 574 [2022-01-19 00:45:29,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 514 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:29,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 574 [2022-01-19 00:45:29,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:29,959 INFO L129 PetriNetUnfolder]: 40/653 cut-off events. [2022-01-19 00:45:29,960 INFO L130 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2022-01-19 00:45:29,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 653 events. 40/653 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1612 event pairs, 10 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 703. Up to 35 conditions per place. [2022-01-19 00:45:29,965 INFO L132 encePairwiseOnDemand]: 570/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/518 dead transitions. [2022-01-19 00:45:29,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 518 transitions, 1078 flow [2022-01-19 00:45:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:45:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:45:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2022-01-19 00:45:29,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9355400696864111 [2022-01-19 00:45:29,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1611 transitions. [2022-01-19 00:45:29,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1611 transitions. [2022-01-19 00:45:29,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:29,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1611 transitions. [2022-01-19 00:45:29,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 537.0) internal successors, (1611), 3 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 574.0) internal successors, (2296), 4 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 574.0) internal successors, (2296), 4 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,974 INFO L186 Difference]: Start difference. First operand has 518 places, 514 transitions, 1034 flow. Second operand 3 states and 1611 transitions. [2022-01-19 00:45:29,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 518 transitions, 1078 flow [2022-01-19 00:45:29,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 518 transitions, 1078 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:45:29,980 INFO L242 Difference]: Finished difference. Result has 505 places, 516 transitions, 1056 flow [2022-01-19 00:45:29,981 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=505, PETRI_TRANSITIONS=516} [2022-01-19 00:45:29,982 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, -18 predicate places. [2022-01-19 00:45:29,982 INFO L470 AbstractCegarLoop]: Abstraction has has 505 places, 516 transitions, 1056 flow [2022-01-19 00:45:29,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:29,983 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:29,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:29,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:45:29,983 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 00:45:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1088012698, now seen corresponding path program 1 times [2022-01-19 00:45:29,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:29,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16784512] [2022-01-19 00:45:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:29,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:30,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:30,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16784512] [2022-01-19 00:45:30,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16784512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:30,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:30,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:45:30,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463806734] [2022-01-19 00:45:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:30,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:45:30,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:30,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:45:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:45:30,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 574 [2022-01-19 00:45:30,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 516 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:30,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 574 [2022-01-19 00:45:30,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:30,215 INFO L129 PetriNetUnfolder]: 48/795 cut-off events. [2022-01-19 00:45:30,215 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 00:45:30,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 795 events. 48/795 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2824 event pairs, 10 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 877. Up to 35 conditions per place. [2022-01-19 00:45:30,222 INFO L132 encePairwiseOnDemand]: 570/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/520 dead transitions. [2022-01-19 00:45:30,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 520 transitions, 1100 flow [2022-01-19 00:45:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:45:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:45:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2022-01-19 00:45:30,248 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9355400696864111 [2022-01-19 00:45:30,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1611 transitions. [2022-01-19 00:45:30,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1611 transitions. [2022-01-19 00:45:30,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:30,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1611 transitions. [2022-01-19 00:45:30,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 537.0) internal successors, (1611), 3 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 574.0) internal successors, (2296), 4 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 574.0) internal successors, (2296), 4 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,255 INFO L186 Difference]: Start difference. First operand has 505 places, 516 transitions, 1056 flow. Second operand 3 states and 1611 transitions. [2022-01-19 00:45:30,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 520 transitions, 1100 flow [2022-01-19 00:45:30,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 520 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:30,262 INFO L242 Difference]: Finished difference. Result has 507 places, 518 transitions, 1072 flow [2022-01-19 00:45:30,262 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=507, PETRI_TRANSITIONS=518} [2022-01-19 00:45:30,264 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, -16 predicate places. [2022-01-19 00:45:30,264 INFO L470 AbstractCegarLoop]: Abstraction has has 507 places, 518 transitions, 1072 flow [2022-01-19 00:45:30,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,265 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:30,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:30,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:45:30,265 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 00:45:30,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1442648426, now seen corresponding path program 1 times [2022-01-19 00:45:30,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:30,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741623911] [2022-01-19 00:45:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:30,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:30,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741623911] [2022-01-19 00:45:30,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741623911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:30,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:30,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:45:30,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769326187] [2022-01-19 00:45:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:30,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:45:30,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:45:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:45:30,350 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 574 [2022-01-19 00:45:30,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 518 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:30,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 574 [2022-01-19 00:45:30,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:30,482 INFO L129 PetriNetUnfolder]: 44/735 cut-off events. [2022-01-19 00:45:30,482 INFO L130 PetriNetUnfolder]: For 13/38 co-relation queries the response was YES. [2022-01-19 00:45:30,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 735 events. 44/735 cut-off events. For 13/38 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2264 event pairs, 10 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 813. Up to 35 conditions per place. [2022-01-19 00:45:30,491 INFO L132 encePairwiseOnDemand]: 570/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/522 dead transitions. [2022-01-19 00:45:30,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 522 transitions, 1116 flow [2022-01-19 00:45:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:45:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:45:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2022-01-19 00:45:30,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9355400696864111 [2022-01-19 00:45:30,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1611 transitions. [2022-01-19 00:45:30,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1611 transitions. [2022-01-19 00:45:30,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:30,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1611 transitions. [2022-01-19 00:45:30,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 537.0) internal successors, (1611), 3 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 574.0) internal successors, (2296), 4 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 574.0) internal successors, (2296), 4 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,501 INFO L186 Difference]: Start difference. First operand has 507 places, 518 transitions, 1072 flow. Second operand 3 states and 1611 transitions. [2022-01-19 00:45:30,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 522 transitions, 1116 flow [2022-01-19 00:45:30,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 522 transitions, 1110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:30,512 INFO L242 Difference]: Finished difference. Result has 509 places, 520 transitions, 1088 flow [2022-01-19 00:45:30,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1088, PETRI_PLACES=509, PETRI_TRANSITIONS=520} [2022-01-19 00:45:30,514 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, -14 predicate places. [2022-01-19 00:45:30,514 INFO L470 AbstractCegarLoop]: Abstraction has has 509 places, 520 transitions, 1088 flow [2022-01-19 00:45:30,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,515 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:30,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:30,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:45:30,515 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 00:45:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1187024020, now seen corresponding path program 1 times [2022-01-19 00:45:30,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:30,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091990393] [2022-01-19 00:45:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:30,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:30,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:30,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091990393] [2022-01-19 00:45:30,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091990393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:30,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:30,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:45:30,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924520412] [2022-01-19 00:45:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:30,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:45:30,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:45:30,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:45:30,748 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 574 [2022-01-19 00:45:30,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 520 transitions, 1088 flow. Second operand has 8 states, 8 states have (on average 426.375) internal successors, (3411), 8 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:30,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:30,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 574 [2022-01-19 00:45:30,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:31,043 INFO L129 PetriNetUnfolder]: 97/1244 cut-off events. [2022-01-19 00:45:31,043 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-01-19 00:45:31,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 1244 events. 97/1244 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6404 event pairs, 39 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 1556. Up to 159 conditions per place. [2022-01-19 00:45:31,060 INFO L132 encePairwiseOnDemand]: 562/574 looper letters, 106 selfloop transitions, 11 changer transitions 0/524 dead transitions. [2022-01-19 00:45:31,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 524 transitions, 1330 flow [2022-01-19 00:45:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:45:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:45:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3844 transitions. [2022-01-19 00:45:31,066 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7440960123886953 [2022-01-19 00:45:31,066 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3844 transitions. [2022-01-19 00:45:31,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3844 transitions. [2022-01-19 00:45:31,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:31,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3844 transitions. [2022-01-19 00:45:31,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 427.1111111111111) internal successors, (3844), 9 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:31,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 574.0) internal successors, (5740), 10 states have internal predecessors, (5740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:31,117 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 574.0) internal successors, (5740), 10 states have internal predecessors, (5740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:31,117 INFO L186 Difference]: Start difference. First operand has 509 places, 520 transitions, 1088 flow. Second operand 9 states and 3844 transitions. [2022-01-19 00:45:31,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 524 transitions, 1330 flow [2022-01-19 00:45:31,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 524 transitions, 1324 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:31,127 INFO L242 Difference]: Finished difference. Result has 516 places, 521 transitions, 1112 flow [2022-01-19 00:45:31,127 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1112, PETRI_PLACES=516, PETRI_TRANSITIONS=521} [2022-01-19 00:45:31,129 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, -7 predicate places. [2022-01-19 00:45:31,129 INFO L470 AbstractCegarLoop]: Abstraction has has 516 places, 521 transitions, 1112 flow [2022-01-19 00:45:31,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 426.375) internal successors, (3411), 8 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:31,131 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:31,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:31,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:45:31,131 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 00:45:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1538868522, now seen corresponding path program 1 times [2022-01-19 00:45:31,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:31,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475187996] [2022-01-19 00:45:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:31,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:31,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:31,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475187996] [2022-01-19 00:45:31,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475187996] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:45:31,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69170703] [2022-01-19 00:45:31,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:31,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:45:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:45:31,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:45:31,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 00:45:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:31,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 00:45:31,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:45:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:31,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:45:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:32,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69170703] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 00:45:32,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 00:45:32,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2022-01-19 00:45:32,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972039181] [2022-01-19 00:45:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:32,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:45:32,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:32,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:45:32,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-01-19 00:45:32,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 574 [2022-01-19 00:45:32,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 521 transitions, 1112 flow. Second operand has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:32,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:32,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 574 [2022-01-19 00:45:32,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:32,805 INFO L129 PetriNetUnfolder]: 97/1245 cut-off events. [2022-01-19 00:45:32,805 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 00:45:32,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 1245 events. 97/1245 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6396 event pairs, 39 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 1517. Up to 130 conditions per place. [2022-01-19 00:45:32,815 INFO L132 encePairwiseOnDemand]: 556/574 looper letters, 71 selfloop transitions, 17 changer transitions 0/523 dead transitions. [2022-01-19 00:45:32,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 523 transitions, 1292 flow [2022-01-19 00:45:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:45:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:45:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5137 transitions. [2022-01-19 00:45:32,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.813588850174216 [2022-01-19 00:45:32,822 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 5137 transitions. [2022-01-19 00:45:32,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 5137 transitions. [2022-01-19 00:45:32,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:32,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 5137 transitions. [2022-01-19 00:45:32,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 467.0) internal successors, (5137), 11 states have internal predecessors, (5137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:32,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 574.0) internal successors, (6888), 12 states have internal predecessors, (6888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:32,837 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 574.0) internal successors, (6888), 12 states have internal predecessors, (6888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:32,837 INFO L186 Difference]: Start difference. First operand has 516 places, 521 transitions, 1112 flow. Second operand 11 states and 5137 transitions. [2022-01-19 00:45:32,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 523 transitions, 1292 flow [2022-01-19 00:45:32,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1272 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 00:45:32,845 INFO L242 Difference]: Finished difference. Result has 522 places, 523 transitions, 1146 flow [2022-01-19 00:45:32,845 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1146, PETRI_PLACES=522, PETRI_TRANSITIONS=523} [2022-01-19 00:45:32,846 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, -1 predicate places. [2022-01-19 00:45:32,846 INFO L470 AbstractCegarLoop]: Abstraction has has 522 places, 523 transitions, 1146 flow [2022-01-19 00:45:32,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:32,847 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:32,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:32,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 00:45:33,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-19 00:45:33,066 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 00:45:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -317225092, now seen corresponding path program 1 times [2022-01-19 00:45:33,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:33,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902851401] [2022-01-19 00:45:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:33,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:45:33,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:33,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902851401] [2022-01-19 00:45:33,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902851401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:33,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:33,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:45:33,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328799802] [2022-01-19 00:45:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:33,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:45:33,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:33,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:45:33,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:45:33,223 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 574 [2022-01-19 00:45:33,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 523 transitions, 1146 flow. Second operand has 8 states, 8 states have (on average 426.875) internal successors, (3415), 8 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:33,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:33,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 574 [2022-01-19 00:45:33,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:33,451 INFO L129 PetriNetUnfolder]: 67/1026 cut-off events. [2022-01-19 00:45:33,451 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-01-19 00:45:33,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 1026 events. 67/1026 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3961 event pairs, 21 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1287. Up to 136 conditions per place. [2022-01-19 00:45:33,463 INFO L132 encePairwiseOnDemand]: 562/574 looper letters, 108 selfloop transitions, 11 changer transitions 0/527 dead transitions. [2022-01-19 00:45:33,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 527 transitions, 1392 flow [2022-01-19 00:45:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:45:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:45:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3844 transitions. [2022-01-19 00:45:33,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7440960123886953 [2022-01-19 00:45:33,469 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3844 transitions. [2022-01-19 00:45:33,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3844 transitions. [2022-01-19 00:45:33,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:33,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3844 transitions. [2022-01-19 00:45:33,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 427.1111111111111) internal successors, (3844), 9 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:33,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 574.0) internal successors, (5740), 10 states have internal predecessors, (5740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:33,480 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 574.0) internal successors, (5740), 10 states have internal predecessors, (5740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:33,480 INFO L186 Difference]: Start difference. First operand has 522 places, 523 transitions, 1146 flow. Second operand 9 states and 3844 transitions. [2022-01-19 00:45:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 527 transitions, 1392 flow [2022-01-19 00:45:33,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 527 transitions, 1365 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 00:45:33,488 INFO L242 Difference]: Finished difference. Result has 523 places, 524 transitions, 1149 flow [2022-01-19 00:45:33,488 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=523, PETRI_TRANSITIONS=524} [2022-01-19 00:45:33,489 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 0 predicate places. [2022-01-19 00:45:33,489 INFO L470 AbstractCegarLoop]: Abstraction has has 523 places, 524 transitions, 1149 flow [2022-01-19 00:45:33,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 426.875) internal successors, (3415), 8 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:33,490 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:33,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:33,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:45:33,490 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 00:45:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 734939679, now seen corresponding path program 1 times [2022-01-19 00:45:33,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:33,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774053324] [2022-01-19 00:45:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:33,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:45:33,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774053324] [2022-01-19 00:45:33,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774053324] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:45:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047987346] [2022-01-19 00:45:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:33,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:45:33,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:45:33,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:45:33,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 00:45:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:33,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 00:45:33,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:45:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:45:34,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:45:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:45:34,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047987346] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 00:45:34,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 00:45:34,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2022-01-19 00:45:34,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687447468] [2022-01-19 00:45:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:34,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:45:34,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:34,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:45:34,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-01-19 00:45:34,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 574 [2022-01-19 00:45:34,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 524 transitions, 1149 flow. Second operand has 9 states, 9 states have (on average 466.8888888888889) internal successors, (4202), 9 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:34,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:34,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 574 [2022-01-19 00:45:34,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:34,941 INFO L129 PetriNetUnfolder]: 67/1027 cut-off events. [2022-01-19 00:45:34,942 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-01-19 00:45:34,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1027 events. 67/1027 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3949 event pairs, 21 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1262. Up to 91 conditions per place. [2022-01-19 00:45:34,953 INFO L132 encePairwiseOnDemand]: 554/574 looper letters, 71 selfloop transitions, 20 changer transitions 0/526 dead transitions. [2022-01-19 00:45:34,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 526 transitions, 1335 flow [2022-01-19 00:45:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:45:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:45:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 6055 transitions. [2022-01-19 00:45:34,961 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8114446529080676 [2022-01-19 00:45:34,961 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 6055 transitions. [2022-01-19 00:45:34,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 6055 transitions. [2022-01-19 00:45:34,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:34,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 6055 transitions. [2022-01-19 00:45:34,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 465.7692307692308) internal successors, (6055), 13 states have internal predecessors, (6055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:34,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 574.0) internal successors, (8036), 14 states have internal predecessors, (8036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:34,977 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 574.0) internal successors, (8036), 14 states have internal predecessors, (8036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:34,977 INFO L186 Difference]: Start difference. First operand has 523 places, 524 transitions, 1149 flow. Second operand 13 states and 6055 transitions. [2022-01-19 00:45:34,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 526 transitions, 1335 flow [2022-01-19 00:45:34,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 526 transitions, 1315 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 00:45:34,984 INFO L242 Difference]: Finished difference. Result has 531 places, 526 transitions, 1189 flow [2022-01-19 00:45:34,985 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1189, PETRI_PLACES=531, PETRI_TRANSITIONS=526} [2022-01-19 00:45:34,986 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 8 predicate places. [2022-01-19 00:45:34,986 INFO L470 AbstractCegarLoop]: Abstraction has has 531 places, 526 transitions, 1189 flow [2022-01-19 00:45:34,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 466.8888888888889) internal successors, (4202), 9 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:34,987 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:34,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:35,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 00:45:35,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-19 00:45:35,203 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 00:45:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash 128665104, now seen corresponding path program 1 times [2022-01-19 00:45:35,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133043401] [2022-01-19 00:45:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:35,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 00:45:35,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:35,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133043401] [2022-01-19 00:45:35,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133043401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:35,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:35,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:45:35,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815671431] [2022-01-19 00:45:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:35,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:45:35,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:45:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:45:35,368 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 574 [2022-01-19 00:45:35,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 526 transitions, 1189 flow. Second operand has 8 states, 8 states have (on average 427.375) internal successors, (3419), 8 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:35,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:35,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 574 [2022-01-19 00:45:35,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:35,587 INFO L129 PetriNetUnfolder]: 97/1228 cut-off events. [2022-01-19 00:45:35,588 INFO L130 PetriNetUnfolder]: For 49/54 co-relation queries the response was YES. [2022-01-19 00:45:35,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 1228 events. 97/1228 cut-off events. For 49/54 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5453 event pairs, 39 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 1553. Up to 126 conditions per place. [2022-01-19 00:45:35,601 INFO L132 encePairwiseOnDemand]: 564/574 looper letters, 112 selfloop transitions, 9 changer transitions 0/530 dead transitions. [2022-01-19 00:45:35,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 530 transitions, 1439 flow [2022-01-19 00:45:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:45:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:45:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3430 transitions. [2022-01-19 00:45:35,606 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7469512195121951 [2022-01-19 00:45:35,606 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 3430 transitions. [2022-01-19 00:45:35,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 3430 transitions. [2022-01-19 00:45:35,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:35,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 3430 transitions. [2022-01-19 00:45:35,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 428.75) internal successors, (3430), 8 states have internal predecessors, (3430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:35,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 574.0) internal successors, (5166), 9 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:35,616 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 574.0) internal successors, (5166), 9 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:35,616 INFO L186 Difference]: Start difference. First operand has 531 places, 526 transitions, 1189 flow. Second operand 8 states and 3430 transitions. [2022-01-19 00:45:35,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 530 transitions, 1439 flow [2022-01-19 00:45:35,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 530 transitions, 1406 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-01-19 00:45:35,624 INFO L242 Difference]: Finished difference. Result has 529 places, 527 transitions, 1182 flow [2022-01-19 00:45:35,625 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1182, PETRI_PLACES=529, PETRI_TRANSITIONS=527} [2022-01-19 00:45:35,625 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 6 predicate places. [2022-01-19 00:45:35,626 INFO L470 AbstractCegarLoop]: Abstraction has has 529 places, 527 transitions, 1182 flow [2022-01-19 00:45:35,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 427.375) internal successors, (3419), 8 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:35,627 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:35,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:35,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:45:35,627 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 00:45:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1571720606, now seen corresponding path program 1 times [2022-01-19 00:45:35,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987596581] [2022-01-19 00:45:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:35,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 00:45:35,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987596581] [2022-01-19 00:45:35,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987596581] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:45:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369018054] [2022-01-19 00:45:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:35,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:45:35,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:45:35,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:45:35,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 00:45:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:35,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 00:45:35,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:45:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 00:45:36,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:45:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 00:45:36,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369018054] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 00:45:36,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 00:45:36,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2022-01-19 00:45:36,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128122770] [2022-01-19 00:45:36,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:36,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:45:36,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:36,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:45:36,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-01-19 00:45:36,741 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 574 [2022-01-19 00:45:36,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 527 transitions, 1182 flow. Second operand has 9 states, 9 states have (on average 467.77777777777777) internal successors, (4210), 9 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:36,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:36,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 574 [2022-01-19 00:45:36,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:37,043 INFO L129 PetriNetUnfolder]: 97/1229 cut-off events. [2022-01-19 00:45:37,044 INFO L130 PetriNetUnfolder]: For 55/60 co-relation queries the response was YES. [2022-01-19 00:45:37,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 1229 events. 97/1229 cut-off events. For 55/60 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5442 event pairs, 39 based on Foata normal form. 0/1146 useless extension candidates. Maximal degree in co-relation 1524. Up to 86 conditions per place. [2022-01-19 00:45:37,055 INFO L132 encePairwiseOnDemand]: 554/574 looper letters, 73 selfloop transitions, 21 changer transitions 0/529 dead transitions. [2022-01-19 00:45:37,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 529 transitions, 1374 flow [2022-01-19 00:45:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 00:45:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 00:45:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5596 transitions. [2022-01-19 00:45:37,063 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8124274099883856 [2022-01-19 00:45:37,063 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 5596 transitions. [2022-01-19 00:45:37,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 5596 transitions. [2022-01-19 00:45:37,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:37,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 5596 transitions. [2022-01-19 00:45:37,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 466.3333333333333) internal successors, (5596), 12 states have internal predecessors, (5596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 574.0) internal successors, (7462), 13 states have internal predecessors, (7462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,079 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 574.0) internal successors, (7462), 13 states have internal predecessors, (7462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,079 INFO L186 Difference]: Start difference. First operand has 529 places, 527 transitions, 1182 flow. Second operand 12 states and 5596 transitions. [2022-01-19 00:45:37,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 529 transitions, 1374 flow [2022-01-19 00:45:37,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 529 transitions, 1358 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 00:45:37,086 INFO L242 Difference]: Finished difference. Result has 537 places, 529 transitions, 1227 flow [2022-01-19 00:45:37,087 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1227, PETRI_PLACES=537, PETRI_TRANSITIONS=529} [2022-01-19 00:45:37,087 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 14 predicate places. [2022-01-19 00:45:37,087 INFO L470 AbstractCegarLoop]: Abstraction has has 537 places, 529 transitions, 1227 flow [2022-01-19 00:45:37,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 467.77777777777777) internal successors, (4210), 9 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,088 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:37,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:37,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 00:45:37,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:45:37,303 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 00:45:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2133676956, now seen corresponding path program 1 times [2022-01-19 00:45:37,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:37,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39436422] [2022-01-19 00:45:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:37,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:37,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39436422] [2022-01-19 00:45:37,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39436422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:37,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:37,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:45:37,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652925519] [2022-01-19 00:45:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:37,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:45:37,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:45:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:45:37,445 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 574 [2022-01-19 00:45:37,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 529 transitions, 1227 flow. Second operand has 7 states, 7 states have (on average 455.57142857142856) internal successors, (3189), 7 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:37,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 574 [2022-01-19 00:45:37,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:37,641 INFO L129 PetriNetUnfolder]: 59/949 cut-off events. [2022-01-19 00:45:37,641 INFO L130 PetriNetUnfolder]: For 28/38 co-relation queries the response was YES. [2022-01-19 00:45:37,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 949 events. 59/949 cut-off events. For 28/38 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3467 event pairs, 14 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 1229. Up to 112 conditions per place. [2022-01-19 00:45:37,649 INFO L132 encePairwiseOnDemand]: 566/574 looper letters, 94 selfloop transitions, 5 changer transitions 4/549 dead transitions. [2022-01-19 00:45:37,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 549 transitions, 1486 flow [2022-01-19 00:45:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:45:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:45:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4100 transitions. [2022-01-19 00:45:37,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2022-01-19 00:45:37,655 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 4100 transitions. [2022-01-19 00:45:37,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 4100 transitions. [2022-01-19 00:45:37,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:37,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 4100 transitions. [2022-01-19 00:45:37,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 455.55555555555554) internal successors, (4100), 9 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 574.0) internal successors, (5740), 10 states have internal predecessors, (5740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,688 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 574.0) internal successors, (5740), 10 states have internal predecessors, (5740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,688 INFO L186 Difference]: Start difference. First operand has 537 places, 529 transitions, 1227 flow. Second operand 9 states and 4100 transitions. [2022-01-19 00:45:37,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 549 transitions, 1486 flow [2022-01-19 00:45:37,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 549 transitions, 1450 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-01-19 00:45:37,695 INFO L242 Difference]: Finished difference. Result has 543 places, 533 transitions, 1232 flow [2022-01-19 00:45:37,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1232, PETRI_PLACES=543, PETRI_TRANSITIONS=533} [2022-01-19 00:45:37,696 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 20 predicate places. [2022-01-19 00:45:37,696 INFO L470 AbstractCegarLoop]: Abstraction has has 543 places, 533 transitions, 1232 flow [2022-01-19 00:45:37,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 455.57142857142856) internal successors, (3189), 7 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,697 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:37,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:37,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:45:37,697 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 00:45:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 543717480, now seen corresponding path program 1 times [2022-01-19 00:45:37,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034820208] [2022-01-19 00:45:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:37,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:37,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:37,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034820208] [2022-01-19 00:45:37,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034820208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:37,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:37,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 00:45:37,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964107061] [2022-01-19 00:45:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:37,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 00:45:37,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:37,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 00:45:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-01-19 00:45:37,909 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:37,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 533 transitions, 1232 flow. Second operand has 11 states, 11 states have (on average 443.09090909090907) internal successors, (4874), 11 states have internal predecessors, (4874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:37,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:37,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:37,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:38,492 INFO L129 PetriNetUnfolder]: 516/2488 cut-off events. [2022-01-19 00:45:38,492 INFO L130 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-01-19 00:45:38,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 2488 events. 516/2488 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19272 event pairs, 186 based on Foata normal form. 1/2234 useless extension candidates. Maximal degree in co-relation 3861. Up to 331 conditions per place. [2022-01-19 00:45:38,521 INFO L132 encePairwiseOnDemand]: 552/574 looper letters, 125 selfloop transitions, 24 changer transitions 4/590 dead transitions. [2022-01-19 00:45:38,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 590 transitions, 1689 flow [2022-01-19 00:45:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 00:45:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 00:45:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8419 transitions. [2022-01-19 00:45:38,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.77196038877682 [2022-01-19 00:45:38,532 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 8419 transitions. [2022-01-19 00:45:38,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 8419 transitions. [2022-01-19 00:45:38,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:38,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 8419 transitions. [2022-01-19 00:45:38,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 443.10526315789474) internal successors, (8419), 19 states have internal predecessors, (8419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:38,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 574.0) internal successors, (11480), 20 states have internal predecessors, (11480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:38,600 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 574.0) internal successors, (11480), 20 states have internal predecessors, (11480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:38,601 INFO L186 Difference]: Start difference. First operand has 543 places, 533 transitions, 1232 flow. Second operand 19 states and 8419 transitions. [2022-01-19 00:45:38,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 590 transitions, 1689 flow [2022-01-19 00:45:38,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 590 transitions, 1682 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-01-19 00:45:38,610 INFO L242 Difference]: Finished difference. Result has 564 places, 539 transitions, 1323 flow [2022-01-19 00:45:38,610 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1323, PETRI_PLACES=564, PETRI_TRANSITIONS=539} [2022-01-19 00:45:38,611 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 41 predicate places. [2022-01-19 00:45:38,611 INFO L470 AbstractCegarLoop]: Abstraction has has 564 places, 539 transitions, 1323 flow [2022-01-19 00:45:38,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 443.09090909090907) internal successors, (4874), 11 states have internal predecessors, (4874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:38,612 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:38,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:45:38,613 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 00:45:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1225140670, now seen corresponding path program 1 times [2022-01-19 00:45:38,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:38,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700515524] [2022-01-19 00:45:38,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:38,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:38,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700515524] [2022-01-19 00:45:38,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700515524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:38,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:38,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:38,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215691748] [2022-01-19 00:45:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:38,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:38,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:38,804 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:38,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 539 transitions, 1323 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:38,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:38,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:38,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:39,593 INFO L129 PetriNetUnfolder]: 893/3304 cut-off events. [2022-01-19 00:45:39,593 INFO L130 PetriNetUnfolder]: For 468/501 co-relation queries the response was YES. [2022-01-19 00:45:39,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 3304 events. 893/3304 cut-off events. For 468/501 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28994 event pairs, 413 based on Foata normal form. 8/3004 useless extension candidates. Maximal degree in co-relation 5056. Up to 813 conditions per place. [2022-01-19 00:45:39,621 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 139 selfloop transitions, 30 changer transitions 24/640 dead transitions. [2022-01-19 00:45:39,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 640 transitions, 1962 flow [2022-01-19 00:45:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:45:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:45:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 10634 transitions. [2022-01-19 00:45:39,630 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7719221835075494 [2022-01-19 00:45:39,630 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 10634 transitions. [2022-01-19 00:45:39,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 10634 transitions. [2022-01-19 00:45:39,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:39,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 10634 transitions. [2022-01-19 00:45:39,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 443.0833333333333) internal successors, (10634), 24 states have internal predecessors, (10634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:39,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 574.0) internal successors, (14350), 25 states have internal predecessors, (14350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:39,650 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 574.0) internal successors, (14350), 25 states have internal predecessors, (14350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:39,650 INFO L186 Difference]: Start difference. First operand has 564 places, 539 transitions, 1323 flow. Second operand 24 states and 10634 transitions. [2022-01-19 00:45:39,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 640 transitions, 1962 flow [2022-01-19 00:45:39,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 640 transitions, 1905 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-01-19 00:45:39,659 INFO L242 Difference]: Finished difference. Result has 594 places, 568 transitions, 1498 flow [2022-01-19 00:45:39,660 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1498, PETRI_PLACES=594, PETRI_TRANSITIONS=568} [2022-01-19 00:45:39,661 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 71 predicate places. [2022-01-19 00:45:39,661 INFO L470 AbstractCegarLoop]: Abstraction has has 594 places, 568 transitions, 1498 flow [2022-01-19 00:45:39,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:39,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:39,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:39,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:45:39,663 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 00:45:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1530908422, now seen corresponding path program 2 times [2022-01-19 00:45:39,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:39,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314372700] [2022-01-19 00:45:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:39,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:39,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:39,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314372700] [2022-01-19 00:45:39,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314372700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:39,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:39,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:39,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905877753] [2022-01-19 00:45:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:39,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:39,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:39,842 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:39,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 568 transitions, 1498 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:39,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:39,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:39,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:41,064 INFO L129 PetriNetUnfolder]: 1411/5027 cut-off events. [2022-01-19 00:45:41,064 INFO L130 PetriNetUnfolder]: For 4850/4912 co-relation queries the response was YES. [2022-01-19 00:45:41,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10661 conditions, 5027 events. 1411/5027 cut-off events. For 4850/4912 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 51013 event pairs, 711 based on Foata normal form. 1/4524 useless extension candidates. Maximal degree in co-relation 10612. Up to 1260 conditions per place. [2022-01-19 00:45:41,118 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 172 selfloop transitions, 45 changer transitions 22/686 dead transitions. [2022-01-19 00:45:41,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 686 transitions, 2521 flow [2022-01-19 00:45:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:45:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:45:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 10631 transitions. [2022-01-19 00:45:41,127 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7717044134727061 [2022-01-19 00:45:41,127 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 10631 transitions. [2022-01-19 00:45:41,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 10631 transitions. [2022-01-19 00:45:41,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:41,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 10631 transitions. [2022-01-19 00:45:41,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 442.9583333333333) internal successors, (10631), 24 states have internal predecessors, (10631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:41,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 574.0) internal successors, (14350), 25 states have internal predecessors, (14350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:41,159 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 574.0) internal successors, (14350), 25 states have internal predecessors, (14350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:41,159 INFO L186 Difference]: Start difference. First operand has 594 places, 568 transitions, 1498 flow. Second operand 24 states and 10631 transitions. [2022-01-19 00:45:41,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 686 transitions, 2521 flow [2022-01-19 00:45:41,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 686 transitions, 2511 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:41,280 INFO L242 Difference]: Finished difference. Result has 633 places, 597 transitions, 1908 flow [2022-01-19 00:45:41,280 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1908, PETRI_PLACES=633, PETRI_TRANSITIONS=597} [2022-01-19 00:45:41,281 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 110 predicate places. [2022-01-19 00:45:41,281 INFO L470 AbstractCegarLoop]: Abstraction has has 633 places, 597 transitions, 1908 flow [2022-01-19 00:45:41,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:41,282 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:41,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:41,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:45:41,282 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 00:45:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1785006958, now seen corresponding path program 3 times [2022-01-19 00:45:41,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:41,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444139975] [2022-01-19 00:45:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:41,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:41,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:41,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444139975] [2022-01-19 00:45:41,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444139975] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:41,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:41,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:41,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883687112] [2022-01-19 00:45:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:41,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:41,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:41,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:41,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 597 transitions, 1908 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:41,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:41,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:41,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:42,943 INFO L129 PetriNetUnfolder]: 1569/5766 cut-off events. [2022-01-19 00:45:42,943 INFO L130 PetriNetUnfolder]: For 13767/13816 co-relation queries the response was YES. [2022-01-19 00:45:43,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14655 conditions, 5766 events. 1569/5766 cut-off events. For 13767/13816 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 61715 event pairs, 867 based on Foata normal form. 6/5195 useless extension candidates. Maximal degree in co-relation 14587. Up to 1600 conditions per place. [2022-01-19 00:45:43,019 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 161 selfloop transitions, 56 changer transitions 20/684 dead transitions. [2022-01-19 00:45:43,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 684 transitions, 3111 flow [2022-01-19 00:45:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:45:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:45:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 9747 transitions. [2022-01-19 00:45:43,025 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7718561925879 [2022-01-19 00:45:43,025 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 9747 transitions. [2022-01-19 00:45:43,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 9747 transitions. [2022-01-19 00:45:43,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:43,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 9747 transitions. [2022-01-19 00:45:43,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 443.04545454545456) internal successors, (9747), 22 states have internal predecessors, (9747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:43,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 574.0) internal successors, (13202), 23 states have internal predecessors, (13202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:43,043 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 574.0) internal successors, (13202), 23 states have internal predecessors, (13202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:43,043 INFO L186 Difference]: Start difference. First operand has 633 places, 597 transitions, 1908 flow. Second operand 22 states and 9747 transitions. [2022-01-19 00:45:43,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 684 transitions, 3111 flow [2022-01-19 00:45:43,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 684 transitions, 2973 flow, removed 69 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:43,105 INFO L242 Difference]: Finished difference. Result has 664 places, 627 transitions, 2381 flow [2022-01-19 00:45:43,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2381, PETRI_PLACES=664, PETRI_TRANSITIONS=627} [2022-01-19 00:45:43,106 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 141 predicate places. [2022-01-19 00:45:43,106 INFO L470 AbstractCegarLoop]: Abstraction has has 664 places, 627 transitions, 2381 flow [2022-01-19 00:45:43,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:43,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:43,107 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:43,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:45:43,107 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 00:45:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1830264126, now seen corresponding path program 4 times [2022-01-19 00:45:43,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33807845] [2022-01-19 00:45:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:43,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:43,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:43,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33807845] [2022-01-19 00:45:43,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33807845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:43,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:43,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:43,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091084888] [2022-01-19 00:45:43,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:43,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:43,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:43,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:43,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 627 transitions, 2381 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:43,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:43,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:43,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:44,977 INFO L129 PetriNetUnfolder]: 1789/6355 cut-off events. [2022-01-19 00:45:44,977 INFO L130 PetriNetUnfolder]: For 25194/25294 co-relation queries the response was YES. [2022-01-19 00:45:45,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17767 conditions, 6355 events. 1789/6355 cut-off events. For 25194/25294 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 69703 event pairs, 1067 based on Foata normal form. 1/5707 useless extension candidates. Maximal degree in co-relation 17686. Up to 1603 conditions per place. [2022-01-19 00:45:45,052 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 179 selfloop transitions, 61 changer transitions 18/705 dead transitions. [2022-01-19 00:45:45,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 705 transitions, 3736 flow [2022-01-19 00:45:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:45:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:45:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 8871 transitions. [2022-01-19 00:45:45,057 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7727351916376307 [2022-01-19 00:45:45,057 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 8871 transitions. [2022-01-19 00:45:45,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 8871 transitions. [2022-01-19 00:45:45,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:45,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 8871 transitions. [2022-01-19 00:45:45,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 443.55) internal successors, (8871), 20 states have internal predecessors, (8871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:45,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 574.0) internal successors, (12054), 21 states have internal predecessors, (12054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:45,072 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 574.0) internal successors, (12054), 21 states have internal predecessors, (12054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:45,072 INFO L186 Difference]: Start difference. First operand has 664 places, 627 transitions, 2381 flow. Second operand 20 states and 8871 transitions. [2022-01-19 00:45:45,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 705 transitions, 3736 flow [2022-01-19 00:45:45,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 705 transitions, 3514 flow, removed 111 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:45,155 INFO L242 Difference]: Finished difference. Result has 694 places, 659 transitions, 2899 flow [2022-01-19 00:45:45,156 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2899, PETRI_PLACES=694, PETRI_TRANSITIONS=659} [2022-01-19 00:45:45,156 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 171 predicate places. [2022-01-19 00:45:45,156 INFO L470 AbstractCegarLoop]: Abstraction has has 694 places, 659 transitions, 2899 flow [2022-01-19 00:45:45,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:45,157 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:45,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:45,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:45:45,157 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 00:45:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash 962783392, now seen corresponding path program 5 times [2022-01-19 00:45:45,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:45,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932194698] [2022-01-19 00:45:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:45,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:45,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:45,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932194698] [2022-01-19 00:45:45,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932194698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:45,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:45,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:45,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819475049] [2022-01-19 00:45:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:45,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:45,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:45,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:45,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:45,368 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:45,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 659 transitions, 2899 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:45,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:45,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:45,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:47,275 INFO L129 PetriNetUnfolder]: 1844/6547 cut-off events. [2022-01-19 00:45:47,275 INFO L130 PetriNetUnfolder]: For 34623/34704 co-relation queries the response was YES. [2022-01-19 00:45:47,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19936 conditions, 6547 events. 1844/6547 cut-off events. For 34623/34704 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 72962 event pairs, 924 based on Foata normal form. 25/5871 useless extension candidates. Maximal degree in co-relation 19841. Up to 1861 conditions per place. [2022-01-19 00:45:47,355 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 198 selfloop transitions, 78 changer transitions 15/738 dead transitions. [2022-01-19 00:45:47,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 738 transitions, 4413 flow [2022-01-19 00:45:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:45:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:45:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 8867 transitions. [2022-01-19 00:45:47,359 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7723867595818815 [2022-01-19 00:45:47,359 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 8867 transitions. [2022-01-19 00:45:47,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 8867 transitions. [2022-01-19 00:45:47,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:47,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 8867 transitions. [2022-01-19 00:45:47,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 443.35) internal successors, (8867), 20 states have internal predecessors, (8867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 574.0) internal successors, (12054), 21 states have internal predecessors, (12054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,372 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 574.0) internal successors, (12054), 21 states have internal predecessors, (12054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,372 INFO L186 Difference]: Start difference. First operand has 694 places, 659 transitions, 2899 flow. Second operand 20 states and 8867 transitions. [2022-01-19 00:45:47,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 738 transitions, 4413 flow [2022-01-19 00:45:47,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 738 transitions, 4057 flow, removed 178 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:47,502 INFO L242 Difference]: Finished difference. Result has 724 places, 690 transitions, 3436 flow [2022-01-19 00:45:47,503 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3436, PETRI_PLACES=724, PETRI_TRANSITIONS=690} [2022-01-19 00:45:47,503 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 201 predicate places. [2022-01-19 00:45:47,503 INFO L470 AbstractCegarLoop]: Abstraction has has 724 places, 690 transitions, 3436 flow [2022-01-19 00:45:47,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,504 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:47,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:47,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:45:47,504 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 00:45:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 273410968, now seen corresponding path program 6 times [2022-01-19 00:45:47,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:47,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045891705] [2022-01-19 00:45:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:47,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:47,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045891705] [2022-01-19 00:45:47,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045891705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:47,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:47,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:47,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407831117] [2022-01-19 00:45:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:47,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:47,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:47,658 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:47,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 690 transitions, 3436 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:47,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:47,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:49,657 INFO L129 PetriNetUnfolder]: 1889/6847 cut-off events. [2022-01-19 00:45:49,658 INFO L130 PetriNetUnfolder]: For 39406/39511 co-relation queries the response was YES. [2022-01-19 00:45:49,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21151 conditions, 6847 events. 1889/6847 cut-off events. For 39406/39511 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 77777 event pairs, 915 based on Foata normal form. 26/6160 useless extension candidates. Maximal degree in co-relation 21042. Up to 1881 conditions per place. [2022-01-19 00:45:49,749 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 200 selfloop transitions, 96 changer transitions 13/756 dead transitions. [2022-01-19 00:45:49,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 756 transitions, 4858 flow [2022-01-19 00:45:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:45:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:45:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7991 transitions. [2022-01-19 00:45:49,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7734223770809137 [2022-01-19 00:45:49,754 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7991 transitions. [2022-01-19 00:45:49,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7991 transitions. [2022-01-19 00:45:49,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:49,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7991 transitions. [2022-01-19 00:45:49,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 443.94444444444446) internal successors, (7991), 18 states have internal predecessors, (7991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:49,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:49,766 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:49,766 INFO L186 Difference]: Start difference. First operand has 724 places, 690 transitions, 3436 flow. Second operand 18 states and 7991 transitions. [2022-01-19 00:45:49,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 739 places, 756 transitions, 4858 flow [2022-01-19 00:45:49,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 756 transitions, 4462 flow, removed 198 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:49,934 INFO L242 Difference]: Finished difference. Result has 745 places, 711 transitions, 3811 flow [2022-01-19 00:45:49,934 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=3234, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3811, PETRI_PLACES=745, PETRI_TRANSITIONS=711} [2022-01-19 00:45:49,935 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 222 predicate places. [2022-01-19 00:45:49,935 INFO L470 AbstractCegarLoop]: Abstraction has has 745 places, 711 transitions, 3811 flow [2022-01-19 00:45:49,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:49,935 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:49,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:49,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:45:49,936 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 00:45:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 85187686, now seen corresponding path program 7 times [2022-01-19 00:45:49,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:49,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677535283] [2022-01-19 00:45:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:49,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:50,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:50,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677535283] [2022-01-19 00:45:50,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677535283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:50,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:50,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:50,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492610219] [2022-01-19 00:45:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:50,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:50,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:50,067 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:50,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 711 transitions, 3811 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:50,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:50,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:50,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:52,179 INFO L129 PetriNetUnfolder]: 1988/7284 cut-off events. [2022-01-19 00:45:52,179 INFO L130 PetriNetUnfolder]: For 31806/31939 co-relation queries the response was YES. [2022-01-19 00:45:52,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22064 conditions, 7284 events. 1988/7284 cut-off events. For 31806/31939 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 83921 event pairs, 944 based on Foata normal form. 49/6576 useless extension candidates. Maximal degree in co-relation 21948. Up to 1952 conditions per place. [2022-01-19 00:45:52,296 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 210 selfloop transitions, 100 changer transitions 12/769 dead transitions. [2022-01-19 00:45:52,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 769 transitions, 5111 flow [2022-01-19 00:45:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:45:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:45:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7554 transitions. [2022-01-19 00:45:52,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.774134043861447 [2022-01-19 00:45:52,302 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 7554 transitions. [2022-01-19 00:45:52,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 7554 transitions. [2022-01-19 00:45:52,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:52,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 7554 transitions. [2022-01-19 00:45:52,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 444.3529411764706) internal successors, (7554), 17 states have internal predecessors, (7554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:52,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:52,314 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:52,314 INFO L186 Difference]: Start difference. First operand has 745 places, 711 transitions, 3811 flow. Second operand 17 states and 7554 transitions. [2022-01-19 00:45:52,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 769 transitions, 5111 flow [2022-01-19 00:45:52,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 757 places, 769 transitions, 4969 flow, removed 71 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:52,475 INFO L242 Difference]: Finished difference. Result has 766 places, 732 transitions, 4330 flow [2022-01-19 00:45:52,476 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=3703, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4330, PETRI_PLACES=766, PETRI_TRANSITIONS=732} [2022-01-19 00:45:52,476 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 243 predicate places. [2022-01-19 00:45:52,476 INFO L470 AbstractCegarLoop]: Abstraction has has 766 places, 732 transitions, 4330 flow [2022-01-19 00:45:52,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:52,477 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:52,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:52,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:45:52,478 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 00:45:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -749226540, now seen corresponding path program 8 times [2022-01-19 00:45:52,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:52,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036078650] [2022-01-19 00:45:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:52,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:52,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:52,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036078650] [2022-01-19 00:45:52,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036078650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:52,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:52,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:52,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810651808] [2022-01-19 00:45:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:52,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:52,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:52,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:52,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:52,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 766 places, 732 transitions, 4330 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:52,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:52,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:52,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:54,804 INFO L129 PetriNetUnfolder]: 1996/7548 cut-off events. [2022-01-19 00:45:54,804 INFO L130 PetriNetUnfolder]: For 37096/37289 co-relation queries the response was YES. [2022-01-19 00:45:54,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23140 conditions, 7548 events. 1996/7548 cut-off events. For 37096/37289 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 88213 event pairs, 989 based on Foata normal form. 82/6867 useless extension candidates. Maximal degree in co-relation 23016. Up to 2002 conditions per place. [2022-01-19 00:45:54,911 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 211 selfloop transitions, 107 changer transitions 15/780 dead transitions. [2022-01-19 00:45:54,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 780 transitions, 5417 flow [2022-01-19 00:45:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:45:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:45:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 7114 transitions. [2022-01-19 00:45:54,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7746080139372822 [2022-01-19 00:45:54,915 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 7114 transitions. [2022-01-19 00:45:54,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 7114 transitions. [2022-01-19 00:45:54,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:54,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 7114 transitions. [2022-01-19 00:45:54,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 444.625) internal successors, (7114), 16 states have internal predecessors, (7114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:54,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 574.0) internal successors, (9758), 17 states have internal predecessors, (9758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:54,924 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 574.0) internal successors, (9758), 17 states have internal predecessors, (9758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:54,924 INFO L186 Difference]: Start difference. First operand has 766 places, 732 transitions, 4330 flow. Second operand 16 states and 7114 transitions. [2022-01-19 00:45:54,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 780 transitions, 5417 flow [2022-01-19 00:45:55,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 780 transitions, 5297 flow, removed 60 selfloop flow, removed 2 redundant places. [2022-01-19 00:45:55,219 INFO L242 Difference]: Finished difference. Result has 784 places, 740 transitions, 4618 flow [2022-01-19 00:45:55,219 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=4214, PETRI_DIFFERENCE_MINUEND_PLACES=762, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4618, PETRI_PLACES=784, PETRI_TRANSITIONS=740} [2022-01-19 00:45:55,220 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 261 predicate places. [2022-01-19 00:45:55,220 INFO L470 AbstractCegarLoop]: Abstraction has has 784 places, 740 transitions, 4618 flow [2022-01-19 00:45:55,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:55,220 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:55,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:55,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:45:55,221 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 00:45:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1171872320, now seen corresponding path program 9 times [2022-01-19 00:45:55,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:55,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204035309] [2022-01-19 00:45:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:55,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:55,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:55,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204035309] [2022-01-19 00:45:55,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204035309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:55,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:55,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:55,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614179894] [2022-01-19 00:45:55,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:55,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:55,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:55,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:55,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:55,446 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:55,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 784 places, 740 transitions, 4618 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:55,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:55,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:55,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:57,942 INFO L129 PetriNetUnfolder]: 2061/7880 cut-off events. [2022-01-19 00:45:57,943 INFO L130 PetriNetUnfolder]: For 42093/42286 co-relation queries the response was YES. [2022-01-19 00:45:58,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24787 conditions, 7880 events. 2061/7880 cut-off events. For 42093/42286 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 93086 event pairs, 1088 based on Foata normal form. 73/7187 useless extension candidates. Maximal degree in co-relation 24657. Up to 1900 conditions per place. [2022-01-19 00:45:58,078 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 244 selfloop transitions, 98 changer transitions 19/808 dead transitions. [2022-01-19 00:45:58,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 808 transitions, 6183 flow [2022-01-19 00:45:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:45:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:45:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9310 transitions. [2022-01-19 00:45:58,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7723577235772358 [2022-01-19 00:45:58,085 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 9310 transitions. [2022-01-19 00:45:58,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 9310 transitions. [2022-01-19 00:45:58,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:58,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 9310 transitions. [2022-01-19 00:45:58,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 443.3333333333333) internal successors, (9310), 21 states have internal predecessors, (9310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:58,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 574.0) internal successors, (12628), 22 states have internal predecessors, (12628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:58,102 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 574.0) internal successors, (12628), 22 states have internal predecessors, (12628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:58,103 INFO L186 Difference]: Start difference. First operand has 784 places, 740 transitions, 4618 flow. Second operand 21 states and 9310 transitions. [2022-01-19 00:45:58,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 808 transitions, 6183 flow [2022-01-19 00:45:58,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 799 places, 808 transitions, 6070 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-01-19 00:45:58,534 INFO L242 Difference]: Finished difference. Result has 813 places, 764 transitions, 5335 flow [2022-01-19 00:45:58,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=4537, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5335, PETRI_PLACES=813, PETRI_TRANSITIONS=764} [2022-01-19 00:45:58,535 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 290 predicate places. [2022-01-19 00:45:58,535 INFO L470 AbstractCegarLoop]: Abstraction has has 813 places, 764 transitions, 5335 flow [2022-01-19 00:45:58,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:58,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:58,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:58,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:45:58,536 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 00:45:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1679193566, now seen corresponding path program 10 times [2022-01-19 00:45:58,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:58,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481505560] [2022-01-19 00:45:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:58,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:45:58,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481505560] [2022-01-19 00:45:58,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481505560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:58,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:58,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:45:58,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401991821] [2022-01-19 00:45:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:58,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:45:58,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:45:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:45:58,691 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:45:58,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 813 places, 764 transitions, 5335 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:58,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:58,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:45:58,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:01,225 INFO L129 PetriNetUnfolder]: 2096/7914 cut-off events. [2022-01-19 00:46:01,225 INFO L130 PetriNetUnfolder]: For 46489/46730 co-relation queries the response was YES. [2022-01-19 00:46:01,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26216 conditions, 7914 events. 2096/7914 cut-off events. For 46489/46730 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 93501 event pairs, 965 based on Foata normal form. 85/7203 useless extension candidates. Maximal degree in co-relation 26074. Up to 2096 conditions per place. [2022-01-19 00:46:01,498 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 226 selfloop transitions, 120 changer transitions 16/809 dead transitions. [2022-01-19 00:46:01,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 809 transitions, 6575 flow [2022-01-19 00:46:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:46:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:46:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7990 transitions. [2022-01-19 00:46:01,502 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7733255903987611 [2022-01-19 00:46:01,502 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7990 transitions. [2022-01-19 00:46:01,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7990 transitions. [2022-01-19 00:46:01,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:01,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7990 transitions. [2022-01-19 00:46:01,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 443.8888888888889) internal successors, (7990), 18 states have internal predecessors, (7990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:01,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:01,513 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:01,513 INFO L186 Difference]: Start difference. First operand has 813 places, 764 transitions, 5335 flow. Second operand 18 states and 7990 transitions. [2022-01-19 00:46:01,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 809 transitions, 6575 flow [2022-01-19 00:46:01,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 809 transitions, 6341 flow, removed 117 selfloop flow, removed 2 redundant places. [2022-01-19 00:46:01,774 INFO L242 Difference]: Finished difference. Result has 834 places, 778 transitions, 5715 flow [2022-01-19 00:46:01,774 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=5147, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5715, PETRI_PLACES=834, PETRI_TRANSITIONS=778} [2022-01-19 00:46:01,775 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 311 predicate places. [2022-01-19 00:46:01,775 INFO L470 AbstractCegarLoop]: Abstraction has has 834 places, 778 transitions, 5715 flow [2022-01-19 00:46:01,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:01,775 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:01,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:01,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:46:01,776 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 00:46:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2042922910, now seen corresponding path program 11 times [2022-01-19 00:46:01,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386596476] [2022-01-19 00:46:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:01,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:01,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:01,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386596476] [2022-01-19 00:46:01,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386596476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:01,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:01,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:01,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751715109] [2022-01-19 00:46:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:01,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:01,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:01,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:01,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 778 transitions, 5715 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:01,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:01,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:01,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:04,610 INFO L129 PetriNetUnfolder]: 2141/8370 cut-off events. [2022-01-19 00:46:04,610 INFO L130 PetriNetUnfolder]: For 51509/51698 co-relation queries the response was YES. [2022-01-19 00:46:04,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27411 conditions, 8370 events. 2141/8370 cut-off events. For 51509/51698 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 100848 event pairs, 1103 based on Foata normal form. 49/7613 useless extension candidates. Maximal degree in co-relation 27262. Up to 2143 conditions per place. [2022-01-19 00:46:04,734 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 256 selfloop transitions, 113 changer transitions 11/827 dead transitions. [2022-01-19 00:46:04,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 848 places, 827 transitions, 7103 flow [2022-01-19 00:46:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:46:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:46:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7554 transitions. [2022-01-19 00:46:04,738 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.774134043861447 [2022-01-19 00:46:04,738 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 7554 transitions. [2022-01-19 00:46:04,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 7554 transitions. [2022-01-19 00:46:04,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:04,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 7554 transitions. [2022-01-19 00:46:04,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 444.3529411764706) internal successors, (7554), 17 states have internal predecessors, (7554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:04,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:04,748 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:04,748 INFO L186 Difference]: Start difference. First operand has 834 places, 778 transitions, 5715 flow. Second operand 17 states and 7554 transitions. [2022-01-19 00:46:04,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 848 places, 827 transitions, 7103 flow [2022-01-19 00:46:04,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 827 transitions, 6936 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-01-19 00:46:05,008 INFO L242 Difference]: Finished difference. Result has 852 places, 796 transitions, 6254 flow [2022-01-19 00:46:05,008 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=5560, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6254, PETRI_PLACES=852, PETRI_TRANSITIONS=796} [2022-01-19 00:46:05,009 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 329 predicate places. [2022-01-19 00:46:05,009 INFO L470 AbstractCegarLoop]: Abstraction has has 852 places, 796 transitions, 6254 flow [2022-01-19 00:46:05,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:05,009 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:05,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:05,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:46:05,010 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 00:46:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1465489134, now seen corresponding path program 12 times [2022-01-19 00:46:05,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:05,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541172191] [2022-01-19 00:46:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:05,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:05,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541172191] [2022-01-19 00:46:05,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541172191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:05,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:05,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:05,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062172906] [2022-01-19 00:46:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:05,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:05,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:05,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:05,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 852 places, 796 transitions, 6254 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:05,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:05,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:05,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:07,858 INFO L129 PetriNetUnfolder]: 2140/8430 cut-off events. [2022-01-19 00:46:07,859 INFO L130 PetriNetUnfolder]: For 53297/53522 co-relation queries the response was YES. [2022-01-19 00:46:07,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27818 conditions, 8430 events. 2140/8430 cut-off events. For 53297/53522 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 101443 event pairs, 1118 based on Foata normal form. 61/7674 useless extension candidates. Maximal degree in co-relation 27663. Up to 2125 conditions per place. [2022-01-19 00:46:08,003 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 254 selfloop transitions, 116 changer transitions 20/837 dead transitions. [2022-01-19 00:46:08,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 837 transitions, 7444 flow [2022-01-19 00:46:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:46:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:46:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7994 transitions. [2022-01-19 00:46:08,008 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7737127371273713 [2022-01-19 00:46:08,008 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7994 transitions. [2022-01-19 00:46:08,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7994 transitions. [2022-01-19 00:46:08,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:08,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7994 transitions. [2022-01-19 00:46:08,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 444.1111111111111) internal successors, (7994), 18 states have internal predecessors, (7994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:08,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:08,019 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:08,019 INFO L186 Difference]: Start difference. First operand has 852 places, 796 transitions, 6254 flow. Second operand 18 states and 7994 transitions. [2022-01-19 00:46:08,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 837 transitions, 7444 flow [2022-01-19 00:46:08,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 864 places, 837 transitions, 7228 flow, removed 83 selfloop flow, removed 3 redundant places. [2022-01-19 00:46:08,344 INFO L242 Difference]: Finished difference. Result has 871 places, 805 transitions, 6544 flow [2022-01-19 00:46:08,345 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=6070, PETRI_DIFFERENCE_MINUEND_PLACES=847, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6544, PETRI_PLACES=871, PETRI_TRANSITIONS=805} [2022-01-19 00:46:08,345 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 348 predicate places. [2022-01-19 00:46:08,345 INFO L470 AbstractCegarLoop]: Abstraction has has 871 places, 805 transitions, 6544 flow [2022-01-19 00:46:08,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:08,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:08,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:08,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:46:08,346 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 00:46:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 645140916, now seen corresponding path program 13 times [2022-01-19 00:46:08,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139121593] [2022-01-19 00:46:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:08,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:08,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:08,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139121593] [2022-01-19 00:46:08,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139121593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:08,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:08,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:08,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149011431] [2022-01-19 00:46:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:08,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:08,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:08,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:08,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 805 transitions, 6544 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:08,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:08,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:08,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:11,318 INFO L129 PetriNetUnfolder]: 2317/8535 cut-off events. [2022-01-19 00:46:11,318 INFO L130 PetriNetUnfolder]: For 60359/60639 co-relation queries the response was YES. [2022-01-19 00:46:11,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29973 conditions, 8535 events. 2317/8535 cut-off events. For 60359/60639 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 102063 event pairs, 916 based on Foata normal form. 42/7737 useless extension candidates. Maximal degree in co-relation 29813. Up to 1965 conditions per place. [2022-01-19 00:46:11,462 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 279 selfloop transitions, 143 changer transitions 19/888 dead transitions. [2022-01-19 00:46:11,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 890 places, 888 transitions, 8398 flow [2022-01-19 00:46:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:46:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:46:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 9745 transitions. [2022-01-19 00:46:11,466 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7716978143807413 [2022-01-19 00:46:11,466 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 9745 transitions. [2022-01-19 00:46:11,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 9745 transitions. [2022-01-19 00:46:11,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:11,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 9745 transitions. [2022-01-19 00:46:11,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 442.95454545454544) internal successors, (9745), 22 states have internal predecessors, (9745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:11,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 574.0) internal successors, (13202), 23 states have internal predecessors, (13202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:11,477 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 574.0) internal successors, (13202), 23 states have internal predecessors, (13202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:11,477 INFO L186 Difference]: Start difference. First operand has 871 places, 805 transitions, 6544 flow. Second operand 22 states and 9745 transitions. [2022-01-19 00:46:11,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 890 places, 888 transitions, 8398 flow [2022-01-19 00:46:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 888 transitions, 8226 flow, removed 55 selfloop flow, removed 3 redundant places. [2022-01-19 00:46:11,775 INFO L242 Difference]: Finished difference. Result has 901 places, 837 transitions, 7418 flow [2022-01-19 00:46:11,776 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=6387, PETRI_DIFFERENCE_MINUEND_PLACES=866, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7418, PETRI_PLACES=901, PETRI_TRANSITIONS=837} [2022-01-19 00:46:11,776 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 378 predicate places. [2022-01-19 00:46:11,777 INFO L470 AbstractCegarLoop]: Abstraction has has 901 places, 837 transitions, 7418 flow [2022-01-19 00:46:11,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:11,777 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:11,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:11,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:46:11,777 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 00:46:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash -934032168, now seen corresponding path program 14 times [2022-01-19 00:46:11,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:11,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727970640] [2022-01-19 00:46:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:11,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:11,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727970640] [2022-01-19 00:46:11,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727970640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:11,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:11,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:11,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478968733] [2022-01-19 00:46:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:11,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:11,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:11,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:11,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 837 transitions, 7418 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:11,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:11,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:11,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:15,005 INFO L129 PetriNetUnfolder]: 2379/9266 cut-off events. [2022-01-19 00:46:15,005 INFO L130 PetriNetUnfolder]: For 71852/72166 co-relation queries the response was YES. [2022-01-19 00:46:15,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32780 conditions, 9266 events. 2379/9266 cut-off events. For 71852/72166 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 114542 event pairs, 1179 based on Foata normal form. 30/8414 useless extension candidates. Maximal degree in co-relation 32607. Up to 1993 conditions per place. [2022-01-19 00:46:15,179 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 332 selfloop transitions, 105 changer transitions 17/901 dead transitions. [2022-01-19 00:46:15,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 901 transitions, 9192 flow [2022-01-19 00:46:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:46:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:46:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9307 transitions. [2022-01-19 00:46:15,183 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7721088435374149 [2022-01-19 00:46:15,183 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 9307 transitions. [2022-01-19 00:46:15,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 9307 transitions. [2022-01-19 00:46:15,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:15,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 9307 transitions. [2022-01-19 00:46:15,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 443.1904761904762) internal successors, (9307), 21 states have internal predecessors, (9307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:15,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 574.0) internal successors, (12628), 22 states have internal predecessors, (12628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:15,195 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 574.0) internal successors, (12628), 22 states have internal predecessors, (12628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:15,195 INFO L186 Difference]: Start difference. First operand has 901 places, 837 transitions, 7418 flow. Second operand 21 states and 9307 transitions. [2022-01-19 00:46:15,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 901 transitions, 9192 flow [2022-01-19 00:46:15,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 901 transitions, 9018 flow, removed 87 selfloop flow, removed 2 redundant places. [2022-01-19 00:46:15,618 INFO L242 Difference]: Finished difference. Result has 931 places, 861 transitions, 8102 flow [2022-01-19 00:46:15,619 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=7258, PETRI_DIFFERENCE_MINUEND_PLACES=897, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8102, PETRI_PLACES=931, PETRI_TRANSITIONS=861} [2022-01-19 00:46:15,619 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 408 predicate places. [2022-01-19 00:46:15,620 INFO L470 AbstractCegarLoop]: Abstraction has has 931 places, 861 transitions, 8102 flow [2022-01-19 00:46:15,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:15,620 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:15,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:15,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:46:15,620 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 00:46:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1908154192, now seen corresponding path program 15 times [2022-01-19 00:46:15,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:15,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769722708] [2022-01-19 00:46:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:15,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:15,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769722708] [2022-01-19 00:46:15,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769722708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:15,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:15,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:15,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785490373] [2022-01-19 00:46:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:15,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:15,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:15,882 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:15,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 861 transitions, 8102 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:15,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:15,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:15,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:19,248 INFO L129 PetriNetUnfolder]: 2424/9395 cut-off events. [2022-01-19 00:46:19,248 INFO L130 PetriNetUnfolder]: For 78917/79272 co-relation queries the response was YES. [2022-01-19 00:46:19,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34257 conditions, 9395 events. 2424/9395 cut-off events. For 78917/79272 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 116679 event pairs, 977 based on Foata normal form. 54/8561 useless extension candidates. Maximal degree in co-relation 34071. Up to 2082 conditions per place. [2022-01-19 00:46:19,413 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 300 selfloop transitions, 161 changer transitions 14/922 dead transitions. [2022-01-19 00:46:19,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 922 transitions, 9771 flow [2022-01-19 00:46:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:46:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:46:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7991 transitions. [2022-01-19 00:46:19,417 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7734223770809137 [2022-01-19 00:46:19,417 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7991 transitions. [2022-01-19 00:46:19,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7991 transitions. [2022-01-19 00:46:19,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:19,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7991 transitions. [2022-01-19 00:46:19,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 443.94444444444446) internal successors, (7991), 18 states have internal predecessors, (7991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:19,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:19,427 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:19,427 INFO L186 Difference]: Start difference. First operand has 931 places, 861 transitions, 8102 flow. Second operand 18 states and 7991 transitions. [2022-01-19 00:46:19,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 922 transitions, 9771 flow [2022-01-19 00:46:19,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 922 transitions, 9591 flow, removed 90 selfloop flow, removed 2 redundant places. [2022-01-19 00:46:19,875 INFO L242 Difference]: Finished difference. Result has 952 places, 882 transitions, 8764 flow [2022-01-19 00:46:19,875 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=7924, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8764, PETRI_PLACES=952, PETRI_TRANSITIONS=882} [2022-01-19 00:46:19,876 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 429 predicate places. [2022-01-19 00:46:19,876 INFO L470 AbstractCegarLoop]: Abstraction has has 952 places, 882 transitions, 8764 flow [2022-01-19 00:46:19,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:19,876 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:19,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:19,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:46:19,877 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 00:46:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1957891458, now seen corresponding path program 16 times [2022-01-19 00:46:19,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:19,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933407278] [2022-01-19 00:46:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:19,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:20,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:20,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933407278] [2022-01-19 00:46:20,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933407278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:20,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:20,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:20,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596295308] [2022-01-19 00:46:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:20,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:20,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:20,003 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:20,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 882 transitions, 8764 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:20,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:20,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:20,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:23,426 INFO L129 PetriNetUnfolder]: 2514/9478 cut-off events. [2022-01-19 00:46:23,427 INFO L130 PetriNetUnfolder]: For 83949/84330 co-relation queries the response was YES. [2022-01-19 00:46:23,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36392 conditions, 9478 events. 2514/9478 cut-off events. For 83949/84330 co-relation queries the response was YES. Maximal size of possible extension queue 1154. Compared 118297 event pairs, 963 based on Foata normal form. 66/8613 useless extension candidates. Maximal degree in co-relation 36199. Up to 2135 conditions per place. [2022-01-19 00:46:23,611 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 342 selfloop transitions, 134 changer transitions 12/935 dead transitions. [2022-01-19 00:46:23,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 966 places, 935 transitions, 10473 flow [2022-01-19 00:46:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:46:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:46:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7553 transitions. [2022-01-19 00:46:23,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7740315638450502 [2022-01-19 00:46:23,615 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 7553 transitions. [2022-01-19 00:46:23,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 7553 transitions. [2022-01-19 00:46:23,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:23,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 7553 transitions. [2022-01-19 00:46:23,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 444.29411764705884) internal successors, (7553), 17 states have internal predecessors, (7553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:23,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:23,624 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:23,624 INFO L186 Difference]: Start difference. First operand has 952 places, 882 transitions, 8764 flow. Second operand 17 states and 7553 transitions. [2022-01-19 00:46:23,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 966 places, 935 transitions, 10473 flow [2022-01-19 00:46:24,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 935 transitions, 10255 flow, removed 109 selfloop flow, removed 2 redundant places. [2022-01-19 00:46:24,136 INFO L242 Difference]: Finished difference. Result has 973 places, 903 transitions, 9396 flow [2022-01-19 00:46:24,137 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=8590, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9396, PETRI_PLACES=973, PETRI_TRANSITIONS=903} [2022-01-19 00:46:24,137 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 450 predicate places. [2022-01-19 00:46:24,137 INFO L470 AbstractCegarLoop]: Abstraction has has 973 places, 903 transitions, 9396 flow [2022-01-19 00:46:24,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:24,138 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:24,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:24,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 00:46:24,139 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 00:46:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1127944514, now seen corresponding path program 17 times [2022-01-19 00:46:24,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:24,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023071409] [2022-01-19 00:46:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:24,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:24,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:24,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023071409] [2022-01-19 00:46:24,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023071409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:24,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:24,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:24,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474095027] [2022-01-19 00:46:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:24,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:24,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:24,424 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:24,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 903 transitions, 9396 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:24,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:24,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:24,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:28,210 INFO L129 PetriNetUnfolder]: 2562/10117 cut-off events. [2022-01-19 00:46:28,211 INFO L130 PetriNetUnfolder]: For 92011/92455 co-relation queries the response was YES. [2022-01-19 00:46:28,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38376 conditions, 10117 events. 2562/10117 cut-off events. For 92011/92455 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 129242 event pairs, 1187 based on Foata normal form. 58/9221 useless extension candidates. Maximal degree in co-relation 38175. Up to 2180 conditions per place. [2022-01-19 00:46:28,403 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 367 selfloop transitions, 126 changer transitions 13/953 dead transitions. [2022-01-19 00:46:28,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 953 transitions, 11114 flow [2022-01-19 00:46:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:46:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:46:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7993 transitions. [2022-01-19 00:46:28,406 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7736159504452187 [2022-01-19 00:46:28,407 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7993 transitions. [2022-01-19 00:46:28,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7993 transitions. [2022-01-19 00:46:28,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:28,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7993 transitions. [2022-01-19 00:46:28,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 444.05555555555554) internal successors, (7993), 18 states have internal predecessors, (7993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:28,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:28,416 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:28,416 INFO L186 Difference]: Start difference. First operand has 973 places, 903 transitions, 9396 flow. Second operand 18 states and 7993 transitions. [2022-01-19 00:46:28,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 953 transitions, 11114 flow [2022-01-19 00:46:29,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 953 transitions, 10980 flow, removed 67 selfloop flow, removed 2 redundant places. [2022-01-19 00:46:29,076 INFO L242 Difference]: Finished difference. Result has 994 places, 922 transitions, 10057 flow [2022-01-19 00:46:29,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=9266, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10057, PETRI_PLACES=994, PETRI_TRANSITIONS=922} [2022-01-19 00:46:29,078 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 471 predicate places. [2022-01-19 00:46:29,078 INFO L470 AbstractCegarLoop]: Abstraction has has 994 places, 922 transitions, 10057 flow [2022-01-19 00:46:29,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:29,078 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:29,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:29,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 00:46:29,079 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 00:46:29,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash -822001968, now seen corresponding path program 18 times [2022-01-19 00:46:29,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:29,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203660518] [2022-01-19 00:46:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:29,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:29,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:29,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203660518] [2022-01-19 00:46:29,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203660518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:29,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:29,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:29,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132996001] [2022-01-19 00:46:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:29,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:29,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:29,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:29,210 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:29,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 922 transitions, 10057 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:29,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:29,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:29,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:32,959 INFO L129 PetriNetUnfolder]: 2576/9895 cut-off events. [2022-01-19 00:46:32,959 INFO L130 PetriNetUnfolder]: For 94626/95080 co-relation queries the response was YES. [2022-01-19 00:46:33,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39083 conditions, 9895 events. 2576/9895 cut-off events. For 94626/95080 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 125328 event pairs, 967 based on Foata normal form. 102/9056 useless extension candidates. Maximal degree in co-relation 38875. Up to 2214 conditions per place. [2022-01-19 00:46:33,308 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 324 selfloop transitions, 178 changer transitions 18/967 dead transitions. [2022-01-19 00:46:33,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 967 transitions, 11491 flow [2022-01-19 00:46:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:46:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:46:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 7117 transitions. [2022-01-19 00:46:33,311 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.774934668989547 [2022-01-19 00:46:33,311 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 7117 transitions. [2022-01-19 00:46:33,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 7117 transitions. [2022-01-19 00:46:33,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:33,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 7117 transitions. [2022-01-19 00:46:33,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 444.8125) internal successors, (7117), 16 states have internal predecessors, (7117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:33,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 574.0) internal successors, (9758), 17 states have internal predecessors, (9758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:33,320 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 574.0) internal successors, (9758), 17 states have internal predecessors, (9758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:33,320 INFO L186 Difference]: Start difference. First operand has 994 places, 922 transitions, 10057 flow. Second operand 16 states and 7117 transitions. [2022-01-19 00:46:33,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 967 transitions, 11491 flow [2022-01-19 00:46:33,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 967 transitions, 11319 flow, removed 86 selfloop flow, removed 2 redundant places. [2022-01-19 00:46:33,911 INFO L242 Difference]: Finished difference. Result has 1012 places, 930 transitions, 10461 flow [2022-01-19 00:46:33,912 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=9887, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10461, PETRI_PLACES=1012, PETRI_TRANSITIONS=930} [2022-01-19 00:46:33,912 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 489 predicate places. [2022-01-19 00:46:33,912 INFO L470 AbstractCegarLoop]: Abstraction has has 1012 places, 930 transitions, 10461 flow [2022-01-19 00:46:33,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:33,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:33,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:33,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 00:46:33,913 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 00:46:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1258669740, now seen corresponding path program 19 times [2022-01-19 00:46:33,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:33,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063347565] [2022-01-19 00:46:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:33,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:34,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063347565] [2022-01-19 00:46:34,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063347565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:34,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:34,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:34,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540913818] [2022-01-19 00:46:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:34,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:34,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:34,047 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:34,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 930 transitions, 10461 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:34,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:34,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:34,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:37,840 INFO L129 PetriNetUnfolder]: 2620/10445 cut-off events. [2022-01-19 00:46:37,841 INFO L130 PetriNetUnfolder]: For 104991/105441 co-relation queries the response was YES. [2022-01-19 00:46:38,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41199 conditions, 10445 events. 2620/10445 cut-off events. For 104991/105441 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 134317 event pairs, 1199 based on Foata normal form. 78/9542 useless extension candidates. Maximal degree in co-relation 40985. Up to 2241 conditions per place. [2022-01-19 00:46:38,064 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 374 selfloop transitions, 134 changer transitions 18/973 dead transitions. [2022-01-19 00:46:38,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 973 transitions, 12042 flow [2022-01-19 00:46:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:46:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:46:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 7557 transitions. [2022-01-19 00:46:38,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7744414839106374 [2022-01-19 00:46:38,069 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 7557 transitions. [2022-01-19 00:46:38,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 7557 transitions. [2022-01-19 00:46:38,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:38,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 7557 transitions. [2022-01-19 00:46:38,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 444.52941176470586) internal successors, (7557), 17 states have internal predecessors, (7557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,078 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 574.0) internal successors, (10332), 18 states have internal predecessors, (10332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,078 INFO L186 Difference]: Start difference. First operand has 1012 places, 930 transitions, 10461 flow. Second operand 17 states and 7557 transitions. [2022-01-19 00:46:38,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 973 transitions, 12042 flow [2022-01-19 00:46:38,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 973 transitions, 11738 flow, removed 37 selfloop flow, removed 5 redundant places. [2022-01-19 00:46:38,955 INFO L242 Difference]: Finished difference. Result has 1028 places, 943 transitions, 10824 flow [2022-01-19 00:46:38,956 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=10177, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10824, PETRI_PLACES=1028, PETRI_TRANSITIONS=943} [2022-01-19 00:46:38,956 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 505 predicate places. [2022-01-19 00:46:38,956 INFO L470 AbstractCegarLoop]: Abstraction has has 1028 places, 943 transitions, 10824 flow [2022-01-19 00:46:38,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,956 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:38,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:38,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 00:46:38,957 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 00:46:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1754700866, now seen corresponding path program 20 times [2022-01-19 00:46:38,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:38,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258643031] [2022-01-19 00:46:38,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:38,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:39,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:39,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258643031] [2022-01-19 00:46:39,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258643031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:39,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:39,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:46:39,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046294362] [2022-01-19 00:46:39,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:39,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:46:39,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:39,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:46:39,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:46:39,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 574 [2022-01-19 00:46:39,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 943 transitions, 10824 flow. Second operand has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:39,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:39,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 574 [2022-01-19 00:46:39,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:43,006 INFO L129 PetriNetUnfolder]: 2617/10208 cut-off events. [2022-01-19 00:46:43,006 INFO L130 PetriNetUnfolder]: For 99599/100049 co-relation queries the response was YES. [2022-01-19 00:46:43,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41019 conditions, 10208 events. 2617/10208 cut-off events. For 99599/100049 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 130289 event pairs, 976 based on Foata normal form. 82/9327 useless extension candidates. Maximal degree in co-relation 40800. Up to 2237 conditions per place. [2022-01-19 00:46:43,219 INFO L132 encePairwiseOnDemand]: 561/574 looper letters, 362 selfloop transitions, 152 changer transitions 21/982 dead transitions. [2022-01-19 00:46:43,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 982 transitions, 12282 flow [2022-01-19 00:46:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:46:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:46:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 7993 transitions. [2022-01-19 00:46:43,222 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7736159504452187 [2022-01-19 00:46:43,222 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 7993 transitions. [2022-01-19 00:46:43,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 7993 transitions. [2022-01-19 00:46:43,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:43,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 7993 transitions. [2022-01-19 00:46:43,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 444.05555555555554) internal successors, (7993), 18 states have internal predecessors, (7993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:43,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:43,232 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 574.0) internal successors, (10906), 19 states have internal predecessors, (10906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:43,232 INFO L186 Difference]: Start difference. First operand has 1028 places, 943 transitions, 10824 flow. Second operand 18 states and 7993 transitions. [2022-01-19 00:46:43,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 982 transitions, 12282 flow [2022-01-19 00:46:43,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 982 transitions, 12116 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-01-19 00:46:43,873 INFO L242 Difference]: Finished difference. Result has 1047 places, 952 transitions, 11243 flow [2022-01-19 00:46:43,873 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=10662, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11243, PETRI_PLACES=1047, PETRI_TRANSITIONS=952} [2022-01-19 00:46:43,874 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 524 predicate places. [2022-01-19 00:46:43,874 INFO L470 AbstractCegarLoop]: Abstraction has has 1047 places, 952 transitions, 11243 flow [2022-01-19 00:46:43,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 443.8) internal successors, (4438), 10 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:43,874 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:43,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:43,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 00:46:43,875 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 00:46:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash -143008330, now seen corresponding path program 1 times [2022-01-19 00:46:43,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:43,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592280466] [2022-01-19 00:46:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:43,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:46:44,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:44,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592280466] [2022-01-19 00:46:44,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592280466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:44,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:44,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-19 00:46:44,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743995979] [2022-01-19 00:46:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:44,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-19 00:46:44,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-19 00:46:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-01-19 00:46:44,513 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 574 [2022-01-19 00:46:44,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 952 transitions, 11243 flow. Second operand has 31 states, 31 states have (on average 334.83870967741933) internal successors, (10380), 31 states have internal predecessors, (10380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:44,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:44,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 574 [2022-01-19 00:46:44,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:47:37,905 INFO L129 PetriNetUnfolder]: 30665/158105 cut-off events. [2022-01-19 00:47:37,906 INFO L130 PetriNetUnfolder]: For 1171248/1177072 co-relation queries the response was YES. [2022-01-19 00:47:47,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 549205 conditions, 158105 events. 30665/158105 cut-off events. For 1171248/1177072 co-relation queries the response was YES. Maximal size of possible extension queue 5828. Compared 2867849 event pairs, 933 based on Foata normal form. 128/152747 useless extension candidates. Maximal degree in co-relation 548981. Up to 13488 conditions per place. [2022-01-19 00:47:48,183 INFO L132 encePairwiseOnDemand]: 529/574 looper letters, 764 selfloop transitions, 72 changer transitions 20/1607 dead transitions. [2022-01-19 00:47:48,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 1607 transitions, 14503 flow [2022-01-19 00:47:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 00:47:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 00:47:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 17958 transitions. [2022-01-19 00:47:48,191 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6016483516483516 [2022-01-19 00:47:48,191 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 17958 transitions. [2022-01-19 00:47:48,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 17958 transitions. [2022-01-19 00:47:48,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:47:48,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 17958 transitions. [2022-01-19 00:47:48,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 345.34615384615387) internal successors, (17958), 52 states have internal predecessors, (17958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:48,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 574.0) internal successors, (30422), 53 states have internal predecessors, (30422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:48,220 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 574.0) internal successors, (30422), 53 states have internal predecessors, (30422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:48,220 INFO L186 Difference]: Start difference. First operand has 1047 places, 952 transitions, 11243 flow. Second operand 52 states and 17958 transitions. [2022-01-19 00:47:48,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 1607 transitions, 14503 flow [2022-01-19 00:48:23,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1092 places, 1607 transitions, 14300 flow, removed 64 selfloop flow, removed 4 redundant places. [2022-01-19 00:48:23,520 INFO L242 Difference]: Finished difference. Result has 1113 places, 987 transitions, 11344 flow [2022-01-19 00:48:23,521 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=11056, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=11344, PETRI_PLACES=1113, PETRI_TRANSITIONS=987} [2022-01-19 00:48:23,521 INFO L334 CegarLoopForPetriNet]: 523 programPoint places, 590 predicate places. [2022-01-19 00:48:23,521 INFO L470 AbstractCegarLoop]: Abstraction has has 1113 places, 987 transitions, 11344 flow [2022-01-19 00:48:23,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 334.83870967741933) internal successors, (10380), 31 states have internal predecessors, (10380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:23,523 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:23,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:48:23,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 00:48:23,523 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 00:48:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash 210979274, now seen corresponding path program 2 times [2022-01-19 00:48:23,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:23,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342293147] [2022-01-19 00:48:23,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:23,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-19 00:48:23,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:23,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342293147] [2022-01-19 00:48:23,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342293147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:23,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:23,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-19 00:48:23,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688793122] [2022-01-19 00:48:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:23,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 00:48:23,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 00:48:23,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2022-01-19 00:48:23,875 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 574 [2022-01-19 00:48:23,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1113 places, 987 transitions, 11344 flow. Second operand has 25 states, 25 states have (on average 420.52) internal successors, (10513), 25 states have internal predecessors, (10513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:23,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:23,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 574 [2022-01-19 00:48:23,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand