/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:05:03,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:05:03,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:05:03,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:05:03,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:05:03,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:05:03,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:05:03,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:05:03,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:05:03,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:05:03,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:05:03,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:05:03,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:05:03,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:05:03,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:05:03,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:05:03,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:05:03,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:05:03,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:05:03,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:05:03,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:05:03,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:05:03,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:05:03,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:05:03,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:05:03,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:05:03,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:05:03,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:05:03,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:05:03,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:05:03,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:05:03,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:05:03,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:05:03,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:05:03,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:05:03,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:05:03,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:05:03,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:05:03,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:05:03,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:05:03,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:05:03,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 13:05:03,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:05:03,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:05:03,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:05:03,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:05:03,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:05:03,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:05:03,874 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:05:03,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:05:03,875 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:05:03,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:05:03,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:05:03,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:05:03,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:05:03,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:05:03,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:05:03,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:05:03,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:05:03,880 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:05:03,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:05:03,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:05:03,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:05:03,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:05:03,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:05:03,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:05:03,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:05:03,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:05:03,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:05:03,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:05:03,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:05:03,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:05:03,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:05:03,883 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:05:03,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 13:05:04,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:05:04,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:05:04,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:05:04,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:05:04,115 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:05:04,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-01-19 13:05:04,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5356ea28b/ba0eed79aab740ca92551f52d1861ca1/FLAG718a38c52 [2022-01-19 13:05:04,536 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:05:04,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-01-19 13:05:04,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5356ea28b/ba0eed79aab740ca92551f52d1861ca1/FLAG718a38c52 [2022-01-19 13:05:04,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5356ea28b/ba0eed79aab740ca92551f52d1861ca1 [2022-01-19 13:05:04,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:05:04,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:05:04,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:05:04,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:05:04,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:05:04,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:05:04" (1/1) ... [2022-01-19 13:05:04,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af1b5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:04, skipping insertion in model container [2022-01-19 13:05:04,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:05:04" (1/1) ... [2022-01-19 13:05:04,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:05:04,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:05:05,135 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-file-item-trans.wvr.c[2817,2830] [2022-01-19 13:05:05,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:05:05,145 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:05:05,163 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-file-item-trans.wvr.c[2817,2830] [2022-01-19 13:05:05,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:05:05,175 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:05:05,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05 WrapperNode [2022-01-19 13:05:05,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:05:05,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:05:05,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:05:05,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:05:05,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,212 INFO L137 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 217 [2022-01-19 13:05:05,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:05:05,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:05:05,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:05:05,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:05:05,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:05:05,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:05:05,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:05:05,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:05:05,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (1/1) ... [2022-01-19 13:05:05,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:05:05,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:05:05,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 13:05:05,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 13:05:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:05:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:05:05,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:05:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:05:05,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:05:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:05:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:05:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:05:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:05:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:05:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:05:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:05:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:05:05,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:05:05,321 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 13:05:05,418 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:05:05,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:05:05,769 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:05:05,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:05:05,780 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 13:05:05,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:05:05 BoogieIcfgContainer [2022-01-19 13:05:05,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:05:05,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:05:05,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:05:05,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:05:05,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:05:04" (1/3) ... [2022-01-19 13:05:05,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6ab834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:05:05, skipping insertion in model container [2022-01-19 13:05:05,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:05:05" (2/3) ... [2022-01-19 13:05:05,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6ab834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:05:05, skipping insertion in model container [2022-01-19 13:05:05,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:05:05" (3/3) ... [2022-01-19 13:05:05,789 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-01-19 13:05:05,794 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:05:05,794 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:05:05,794 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:05:05,850 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,855 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,856 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,857 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,858 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,859 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,860 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,861 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,865 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,866 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,867 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,887 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,891 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,892 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,892 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,893 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,894 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,895 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,895 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,895 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,895 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,896 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,896 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,896 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,899 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,899 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,899 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,900 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,904 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,907 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,914 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,915 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,916 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,917 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,923 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,924 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,925 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,925 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,925 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,925 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,926 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,926 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,927 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,928 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,929 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,930 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,931 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,932 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,932 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,932 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,933 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,933 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,933 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,934 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,934 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,934 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,934 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,934 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,934 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,935 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,936 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,936 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,936 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,936 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,937 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,937 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,939 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,940 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,947 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,948 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,949 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,951 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,951 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,951 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,952 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,953 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,953 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,953 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,953 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,953 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:05:05,959 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 13:05:06,018 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:05:06,032 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 13:05:06,032 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 13:05:06,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 263 places, 278 transitions, 580 flow [2022-01-19 13:05:06,155 INFO L129 PetriNetUnfolder]: 25/275 cut-off events. [2022-01-19 13:05:06,155 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:05:06,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 275 events. 25/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 746 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 199. Up to 2 conditions per place. [2022-01-19 13:05:06,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 278 transitions, 580 flow [2022-01-19 13:05:06,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 264 transitions, 546 flow [2022-01-19 13:05:06,222 INFO L129 PetriNetUnfolder]: 25/263 cut-off events. [2022-01-19 13:05:06,223 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:05:06,223 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:06,223 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:06,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -802081389, now seen corresponding path program 1 times [2022-01-19 13:05:06,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385095009] [2022-01-19 13:05:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:06,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:06,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:06,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385095009] [2022-01-19 13:05:06,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385095009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:06,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:06,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:06,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065703373] [2022-01-19 13:05:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:06,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:06,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:06,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:06,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:06,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 13:05:06,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 264 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:06,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:06,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 13:05:06,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:06,727 INFO L129 PetriNetUnfolder]: 113/997 cut-off events. [2022-01-19 13:05:06,728 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-01-19 13:05:06,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 997 events. 113/997 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6897 event pairs, 26 based on Foata normal form. 55/939 useless extension candidates. Maximal degree in co-relation 963. Up to 74 conditions per place. [2022-01-19 13:05:06,749 INFO L132 encePairwiseOnDemand]: 261/278 looper letters, 18 selfloop transitions, 6 changer transitions 1/265 dead transitions. [2022-01-19 13:05:06,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 265 transitions, 608 flow [2022-01-19 13:05:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2022-01-19 13:05:06,767 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9592326139088729 [2022-01-19 13:05:06,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2022-01-19 13:05:06,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2022-01-19 13:05:06,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:06,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2022-01-19 13:05:06,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:06,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:06,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:06,792 INFO L186 Difference]: Start difference. First operand has 249 places, 264 transitions, 546 flow. Second operand 3 states and 800 transitions. [2022-01-19 13:05:06,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 265 transitions, 608 flow [2022-01-19 13:05:06,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 265 transitions, 588 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 13:05:06,806 INFO L242 Difference]: Finished difference. Result has 247 places, 260 transitions, 566 flow [2022-01-19 13:05:06,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=247, PETRI_TRANSITIONS=260} [2022-01-19 13:05:06,811 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, -2 predicate places. [2022-01-19 13:05:06,812 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 260 transitions, 566 flow [2022-01-19 13:05:06,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:06,812 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:06,813 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] [2022-01-19 13:05:06,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:05:06,813 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:06,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1464503203, now seen corresponding path program 1 times [2022-01-19 13:05:06,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:06,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222448507] [2022-01-19 13:05:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:06,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:06,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:06,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222448507] [2022-01-19 13:05:06,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222448507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:06,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:06,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:06,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826932795] [2022-01-19 13:05:06,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:06,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:06,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:06,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 13:05:06,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 260 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:06,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:06,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 13:05:06,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:07,317 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([843] thread3EXIT-->L80-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][257], [17#L80-2true, 268#(= 0 (+ ~isNull_6~0 (* (- 256) (div ~isNull_6~0 256)))), 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), Black: 266#true]) [2022-01-19 13:05:07,317 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is not cut-off event [2022-01-19 13:05:07,318 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is not cut-off event [2022-01-19 13:05:07,318 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is not cut-off event [2022-01-19 13:05:07,318 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is not cut-off event [2022-01-19 13:05:07,319 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([843] thread3EXIT-->L80-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][257], [17#L80-2true, 268#(= 0 (+ ~isNull_6~0 (* (- 256) (div ~isNull_6~0 256)))), 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), Black: 266#true]) [2022-01-19 13:05:07,319 INFO L384 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-01-19 13:05:07,319 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 13:05:07,319 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 13:05:07,319 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 13:05:07,320 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 13:05:07,329 INFO L129 PetriNetUnfolder]: 173/2319 cut-off events. [2022-01-19 13:05:07,329 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-01-19 13:05:07,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 2319 events. 173/2319 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 21879 event pairs, 25 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 1196. Up to 72 conditions per place. [2022-01-19 13:05:07,359 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 15 selfloop transitions, 4 changer transitions 0/267 dead transitions. [2022-01-19 13:05:07,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 623 flow [2022-01-19 13:05:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 13:05:07,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 13:05:07,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 13:05:07,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 13:05:07,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:07,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 13:05:07,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:07,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:07,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:07,367 INFO L186 Difference]: Start difference. First operand has 247 places, 260 transitions, 566 flow. Second operand 3 states and 795 transitions. [2022-01-19 13:05:07,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 267 transitions, 623 flow [2022-01-19 13:05:07,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 267 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:07,375 INFO L242 Difference]: Finished difference. Result has 248 places, 262 transitions, 582 flow [2022-01-19 13:05:07,376 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=248, PETRI_TRANSITIONS=262} [2022-01-19 13:05:07,377 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, -1 predicate places. [2022-01-19 13:05:07,377 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 262 transitions, 582 flow [2022-01-19 13:05:07,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:07,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:07,378 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:07,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:05:07,378 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 584730219, now seen corresponding path program 1 times [2022-01-19 13:05:07,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:07,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444413643] [2022-01-19 13:05:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:07,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:07,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:07,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444413643] [2022-01-19 13:05:07,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444413643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:07,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:07,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:05:07,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695203970] [2022-01-19 13:05:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:07,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:05:07,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:05:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:05:07,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 13:05:07,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 262 transitions, 582 flow. Second operand has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:07,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:07,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 13:05:07,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:07,824 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,825 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,825 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,825 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,825 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,828 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,829 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,829 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 13:05:07,829 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 13:05:07,832 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,833 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,833 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,833 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,839 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,839 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,840 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,840 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,840 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,841 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,841 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,841 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,843 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 13:05:07,843 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 13:05:07,844 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,844 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,844 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,844 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,844 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,844 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,844 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,845 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,845 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,845 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,845 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,845 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,853 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,853 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,853 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,853 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,853 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,853 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [278#true, 69#L56-30true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,854 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,854 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 13:05:07,857 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,857 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,857 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,857 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,857 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,857 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,860 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,860 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,860 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,860 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,860 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,860 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,860 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,873 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,873 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,874 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,874 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,874 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,881 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,881 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,882 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,882 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,882 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,882 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,882 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,882 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 13:05:07,882 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,883 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,883 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 13:05:07,885 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,885 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,885 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,885 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,885 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,885 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,887 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 13:05:07,887 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,887 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,887 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,888 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,888 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,888 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,913 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,914 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 13:05:07,914 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,914 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,915 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,915 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,915 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,915 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:07,915 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 13:05:07,915 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 13:05:08,133 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,133 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,133 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,133 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,133 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,138 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,138 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,139 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,139 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 13:05:08,139 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,139 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,139 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 13:05:08,140 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,140 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 13:05:08,140 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,140 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,140 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 13:05:08,140 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 13:05:08,142 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,142 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,142 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,142 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,142 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,142 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,142 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,148 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 13:05:08,148 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,148 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,148 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,148 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 13:05:08,155 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,155 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,155 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,156 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,156 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 13:05:08,159 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 13:05:08,159 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,159 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,159 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,159 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,159 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,159 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,165 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,165 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,165 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,165 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,165 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,171 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,171 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,171 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,171 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,171 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,171 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,171 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 13:05:08,172 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 13:05:08,172 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,172 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,173 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,173 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,173 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,173 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 13:05:08,173 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 13:05:08,175 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,175 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,175 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,175 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,175 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,175 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,175 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,182 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,182 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,182 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,182 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,182 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,187 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,187 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,187 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,187 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,187 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,187 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,187 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,188 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,188 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,188 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,188 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,188 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,188 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,188 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,189 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 13:05:08,189 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 13:05:08,192 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,192 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,192 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,192 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,192 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,192 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,192 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,201 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,201 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,201 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,201 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 13:05:08,202 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,202 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 13:05:08,255 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 13:05:08,255 INFO L384 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,256 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,256 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,256 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,257 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 13:05:08,257 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,257 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,257 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,257 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,257 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 13:05:08,260 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 13:05:08,260 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,260 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 13:05:08,261 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,261 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 13:05:08,332 INFO L129 PetriNetUnfolder]: 1007/4694 cut-off events. [2022-01-19 13:05:08,332 INFO L130 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-01-19 13:05:08,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 4694 events. 1007/4694 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 51165 event pairs, 316 based on Foata normal form. 4/4187 useless extension candidates. Maximal degree in co-relation 4096. Up to 1022 conditions per place. [2022-01-19 13:05:08,385 INFO L132 encePairwiseOnDemand]: 266/278 looper letters, 34 selfloop transitions, 15 changer transitions 4/293 dead transitions. [2022-01-19 13:05:08,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 293 transitions, 762 flow [2022-01-19 13:05:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:05:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:05:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2277 transitions. [2022-01-19 13:05:08,389 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9100719424460432 [2022-01-19 13:05:08,389 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2277 transitions. [2022-01-19 13:05:08,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2277 transitions. [2022-01-19 13:05:08,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:08,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2277 transitions. [2022-01-19 13:05:08,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,401 INFO L186 Difference]: Start difference. First operand has 248 places, 262 transitions, 582 flow. Second operand 9 states and 2277 transitions. [2022-01-19 13:05:08,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 293 transitions, 762 flow [2022-01-19 13:05:08,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 293 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:08,407 INFO L242 Difference]: Finished difference. Result has 261 places, 274 transitions, 678 flow [2022-01-19 13:05:08,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=678, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2022-01-19 13:05:08,410 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 12 predicate places. [2022-01-19 13:05:08,410 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 678 flow [2022-01-19 13:05:08,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,411 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:08,411 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] [2022-01-19 13:05:08,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:05:08,411 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 353464671, now seen corresponding path program 1 times [2022-01-19 13:05:08,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:08,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194179707] [2022-01-19 13:05:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:08,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:08,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194179707] [2022-01-19 13:05:08,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194179707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:08,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:08,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:08,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55911498] [2022-01-19 13:05:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:08,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:08,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:08,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:08,494 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 13:05:08,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 274 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:08,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 13:05:08,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:08,792 INFO L129 PetriNetUnfolder]: 327/2667 cut-off events. [2022-01-19 13:05:08,792 INFO L130 PetriNetUnfolder]: For 516/698 co-relation queries the response was YES. [2022-01-19 13:05:08,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 2667 events. 327/2667 cut-off events. For 516/698 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 26314 event pairs, 70 based on Foata normal form. 0/2404 useless extension candidates. Maximal degree in co-relation 3702. Up to 155 conditions per place. [2022-01-19 13:05:08,823 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 24 selfloop transitions, 4 changer transitions 0/282 dead transitions. [2022-01-19 13:05:08,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 282 transitions, 762 flow [2022-01-19 13:05:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-01-19 13:05:08,825 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2022-01-19 13:05:08,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2022-01-19 13:05:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2022-01-19 13:05:08,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:08,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2022-01-19 13:05:08,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,830 INFO L186 Difference]: Start difference. First operand has 261 places, 274 transitions, 678 flow. Second operand 3 states and 790 transitions. [2022-01-19 13:05:08,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 282 transitions, 762 flow [2022-01-19 13:05:08,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 282 transitions, 758 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:08,839 INFO L242 Difference]: Finished difference. Result has 261 places, 278 transitions, 722 flow [2022-01-19 13:05:08,840 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=261, PETRI_TRANSITIONS=278} [2022-01-19 13:05:08,841 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 12 predicate places. [2022-01-19 13:05:08,841 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 278 transitions, 722 flow [2022-01-19 13:05:08,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,842 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:08,842 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] [2022-01-19 13:05:08,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:05:08,842 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash 541551261, now seen corresponding path program 1 times [2022-01-19 13:05:08,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:08,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990565940] [2022-01-19 13:05:08,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:08,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:08,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:08,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990565940] [2022-01-19 13:05:08,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990565940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:08,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:08,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:05:08,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471614602] [2022-01-19 13:05:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:08,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:05:08,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:08,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:05:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:05:08,969 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 13:05:08,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 278 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:08,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:08,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 13:05:08,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:09,491 INFO L129 PetriNetUnfolder]: 723/3800 cut-off events. [2022-01-19 13:05:09,491 INFO L130 PetriNetUnfolder]: For 1877/2027 co-relation queries the response was YES. [2022-01-19 13:05:09,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 3800 events. 723/3800 cut-off events. For 1877/2027 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 40871 event pairs, 307 based on Foata normal form. 49/3492 useless extension candidates. Maximal degree in co-relation 4511. Up to 1007 conditions per place. [2022-01-19 13:05:09,534 INFO L132 encePairwiseOnDemand]: 266/278 looper letters, 37 selfloop transitions, 15 changer transitions 7/308 dead transitions. [2022-01-19 13:05:09,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 308 transitions, 959 flow [2022-01-19 13:05:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:05:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:05:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2276 transitions. [2022-01-19 13:05:09,539 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9096722621902478 [2022-01-19 13:05:09,539 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2276 transitions. [2022-01-19 13:05:09,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2276 transitions. [2022-01-19 13:05:09,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:09,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2276 transitions. [2022-01-19 13:05:09,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 252.88888888888889) internal successors, (2276), 9 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:09,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:09,550 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:09,550 INFO L186 Difference]: Start difference. First operand has 261 places, 278 transitions, 722 flow. Second operand 9 states and 2276 transitions. [2022-01-19 13:05:09,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 308 transitions, 959 flow [2022-01-19 13:05:09,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 308 transitions, 947 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:09,560 INFO L242 Difference]: Finished difference. Result has 275 places, 290 transitions, 844 flow [2022-01-19 13:05:09,560 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=844, PETRI_PLACES=275, PETRI_TRANSITIONS=290} [2022-01-19 13:05:09,562 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 26 predicate places. [2022-01-19 13:05:09,562 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 290 transitions, 844 flow [2022-01-19 13:05:09,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:09,563 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:09,563 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] [2022-01-19 13:05:09,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:05:09,564 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 5342983, now seen corresponding path program 2 times [2022-01-19 13:05:09,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437589652] [2022-01-19 13:05:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:09,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:09,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:09,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437589652] [2022-01-19 13:05:09,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437589652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:09,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:09,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:09,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809142383] [2022-01-19 13:05:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:09,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:09,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:09,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 13:05:09,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 290 transitions, 844 flow. Second operand has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:09,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:09,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 13:05:09,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:10,216 INFO L129 PetriNetUnfolder]: 721/3951 cut-off events. [2022-01-19 13:05:10,216 INFO L130 PetriNetUnfolder]: For 5276/5394 co-relation queries the response was YES. [2022-01-19 13:05:10,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8407 conditions, 3951 events. 721/3951 cut-off events. For 5276/5394 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 43204 event pairs, 314 based on Foata normal form. 49/3634 useless extension candidates. Maximal degree in co-relation 8373. Up to 961 conditions per place. [2022-01-19 13:05:10,268 INFO L132 encePairwiseOnDemand]: 268/278 looper letters, 41 selfloop transitions, 9 changer transitions 15/314 dead transitions. [2022-01-19 13:05:10,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 314 transitions, 1139 flow [2022-01-19 13:05:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 13:05:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 13:05:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2521 transitions. [2022-01-19 13:05:10,273 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9068345323741007 [2022-01-19 13:05:10,273 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2521 transitions. [2022-01-19 13:05:10,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2521 transitions. [2022-01-19 13:05:10,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:10,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2521 transitions. [2022-01-19 13:05:10,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 252.1) internal successors, (2521), 10 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,284 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,284 INFO L186 Difference]: Start difference. First operand has 275 places, 290 transitions, 844 flow. Second operand 10 states and 2521 transitions. [2022-01-19 13:05:10,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 314 transitions, 1139 flow [2022-01-19 13:05:10,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 314 transitions, 1111 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:10,302 INFO L242 Difference]: Finished difference. Result has 283 places, 290 transitions, 844 flow [2022-01-19 13:05:10,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=844, PETRI_PLACES=283, PETRI_TRANSITIONS=290} [2022-01-19 13:05:10,304 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2022-01-19 13:05:10,304 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 290 transitions, 844 flow [2022-01-19 13:05:10,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,305 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:10,305 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:10,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:05:10,306 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash -478362955, now seen corresponding path program 1 times [2022-01-19 13:05:10,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:10,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171668459] [2022-01-19 13:05:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:10,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:10,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:10,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171668459] [2022-01-19 13:05:10,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171668459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:10,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:10,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:10,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994614322] [2022-01-19 13:05:10,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:10,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:10,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:10,346 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 13:05:10,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 290 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:10,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 13:05:10,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:10,663 INFO L129 PetriNetUnfolder]: 196/2433 cut-off events. [2022-01-19 13:05:10,663 INFO L130 PetriNetUnfolder]: For 1066/1271 co-relation queries the response was YES. [2022-01-19 13:05:10,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 2433 events. 196/2433 cut-off events. For 1066/1271 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 24124 event pairs, 55 based on Foata normal form. 2/2285 useless extension candidates. Maximal degree in co-relation 3854. Up to 127 conditions per place. [2022-01-19 13:05:10,688 INFO L132 encePairwiseOnDemand]: 274/278 looper letters, 19 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-01-19 13:05:10,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 297 transitions, 909 flow [2022-01-19 13:05:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 13:05:10,690 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 13:05:10,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 13:05:10,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 13:05:10,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:10,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 13:05:10,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,694 INFO L186 Difference]: Start difference. First operand has 283 places, 290 transitions, 844 flow. Second operand 3 states and 795 transitions. [2022-01-19 13:05:10,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 297 transitions, 909 flow [2022-01-19 13:05:10,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 297 transitions, 900 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-01-19 13:05:10,704 INFO L242 Difference]: Finished difference. Result has 281 places, 292 transitions, 859 flow [2022-01-19 13:05:10,705 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=281, PETRI_TRANSITIONS=292} [2022-01-19 13:05:10,705 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 32 predicate places. [2022-01-19 13:05:10,706 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 292 transitions, 859 flow [2022-01-19 13:05:10,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,706 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:10,706 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] [2022-01-19 13:05:10,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:05:10,706 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 701178951, now seen corresponding path program 1 times [2022-01-19 13:05:10,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:10,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565829980] [2022-01-19 13:05:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:10,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:10,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565829980] [2022-01-19 13:05:10,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565829980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:10,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:10,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:05:10,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353038026] [2022-01-19 13:05:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:10,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:05:10,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:10,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:05:10,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:05:10,792 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 13:05:10,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 292 transitions, 859 flow. Second operand has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:10,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:10,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 13:05:10,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:11,485 INFO L129 PetriNetUnfolder]: 738/5704 cut-off events. [2022-01-19 13:05:11,485 INFO L130 PetriNetUnfolder]: For 4967/5505 co-relation queries the response was YES. [2022-01-19 13:05:11,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 5704 events. 738/5704 cut-off events. For 4967/5505 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 70658 event pairs, 300 based on Foata normal form. 37/5409 useless extension candidates. Maximal degree in co-relation 9644. Up to 510 conditions per place. [2022-01-19 13:05:11,548 INFO L132 encePairwiseOnDemand]: 269/278 looper letters, 36 selfloop transitions, 9 changer transitions 43/344 dead transitions. [2022-01-19 13:05:11,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 344 transitions, 1352 flow [2022-01-19 13:05:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:05:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:05:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1774 transitions. [2022-01-19 13:05:11,552 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9116135662898253 [2022-01-19 13:05:11,552 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1774 transitions. [2022-01-19 13:05:11,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1774 transitions. [2022-01-19 13:05:11,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:11,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1774 transitions. [2022-01-19 13:05:11,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 253.42857142857142) internal successors, (1774), 7 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:11,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:11,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:11,561 INFO L186 Difference]: Start difference. First operand has 281 places, 292 transitions, 859 flow. Second operand 7 states and 1774 transitions. [2022-01-19 13:05:11,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 344 transitions, 1352 flow [2022-01-19 13:05:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 344 transitions, 1346 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:11,582 INFO L242 Difference]: Finished difference. Result has 291 places, 292 transitions, 893 flow [2022-01-19 13:05:11,583 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-01-19 13:05:11,584 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 42 predicate places. [2022-01-19 13:05:11,585 INFO L470 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 893 flow [2022-01-19 13:05:11,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:11,597 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:11,597 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] [2022-01-19 13:05:11,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:05:11,597 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:11,597 INFO L85 PathProgramCache]: Analyzing trace with hash 828163827, now seen corresponding path program 2 times [2022-01-19 13:05:11,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:11,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101800226] [2022-01-19 13:05:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:11,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:11,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101800226] [2022-01-19 13:05:11,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101800226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:11,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:11,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:05:11,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314472666] [2022-01-19 13:05:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:11,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:05:11,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:05:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:05:11,698 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 278 [2022-01-19 13:05:11,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 893 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:11,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:11,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 278 [2022-01-19 13:05:11,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:11,990 INFO L129 PetriNetUnfolder]: 232/2187 cut-off events. [2022-01-19 13:05:11,990 INFO L130 PetriNetUnfolder]: For 1375/1604 co-relation queries the response was YES. [2022-01-19 13:05:12,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 2187 events. 232/2187 cut-off events. For 1375/1604 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22109 event pairs, 62 based on Foata normal form. 21/2057 useless extension candidates. Maximal degree in co-relation 3966. Up to 150 conditions per place. [2022-01-19 13:05:12,013 INFO L132 encePairwiseOnDemand]: 269/278 looper letters, 23 selfloop transitions, 11 changer transitions 4/303 dead transitions. [2022-01-19 13:05:12,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 303 transitions, 1009 flow [2022-01-19 13:05:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:05:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:05:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1791 transitions. [2022-01-19 13:05:12,017 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.920349434737924 [2022-01-19 13:05:12,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1791 transitions. [2022-01-19 13:05:12,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1791 transitions. [2022-01-19 13:05:12,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:12,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1791 transitions. [2022-01-19 13:05:12,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 255.85714285714286) internal successors, (1791), 7 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,024 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,024 INFO L186 Difference]: Start difference. First operand has 291 places, 292 transitions, 893 flow. Second operand 7 states and 1791 transitions. [2022-01-19 13:05:12,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 303 transitions, 1009 flow [2022-01-19 13:05:12,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 303 transitions, 969 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-01-19 13:05:12,035 INFO L242 Difference]: Finished difference. Result has 291 places, 292 transitions, 893 flow [2022-01-19 13:05:12,035 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-01-19 13:05:12,035 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 42 predicate places. [2022-01-19 13:05:12,036 INFO L470 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 893 flow [2022-01-19 13:05:12,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:12,036 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] [2022-01-19 13:05:12,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:05:12,037 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash -724671635, now seen corresponding path program 1 times [2022-01-19 13:05:12,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:12,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123871543] [2022-01-19 13:05:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:12,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:12,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:12,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123871543] [2022-01-19 13:05:12,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123871543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:12,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:12,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:12,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43228581] [2022-01-19 13:05:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:12,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:12,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:12,068 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 13:05:12,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:12,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 13:05:12,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:12,467 INFO L129 PetriNetUnfolder]: 338/4472 cut-off events. [2022-01-19 13:05:12,467 INFO L130 PetriNetUnfolder]: For 2331/2676 co-relation queries the response was YES. [2022-01-19 13:05:12,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7369 conditions, 4472 events. 338/4472 cut-off events. For 2331/2676 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 53922 event pairs, 87 based on Foata normal form. 5/4186 useless extension candidates. Maximal degree in co-relation 7325. Up to 214 conditions per place. [2022-01-19 13:05:12,514 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 18 selfloop transitions, 3 changer transitions 1/300 dead transitions. [2022-01-19 13:05:12,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 300 transitions, 958 flow [2022-01-19 13:05:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 13:05:12,516 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 13:05:12,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 13:05:12,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 13:05:12,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:12,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 13:05:12,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,520 INFO L186 Difference]: Start difference. First operand has 291 places, 292 transitions, 893 flow. Second operand 3 states and 793 transitions. [2022-01-19 13:05:12,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 300 transitions, 958 flow [2022-01-19 13:05:12,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 300 transitions, 933 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-01-19 13:05:12,537 INFO L242 Difference]: Finished difference. Result has 287 places, 294 transitions, 894 flow [2022-01-19 13:05:12,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2022-01-19 13:05:12,537 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 38 predicate places. [2022-01-19 13:05:12,538 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 894 flow [2022-01-19 13:05:12,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:12,538 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] [2022-01-19 13:05:12,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:05:12,538 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash -613985965, now seen corresponding path program 2 times [2022-01-19 13:05:12,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:12,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142767053] [2022-01-19 13:05:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:12,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:12,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142767053] [2022-01-19 13:05:12,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142767053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:12,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:12,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:12,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877657327] [2022-01-19 13:05:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:12,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:12,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:12,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:12,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:12,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 13:05:12,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:12,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 13:05:12,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:12,878 INFO L129 PetriNetUnfolder]: 232/3236 cut-off events. [2022-01-19 13:05:12,878 INFO L130 PetriNetUnfolder]: For 1387/1555 co-relation queries the response was YES. [2022-01-19 13:05:12,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 3236 events. 232/3236 cut-off events. For 1387/1555 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 36092 event pairs, 70 based on Foata normal form. 18/3056 useless extension candidates. Maximal degree in co-relation 4665. Up to 140 conditions per place. [2022-01-19 13:05:12,909 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 18 selfloop transitions, 5 changer transitions 2/302 dead transitions. [2022-01-19 13:05:12,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 302 transitions, 969 flow [2022-01-19 13:05:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 13:05:12,911 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 13:05:12,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 13:05:12,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 13:05:12,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:12,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 13:05:12,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,914 INFO L186 Difference]: Start difference. First operand has 287 places, 294 transitions, 894 flow. Second operand 3 states and 793 transitions. [2022-01-19 13:05:12,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 302 transitions, 969 flow [2022-01-19 13:05:12,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 302 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:12,925 INFO L242 Difference]: Finished difference. Result has 290 places, 295 transitions, 924 flow [2022-01-19 13:05:12,925 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=924, PETRI_PLACES=290, PETRI_TRANSITIONS=295} [2022-01-19 13:05:12,926 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 41 predicate places. [2022-01-19 13:05:12,926 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 295 transitions, 924 flow [2022-01-19 13:05:12,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:12,926 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:12,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 13:05:12,926 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:12,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1342359111, now seen corresponding path program 1 times [2022-01-19 13:05:12,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:12,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496186859] [2022-01-19 13:05:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:12,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:12,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496186859] [2022-01-19 13:05:12,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496186859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:12,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:12,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:05:12,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920805981] [2022-01-19 13:05:12,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:12,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:05:12,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:05:12,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:05:12,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 278 [2022-01-19 13:05:12,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 295 transitions, 924 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:12,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:12,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 278 [2022-01-19 13:05:12,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:13,361 INFO L129 PetriNetUnfolder]: 280/3039 cut-off events. [2022-01-19 13:05:13,361 INFO L130 PetriNetUnfolder]: For 1529/1836 co-relation queries the response was YES. [2022-01-19 13:05:13,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5176 conditions, 3039 events. 280/3039 cut-off events. For 1529/1836 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 33785 event pairs, 122 based on Foata normal form. 11/2852 useless extension candidates. Maximal degree in co-relation 4642. Up to 347 conditions per place. [2022-01-19 13:05:13,392 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 30 selfloop transitions, 5 changer transitions 18/314 dead transitions. [2022-01-19 13:05:13,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 314 transitions, 1080 flow [2022-01-19 13:05:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:05:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:05:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2297 transitions. [2022-01-19 13:05:13,398 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9180655475619505 [2022-01-19 13:05:13,398 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2297 transitions. [2022-01-19 13:05:13,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2297 transitions. [2022-01-19 13:05:13,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:13,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2297 transitions. [2022-01-19 13:05:13,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 255.22222222222223) internal successors, (2297), 9 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,407 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,407 INFO L186 Difference]: Start difference. First operand has 290 places, 295 transitions, 924 flow. Second operand 9 states and 2297 transitions. [2022-01-19 13:05:13,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 314 transitions, 1080 flow [2022-01-19 13:05:13,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 314 transitions, 1062 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 13:05:13,420 INFO L242 Difference]: Finished difference. Result has 300 places, 290 transitions, 912 flow [2022-01-19 13:05:13,420 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=300, PETRI_TRANSITIONS=290} [2022-01-19 13:05:13,421 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 51 predicate places. [2022-01-19 13:05:13,421 INFO L470 AbstractCegarLoop]: Abstraction has has 300 places, 290 transitions, 912 flow [2022-01-19 13:05:13,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,422 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:13,422 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:13,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 13:05:13,422 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1200197174, now seen corresponding path program 1 times [2022-01-19 13:05:13,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:13,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509338251] [2022-01-19 13:05:13,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:13,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:13,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509338251] [2022-01-19 13:05:13,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509338251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:13,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:13,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:05:13,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111022243] [2022-01-19 13:05:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:13,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:05:13,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:05:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:05:13,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 278 [2022-01-19 13:05:13,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 290 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:13,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 278 [2022-01-19 13:05:13,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:13,810 INFO L129 PetriNetUnfolder]: 164/2472 cut-off events. [2022-01-19 13:05:13,810 INFO L130 PetriNetUnfolder]: For 1117/1286 co-relation queries the response was YES. [2022-01-19 13:05:13,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 2472 events. 164/2472 cut-off events. For 1117/1286 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 26376 event pairs, 28 based on Foata normal form. 10/2325 useless extension candidates. Maximal degree in co-relation 3901. Up to 138 conditions per place. [2022-01-19 13:05:13,832 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 16 selfloop transitions, 1 changer transitions 20/310 dead transitions. [2022-01-19 13:05:13,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 310 transitions, 1063 flow [2022-01-19 13:05:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:05:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:05:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2297 transitions. [2022-01-19 13:05:13,836 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9180655475619505 [2022-01-19 13:05:13,837 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2297 transitions. [2022-01-19 13:05:13,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2297 transitions. [2022-01-19 13:05:13,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:13,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2297 transitions. [2022-01-19 13:05:13,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 255.22222222222223) internal successors, (2297), 9 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,845 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,845 INFO L186 Difference]: Start difference. First operand has 300 places, 290 transitions, 912 flow. Second operand 9 states and 2297 transitions. [2022-01-19 13:05:13,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 310 transitions, 1063 flow [2022-01-19 13:05:13,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 310 transitions, 1038 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-01-19 13:05:13,856 INFO L242 Difference]: Finished difference. Result has 308 places, 290 transitions, 910 flow [2022-01-19 13:05:13,857 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=308, PETRI_TRANSITIONS=290} [2022-01-19 13:05:13,857 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 59 predicate places. [2022-01-19 13:05:13,857 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 290 transitions, 910 flow [2022-01-19 13:05:13,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:13,858 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] [2022-01-19 13:05:13,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:05:13,858 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 844666116, now seen corresponding path program 1 times [2022-01-19 13:05:13,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:13,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024038298] [2022-01-19 13:05:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:13,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:13,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:13,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024038298] [2022-01-19 13:05:13,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024038298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:13,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:13,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 13:05:13,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240874938] [2022-01-19 13:05:13,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:13,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:05:13,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:05:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:05:13,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 278 [2022-01-19 13:05:13,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 290 transitions, 910 flow. Second operand has 9 states, 9 states have (on average 243.66666666666666) internal successors, (2193), 9 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:13,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:13,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 278 [2022-01-19 13:05:13,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:14,521 INFO L129 PetriNetUnfolder]: 597/3623 cut-off events. [2022-01-19 13:05:14,521 INFO L130 PetriNetUnfolder]: For 5474/5738 co-relation queries the response was YES. [2022-01-19 13:05:14,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7965 conditions, 3623 events. 597/3623 cut-off events. For 5474/5738 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 40601 event pairs, 316 based on Foata normal form. 22/3377 useless extension candidates. Maximal degree in co-relation 7930. Up to 839 conditions per place. [2022-01-19 13:05:14,566 INFO L132 encePairwiseOnDemand]: 262/278 looper letters, 67 selfloop transitions, 25 changer transitions 16/355 dead transitions. [2022-01-19 13:05:14,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 355 transitions, 1579 flow [2022-01-19 13:05:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:05:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:05:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3215 transitions. [2022-01-19 13:05:14,572 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8895960154952961 [2022-01-19 13:05:14,572 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3215 transitions. [2022-01-19 13:05:14,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3215 transitions. [2022-01-19 13:05:14,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:14,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3215 transitions. [2022-01-19 13:05:14,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 247.30769230769232) internal successors, (3215), 13 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:14,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:14,585 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:14,585 INFO L186 Difference]: Start difference. First operand has 308 places, 290 transitions, 910 flow. Second operand 13 states and 3215 transitions. [2022-01-19 13:05:14,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 355 transitions, 1579 flow [2022-01-19 13:05:14,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 355 transitions, 1523 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-01-19 13:05:14,606 INFO L242 Difference]: Finished difference. Result has 317 places, 312 transitions, 1203 flow [2022-01-19 13:05:14,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1203, PETRI_PLACES=317, PETRI_TRANSITIONS=312} [2022-01-19 13:05:14,607 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 68 predicate places. [2022-01-19 13:05:14,607 INFO L470 AbstractCegarLoop]: Abstraction has has 317 places, 312 transitions, 1203 flow [2022-01-19 13:05:14,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 243.66666666666666) internal successors, (2193), 9 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:14,608 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:14,608 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] [2022-01-19 13:05:14,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:05:14,608 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1973413174, now seen corresponding path program 2 times [2022-01-19 13:05:14,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:14,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337908767] [2022-01-19 13:05:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:14,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:14,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:14,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337908767] [2022-01-19 13:05:14,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337908767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:14,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:14,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:14,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504057518] [2022-01-19 13:05:14,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:14,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:14,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:14,726 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 278 [2022-01-19 13:05:14,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 312 transitions, 1203 flow. Second operand has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:14,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:14,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 278 [2022-01-19 13:05:14,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:15,288 INFO L129 PetriNetUnfolder]: 565/3254 cut-off events. [2022-01-19 13:05:15,288 INFO L130 PetriNetUnfolder]: For 17871/18379 co-relation queries the response was YES. [2022-01-19 13:05:15,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9365 conditions, 3254 events. 565/3254 cut-off events. For 17871/18379 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 35451 event pairs, 154 based on Foata normal form. 78/3106 useless extension candidates. Maximal degree in co-relation 9323. Up to 544 conditions per place. [2022-01-19 13:05:15,330 INFO L132 encePairwiseOnDemand]: 264/278 looper letters, 71 selfloop transitions, 20 changer transitions 4/342 dead transitions. [2022-01-19 13:05:15,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 342 transitions, 1751 flow [2022-01-19 13:05:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 13:05:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 13:05:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2472 transitions. [2022-01-19 13:05:15,335 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8892086330935252 [2022-01-19 13:05:15,336 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2472 transitions. [2022-01-19 13:05:15,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2472 transitions. [2022-01-19 13:05:15,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:15,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2472 transitions. [2022-01-19 13:05:15,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 247.2) internal successors, (2472), 10 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,345 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,345 INFO L186 Difference]: Start difference. First operand has 317 places, 312 transitions, 1203 flow. Second operand 10 states and 2472 transitions. [2022-01-19 13:05:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 342 transitions, 1751 flow [2022-01-19 13:05:15,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 342 transitions, 1645 flow, removed 53 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:15,383 INFO L242 Difference]: Finished difference. Result has 325 places, 312 transitions, 1155 flow [2022-01-19 13:05:15,384 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1155, PETRI_PLACES=325, PETRI_TRANSITIONS=312} [2022-01-19 13:05:15,384 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 76 predicate places. [2022-01-19 13:05:15,384 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 312 transitions, 1155 flow [2022-01-19 13:05:15,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,385 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:15,385 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] [2022-01-19 13:05:15,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:05:15,385 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash -575243458, now seen corresponding path program 1 times [2022-01-19 13:05:15,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:15,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474413343] [2022-01-19 13:05:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:15,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:15,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:15,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474413343] [2022-01-19 13:05:15,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474413343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:15,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:15,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:15,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602470979] [2022-01-19 13:05:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:15,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:15,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:15,415 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 13:05:15,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 312 transitions, 1155 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:15,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 13:05:15,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:15,832 INFO L129 PetriNetUnfolder]: 348/4048 cut-off events. [2022-01-19 13:05:15,832 INFO L130 PetriNetUnfolder]: For 6121/6527 co-relation queries the response was YES. [2022-01-19 13:05:15,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7956 conditions, 4048 events. 348/4048 cut-off events. For 6121/6527 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 46710 event pairs, 86 based on Foata normal form. 5/3797 useless extension candidates. Maximal degree in co-relation 7909. Up to 233 conditions per place. [2022-01-19 13:05:15,884 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 20 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2022-01-19 13:05:15,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 320 transitions, 1223 flow [2022-01-19 13:05:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-01-19 13:05:15,886 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2022-01-19 13:05:15,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2022-01-19 13:05:15,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2022-01-19 13:05:15,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:15,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2022-01-19 13:05:15,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,890 INFO L186 Difference]: Start difference. First operand has 325 places, 312 transitions, 1155 flow. Second operand 3 states and 790 transitions. [2022-01-19 13:05:15,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 320 transitions, 1223 flow [2022-01-19 13:05:15,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 1176 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-01-19 13:05:15,922 INFO L242 Difference]: Finished difference. Result has 318 places, 316 transitions, 1148 flow [2022-01-19 13:05:15,922 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2022-01-19 13:05:15,923 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 69 predicate places. [2022-01-19 13:05:15,923 INFO L470 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 1148 flow [2022-01-19 13:05:15,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,923 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:15,923 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] [2022-01-19 13:05:15,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 13:05:15,924 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1127052730, now seen corresponding path program 2 times [2022-01-19 13:05:15,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:15,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042137600] [2022-01-19 13:05:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:15,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:15,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:15,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042137600] [2022-01-19 13:05:15,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042137600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:15,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:15,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:15,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323533882] [2022-01-19 13:05:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:15,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:15,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:15,957 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 13:05:15,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:15,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:15,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 13:05:15,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:16,252 INFO L129 PetriNetUnfolder]: 262/3245 cut-off events. [2022-01-19 13:05:16,252 INFO L130 PetriNetUnfolder]: For 4746/5159 co-relation queries the response was YES. [2022-01-19 13:05:16,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6195 conditions, 3245 events. 262/3245 cut-off events. For 4746/5159 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 35990 event pairs, 80 based on Foata normal form. 43/3130 useless extension candidates. Maximal degree in co-relation 6095. Up to 164 conditions per place. [2022-01-19 13:05:16,281 INFO L132 encePairwiseOnDemand]: 268/278 looper letters, 22 selfloop transitions, 6 changer transitions 0/324 dead transitions. [2022-01-19 13:05:16,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 324 transitions, 1232 flow [2022-01-19 13:05:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-01-19 13:05:16,283 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2022-01-19 13:05:16,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2022-01-19 13:05:16,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2022-01-19 13:05:16,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:16,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2022-01-19 13:05:16,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,286 INFO L186 Difference]: Start difference. First operand has 318 places, 316 transitions, 1148 flow. Second operand 3 states and 790 transitions. [2022-01-19 13:05:16,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 324 transitions, 1232 flow [2022-01-19 13:05:16,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 324 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:16,307 INFO L242 Difference]: Finished difference. Result has 321 places, 320 transitions, 1200 flow [2022-01-19 13:05:16,307 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=321, PETRI_TRANSITIONS=320} [2022-01-19 13:05:16,307 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 72 predicate places. [2022-01-19 13:05:16,308 INFO L470 AbstractCegarLoop]: Abstraction has has 321 places, 320 transitions, 1200 flow [2022-01-19 13:05:16,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,308 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:16,308 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] [2022-01-19 13:05:16,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 13:05:16,308 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1154758708, now seen corresponding path program 1 times [2022-01-19 13:05:16,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:16,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961402464] [2022-01-19 13:05:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:16,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:16,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:16,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961402464] [2022-01-19 13:05:16,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961402464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:16,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:16,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:16,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289885731] [2022-01-19 13:05:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:16,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:16,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:16,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 13:05:16,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 320 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:16,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 13:05:16,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:16,879 INFO L129 PetriNetUnfolder]: 372/4984 cut-off events. [2022-01-19 13:05:16,880 INFO L130 PetriNetUnfolder]: For 10463/11776 co-relation queries the response was YES. [2022-01-19 13:05:16,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10074 conditions, 4984 events. 372/4984 cut-off events. For 10463/11776 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 60439 event pairs, 67 based on Foata normal form. 9/4742 useless extension candidates. Maximal degree in co-relation 9906. Up to 364 conditions per place. [2022-01-19 13:05:16,925 INFO L132 encePairwiseOnDemand]: 274/278 looper letters, 17 selfloop transitions, 2 changer transitions 4/327 dead transitions. [2022-01-19 13:05:16,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 327 transitions, 1257 flow [2022-01-19 13:05:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 13:05:16,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 13:05:16,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 13:05:16,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 13:05:16,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:16,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 13:05:16,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,930 INFO L186 Difference]: Start difference. First operand has 321 places, 320 transitions, 1200 flow. Second operand 3 states and 795 transitions. [2022-01-19 13:05:16,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 327 transitions, 1257 flow [2022-01-19 13:05:16,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 327 transitions, 1237 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:16,961 INFO L242 Difference]: Finished difference. Result has 323 places, 318 transitions, 1181 flow [2022-01-19 13:05:16,961 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=323, PETRI_TRANSITIONS=318} [2022-01-19 13:05:16,962 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 74 predicate places. [2022-01-19 13:05:16,962 INFO L470 AbstractCegarLoop]: Abstraction has has 323 places, 318 transitions, 1181 flow [2022-01-19 13:05:16,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,962 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:16,963 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:16,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:05:16,963 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:16,963 INFO L85 PathProgramCache]: Analyzing trace with hash -422431016, now seen corresponding path program 2 times [2022-01-19 13:05:16,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:16,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044759722] [2022-01-19 13:05:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:16,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:16,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:16,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044759722] [2022-01-19 13:05:16,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044759722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:16,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:16,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:16,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383923220] [2022-01-19 13:05:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:16,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:16,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:16,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:16,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:16,999 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 13:05:16,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 318 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:16,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:16,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 13:05:16,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:17,459 INFO L129 PetriNetUnfolder]: 279/4841 cut-off events. [2022-01-19 13:05:17,460 INFO L130 PetriNetUnfolder]: For 8640/9448 co-relation queries the response was YES. [2022-01-19 13:05:17,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9175 conditions, 4841 events. 279/4841 cut-off events. For 8640/9448 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 57719 event pairs, 88 based on Foata normal form. 23/4644 useless extension candidates. Maximal degree in co-relation 9006. Up to 372 conditions per place. [2022-01-19 13:05:17,504 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 17 selfloop transitions, 4 changer transitions 0/325 dead transitions. [2022-01-19 13:05:17,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 325 transitions, 1246 flow [2022-01-19 13:05:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 13:05:17,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 13:05:17,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 13:05:17,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 13:05:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:17,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 13:05:17,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:17,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:17,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:17,509 INFO L186 Difference]: Start difference. First operand has 323 places, 318 transitions, 1181 flow. Second operand 3 states and 795 transitions. [2022-01-19 13:05:17,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 325 transitions, 1246 flow [2022-01-19 13:05:17,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 325 transitions, 1242 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:17,535 INFO L242 Difference]: Finished difference. Result has 323 places, 320 transitions, 1209 flow [2022-01-19 13:05:17,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1209, PETRI_PLACES=323, PETRI_TRANSITIONS=320} [2022-01-19 13:05:17,535 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 74 predicate places. [2022-01-19 13:05:17,535 INFO L470 AbstractCegarLoop]: Abstraction has has 323 places, 320 transitions, 1209 flow [2022-01-19 13:05:17,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:17,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:17,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] [2022-01-19 13:05:17,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 13:05:17,536 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1002671030, now seen corresponding path program 1 times [2022-01-19 13:05:17,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:17,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806710373] [2022-01-19 13:05:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:17,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:17,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:17,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806710373] [2022-01-19 13:05:17,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806710373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:17,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:17,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:17,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914954762] [2022-01-19 13:05:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:17,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:17,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:17,575 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 13:05:17,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 320 transitions, 1209 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:17,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:17,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 13:05:17,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:18,321 INFO L129 PetriNetUnfolder]: 427/7268 cut-off events. [2022-01-19 13:05:18,321 INFO L130 PetriNetUnfolder]: For 13900/15894 co-relation queries the response was YES. [2022-01-19 13:05:18,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14303 conditions, 7268 events. 427/7268 cut-off events. For 13900/15894 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 94747 event pairs, 129 based on Foata normal form. 10/6931 useless extension candidates. Maximal degree in co-relation 14030. Up to 454 conditions per place. [2022-01-19 13:05:18,402 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 19 selfloop transitions, 3 changer transitions 0/328 dead transitions. [2022-01-19 13:05:18,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 328 transitions, 1274 flow [2022-01-19 13:05:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 13:05:18,403 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 13:05:18,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 13:05:18,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 13:05:18,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:18,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 13:05:18,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:18,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:18,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:18,406 INFO L186 Difference]: Start difference. First operand has 323 places, 320 transitions, 1209 flow. Second operand 3 states and 793 transitions. [2022-01-19 13:05:18,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 328 transitions, 1274 flow [2022-01-19 13:05:18,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 328 transitions, 1262 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:18,447 INFO L242 Difference]: Finished difference. Result has 325 places, 323 transitions, 1227 flow [2022-01-19 13:05:18,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=325, PETRI_TRANSITIONS=323} [2022-01-19 13:05:18,448 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 76 predicate places. [2022-01-19 13:05:18,448 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 323 transitions, 1227 flow [2022-01-19 13:05:18,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:18,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:18,448 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:05:18,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 13:05:18,448 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -470959612, now seen corresponding path program 1 times [2022-01-19 13:05:18,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:18,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701756518] [2022-01-19 13:05:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:18,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:18,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:18,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701756518] [2022-01-19 13:05:18,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701756518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:18,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:18,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:05:18,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843758511] [2022-01-19 13:05:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:18,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:05:18,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:18,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:05:18,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:05:18,481 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 13:05:18,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 323 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:18,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:18,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 13:05:18,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:19,088 INFO L129 PetriNetUnfolder]: 329/6447 cut-off events. [2022-01-19 13:05:19,089 INFO L130 PetriNetUnfolder]: For 10943/12277 co-relation queries the response was YES. [2022-01-19 13:05:19,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12440 conditions, 6447 events. 329/6447 cut-off events. For 10943/12277 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 82319 event pairs, 119 based on Foata normal form. 23/6185 useless extension candidates. Maximal degree in co-relation 12182. Up to 428 conditions per place. [2022-01-19 13:05:19,143 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 20 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2022-01-19 13:05:19,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 331 transitions, 1304 flow [2022-01-19 13:05:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:05:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:05:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 13:05:19,144 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 13:05:19,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 13:05:19,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 13:05:19,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:19,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 13:05:19,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:19,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:19,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:19,148 INFO L186 Difference]: Start difference. First operand has 325 places, 323 transitions, 1227 flow. Second operand 3 states and 793 transitions. [2022-01-19 13:05:19,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 331 transitions, 1304 flow [2022-01-19 13:05:19,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 331 transitions, 1301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:05:19,183 INFO L242 Difference]: Finished difference. Result has 328 places, 326 transitions, 1268 flow [2022-01-19 13:05:19,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-01-19 13:05:19,184 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 79 predicate places. [2022-01-19 13:05:19,184 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 1268 flow [2022-01-19 13:05:19,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:19,184 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:19,184 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] [2022-01-19 13:05:19,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 13:05:19,184 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash -800047842, now seen corresponding path program 1 times [2022-01-19 13:05:19,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934889255] [2022-01-19 13:05:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:19,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:19,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:19,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934889255] [2022-01-19 13:05:19,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934889255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:19,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:19,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 13:05:19,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755661177] [2022-01-19 13:05:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:19,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:05:19,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:05:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:05:19,269 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 278 [2022-01-19 13:05:19,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 1268 flow. Second operand has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:19,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:19,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 278 [2022-01-19 13:05:19,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:20,183 INFO L129 PetriNetUnfolder]: 774/6182 cut-off events. [2022-01-19 13:05:20,183 INFO L130 PetriNetUnfolder]: For 11624/13682 co-relation queries the response was YES. [2022-01-19 13:05:20,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 6182 events. 774/6182 cut-off events. For 11624/13682 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 77759 event pairs, 516 based on Foata normal form. 23/5689 useless extension candidates. Maximal degree in co-relation 13279. Up to 1997 conditions per place. [2022-01-19 13:05:20,229 INFO L132 encePairwiseOnDemand]: 266/278 looper letters, 39 selfloop transitions, 9 changer transitions 40/356 dead transitions. [2022-01-19 13:05:20,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 356 transitions, 1505 flow [2022-01-19 13:05:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:05:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:05:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3240 transitions. [2022-01-19 13:05:20,239 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.896513558384062 [2022-01-19 13:05:20,240 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3240 transitions. [2022-01-19 13:05:20,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3240 transitions. [2022-01-19 13:05:20,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:20,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3240 transitions. [2022-01-19 13:05:20,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 249.23076923076923) internal successors, (3240), 13 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:20,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:20,251 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:20,251 INFO L186 Difference]: Start difference. First operand has 328 places, 326 transitions, 1268 flow. Second operand 13 states and 3240 transitions. [2022-01-19 13:05:20,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 356 transitions, 1505 flow [2022-01-19 13:05:20,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 356 transitions, 1489 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 13:05:20,286 INFO L242 Difference]: Finished difference. Result has 349 places, 307 transitions, 1167 flow [2022-01-19 13:05:20,286 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1167, PETRI_PLACES=349, PETRI_TRANSITIONS=307} [2022-01-19 13:05:20,287 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 100 predicate places. [2022-01-19 13:05:20,287 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 307 transitions, 1167 flow [2022-01-19 13:05:20,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:20,288 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:20,288 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] [2022-01-19 13:05:20,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 13:05:20,288 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -329941492, now seen corresponding path program 1 times [2022-01-19 13:05:20,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:20,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939774811] [2022-01-19 13:05:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:20,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:20,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:20,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939774811] [2022-01-19 13:05:20,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939774811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:20,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:20,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 13:05:20,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811549558] [2022-01-19 13:05:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:20,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:05:20,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:05:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:05:20,368 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 278 [2022-01-19 13:05:20,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 307 transitions, 1167 flow. Second operand has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:20,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:20,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 278 [2022-01-19 13:05:20,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:21,295 INFO L129 PetriNetUnfolder]: 600/6425 cut-off events. [2022-01-19 13:05:21,295 INFO L130 PetriNetUnfolder]: For 13589/15867 co-relation queries the response was YES. [2022-01-19 13:05:21,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14788 conditions, 6425 events. 600/6425 cut-off events. For 13589/15867 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 81144 event pairs, 318 based on Foata normal form. 27/6076 useless extension candidates. Maximal degree in co-relation 14736. Up to 782 conditions per place. [2022-01-19 13:05:21,344 INFO L132 encePairwiseOnDemand]: 265/278 looper letters, 51 selfloop transitions, 14 changer transitions 18/348 dead transitions. [2022-01-19 13:05:21,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 348 transitions, 1484 flow [2022-01-19 13:05:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:05:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:05:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4235 transitions. [2022-01-19 13:05:21,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8961066440964875 [2022-01-19 13:05:21,348 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4235 transitions. [2022-01-19 13:05:21,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4235 transitions. [2022-01-19 13:05:21,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:21,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4235 transitions. [2022-01-19 13:05:21,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 249.11764705882354) internal successors, (4235), 17 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:21,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 278.0) internal successors, (5004), 18 states have internal predecessors, (5004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:21,359 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 278.0) internal successors, (5004), 18 states have internal predecessors, (5004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:21,359 INFO L186 Difference]: Start difference. First operand has 349 places, 307 transitions, 1167 flow. Second operand 17 states and 4235 transitions. [2022-01-19 13:05:21,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 348 transitions, 1484 flow [2022-01-19 13:05:21,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 348 transitions, 1429 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-19 13:05:21,430 INFO L242 Difference]: Finished difference. Result has 348 places, 315 transitions, 1227 flow [2022-01-19 13:05:21,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1227, PETRI_PLACES=348, PETRI_TRANSITIONS=315} [2022-01-19 13:05:21,431 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 99 predicate places. [2022-01-19 13:05:21,431 INFO L470 AbstractCegarLoop]: Abstraction has has 348 places, 315 transitions, 1227 flow [2022-01-19 13:05:21,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:21,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:21,431 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] [2022-01-19 13:05:21,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 13:05:21,431 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1961496104, now seen corresponding path program 1 times [2022-01-19 13:05:21,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:21,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339164626] [2022-01-19 13:05:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:21,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:21,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339164626] [2022-01-19 13:05:21,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339164626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:21,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:21,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:05:21,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281666480] [2022-01-19 13:05:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:21,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:05:21,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:05:21,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:05:21,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 278 [2022-01-19 13:05:21,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 315 transitions, 1227 flow. Second operand has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:21,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:21,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 278 [2022-01-19 13:05:21,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:05:22,703 INFO L129 PetriNetUnfolder]: 1204/8429 cut-off events. [2022-01-19 13:05:22,704 INFO L130 PetriNetUnfolder]: For 39462/42870 co-relation queries the response was YES. [2022-01-19 13:05:22,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22450 conditions, 8429 events. 1204/8429 cut-off events. For 39462/42870 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 108385 event pairs, 779 based on Foata normal form. 174/8043 useless extension candidates. Maximal degree in co-relation 22394. Up to 1639 conditions per place. [2022-01-19 13:05:22,780 INFO L132 encePairwiseOnDemand]: 264/278 looper letters, 36 selfloop transitions, 3 changer transitions 114/428 dead transitions. [2022-01-19 13:05:22,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 428 transitions, 2384 flow [2022-01-19 13:05:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 13:05:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 13:05:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3451 transitions. [2022-01-19 13:05:22,784 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8866906474820144 [2022-01-19 13:05:22,784 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3451 transitions. [2022-01-19 13:05:22,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3451 transitions. [2022-01-19 13:05:22,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:05:22,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3451 transitions. [2022-01-19 13:05:22,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 246.5) internal successors, (3451), 14 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:22,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 278.0) internal successors, (4170), 15 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:22,792 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 278.0) internal successors, (4170), 15 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:22,792 INFO L186 Difference]: Start difference. First operand has 348 places, 315 transitions, 1227 flow. Second operand 14 states and 3451 transitions. [2022-01-19 13:05:22,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 428 transitions, 2384 flow [2022-01-19 13:05:22,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 428 transitions, 2325 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-01-19 13:05:22,872 INFO L242 Difference]: Finished difference. Result has 362 places, 314 transitions, 1215 flow [2022-01-19 13:05:22,872 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1215, PETRI_PLACES=362, PETRI_TRANSITIONS=314} [2022-01-19 13:05:22,873 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 113 predicate places. [2022-01-19 13:05:22,873 INFO L470 AbstractCegarLoop]: Abstraction has has 362 places, 314 transitions, 1215 flow [2022-01-19 13:05:22,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:22,873 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:05:22,873 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] [2022-01-19 13:05:22,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 13:05:22,874 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:05:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:05:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash -66196892, now seen corresponding path program 1 times [2022-01-19 13:05:22,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:05:22,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20764507] [2022-01-19 13:05:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:05:22,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:05:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:05:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:05:23,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:05:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20764507] [2022-01-19 13:05:23,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20764507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:05:23,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:05:23,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-19 13:05:23,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101576452] [2022-01-19 13:05:23,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:05:23,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 13:05:23,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:05:23,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 13:05:23,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 13:05:23,387 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 278 [2022-01-19 13:05:23,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 314 transitions, 1215 flow. Second operand has 34 states, 34 states have (on average 180.3235294117647) internal successors, (6131), 34 states have internal predecessors, (6131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:05:23,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:05:23,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 278 [2022-01-19 13:05:23,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:06:14,342 INFO L129 PetriNetUnfolder]: 60880/129721 cut-off events. [2022-01-19 13:06:14,343 INFO L130 PetriNetUnfolder]: For 327604/328584 co-relation queries the response was YES. [2022-01-19 13:06:16,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360643 conditions, 129721 events. 60880/129721 cut-off events. For 327604/328584 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 1472333 event pairs, 23105 based on Foata normal form. 508/126545 useless extension candidates. Maximal degree in co-relation 360579. Up to 41710 conditions per place. [2022-01-19 13:06:16,601 INFO L132 encePairwiseOnDemand]: 230/278 looper letters, 1430 selfloop transitions, 293 changer transitions 827/2735 dead transitions. [2022-01-19 13:06:16,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 2735 transitions, 18821 flow [2022-01-19 13:06:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 369 states. [2022-01-19 13:06:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2022-01-19 13:06:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 68120 transitions. [2022-01-19 13:06:16,661 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.664054122555614 [2022-01-19 13:06:16,662 INFO L72 ComplementDD]: Start complementDD. Operand 369 states and 68120 transitions. [2022-01-19 13:06:16,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 68120 transitions. [2022-01-19 13:06:16,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:06:16,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 369 states and 68120 transitions. [2022-01-19 13:06:16,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 370 states, 369 states have (on average 184.6070460704607) internal successors, (68120), 369 states have internal predecessors, (68120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:06:16,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 370 states, 370 states have (on average 278.0) internal successors, (102860), 370 states have internal predecessors, (102860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:06:16,871 INFO L81 ComplementDD]: Finished complementDD. Result has 370 states, 370 states have (on average 278.0) internal successors, (102860), 370 states have internal predecessors, (102860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:06:16,871 INFO L186 Difference]: Start difference. First operand has 362 places, 314 transitions, 1215 flow. Second operand 369 states and 68120 transitions. [2022-01-19 13:06:16,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 2735 transitions, 18821 flow [2022-01-19 13:06:21,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 2735 transitions, 16804 flow, removed 1006 selfloop flow, removed 12 redundant places. [2022-01-19 13:06:21,666 INFO L242 Difference]: Finished difference. Result has 1065 places, 631 transitions, 4821 flow [2022-01-19 13:06:21,666 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=369, PETRI_FLOW=4821, PETRI_PLACES=1065, PETRI_TRANSITIONS=631} [2022-01-19 13:06:21,667 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 816 predicate places. [2022-01-19 13:06:21,667 INFO L470 AbstractCegarLoop]: Abstraction has has 1065 places, 631 transitions, 4821 flow [2022-01-19 13:06:21,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 180.3235294117647) internal successors, (6131), 34 states have internal predecessors, (6131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:06:21,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:06:21,668 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] [2022-01-19 13:06:21,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 13:06:21,668 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:06:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:06:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1582952148, now seen corresponding path program 2 times [2022-01-19 13:06:21,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:06:21,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240702287] [2022-01-19 13:06:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:06:21,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:06:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:06:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:06:22,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:06:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240702287] [2022-01-19 13:06:22,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240702287] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:06:22,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:06:22,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-19 13:06:22,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108664959] [2022-01-19 13:06:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:06:22,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 13:06:22,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:06:22,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 13:06:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 13:06:22,206 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 278 [2022-01-19 13:06:22,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1065 places, 631 transitions, 4821 flow. Second operand has 34 states, 34 states have (on average 180.3235294117647) internal successors, (6131), 34 states have internal predecessors, (6131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:06:22,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:06:22,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 278 [2022-01-19 13:06:22,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand