/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:49:36,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:49:36,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:49:36,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:49:36,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:49:36,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:49:36,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:49:36,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:49:36,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:49:36,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:49:36,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:49:36,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:49:36,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:49:36,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:49:36,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:49:36,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:49:36,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:49:36,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:49:36,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:49:36,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:49:36,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:49:36,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:49:36,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:49:36,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:49:36,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:49:36,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:49:36,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:49:36,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:49:36,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:49:36,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:49:36,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:49:36,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:49:36,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:49:36,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:49:36,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:49:36,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:49:36,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:49:36,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:49:36,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:49:36,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:49:36,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:49:36,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 00:49:36,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:49:36,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:49:36,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:49:36,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:49:36,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:49:36,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:49:36,790 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:49:36,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:49:36,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:49:36,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:49:36,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:49:36,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:49:36,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:49:36,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:49:36,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:49:36,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:49:36,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:49:36,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:49:36,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:49:36,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:49:36,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:49:36,795 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:49:36,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:49:36,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 00:49:36,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:49:36,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:49:36,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:49:36,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:49:36,992 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:49:36,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-01-19 00:49:37,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecfbc028/4349fbc9c4cb4bfdb02a84adaadbf90c/FLAGc35ef3aaf [2022-01-19 00:49:37,415 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:49:37,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-trans.wvr.c [2022-01-19 00:49:37,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecfbc028/4349fbc9c4cb4bfdb02a84adaadbf90c/FLAGc35ef3aaf [2022-01-19 00:49:37,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecfbc028/4349fbc9c4cb4bfdb02a84adaadbf90c [2022-01-19 00:49:37,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:49:37,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:49:37,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:49:37,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:49:37,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:49:37,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1469aa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37, skipping insertion in model container [2022-01-19 00:49:37,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:49:37,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:49:37,676 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-nzb-file-trans.wvr.c[6450,6463] [2022-01-19 00:49:37,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:49:37,685 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:49:37,723 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-nzb-file-trans.wvr.c[6450,6463] [2022-01-19 00:49:37,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:49:37,734 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:49:37,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37 WrapperNode [2022-01-19 00:49:37,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:49:37,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:49:37,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:49:37,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:49:37,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,796 INFO L137 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 646 [2022-01-19 00:49:37,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:49:37,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:49:37,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:49:37,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:49:37,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:49:37,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:49:37,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:49:37,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:49:37,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (1/1) ... [2022-01-19 00:49:37,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:49:37,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:49:37,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:49:37,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:49:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:49:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:49:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:49:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 00:49:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:49:37,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:49:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:49:37,903 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:49:38,030 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:49:38,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:49:38,642 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:49:38,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:49:38,651 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 00:49:38,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:49:38 BoogieIcfgContainer [2022-01-19 00:49:38,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:49:38,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:49:38,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:49:38,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:49:38,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:49:37" (1/3) ... [2022-01-19 00:49:38,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415b9096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:49:38, skipping insertion in model container [2022-01-19 00:49:38,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:37" (2/3) ... [2022-01-19 00:49:38,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415b9096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:49:38, skipping insertion in model container [2022-01-19 00:49:38,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:49:38" (3/3) ... [2022-01-19 00:49:38,660 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2022-01-19 00:49:38,663 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:49:38,663 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:49:38,663 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:49:38,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,744 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 00:49:38,744 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 00:49:38,744 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 00:49:38,744 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 00:49:38,744 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 00:49:38,744 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,745 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 00:49:38,746 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 00:49:38,746 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 00:49:38,746 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 00:49:38,746 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 00:49:38,746 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 00:49:38,746 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 00:49:38,746 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 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,747 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,748 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,749 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 00:49:38,749 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 00:49:38,750 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,750 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,750 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,750 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,750 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 00:49:38,750 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 00:49:38,750 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 00:49:38,750 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 00:49:38,750 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,751 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 00:49:38,751 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 00:49:38,751 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 00:49:38,751 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 00:49:38,751 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 00:49:38,752 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 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,752 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 00:49:38,753 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 00:49:38,753 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 00:49:38,753 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 00:49:38,753 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 00:49:38,753 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 00:49:38,753 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 00:49:38,753 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 00:49:38,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,754 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 00:49:38,754 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 00:49:38,754 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 00:49:38,754 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 00:49:38,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,754 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 00:49:38,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,755 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 00:49:38,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 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 00:49:38,756 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 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,757 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 00:49:38,757 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 00:49:38,757 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 00:49:38,757 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 00:49:38,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,758 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 00:49:38,758 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 00:49:38,758 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 00:49:38,758 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 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,760 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,761 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,762 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 00:49:38,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,762 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 00:49:38,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,763 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 00:49:38,763 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 00:49:38,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,763 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 00:49:38,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,763 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 00:49:38,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,764 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 00:49:38,764 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 00:49:38,764 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 00:49:38,764 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 00:49:38,764 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 00:49:38,764 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 00:49:38,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,764 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,765 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 00:49:38,765 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 00:49:38,765 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 00:49:38,765 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 00:49:38,765 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 00:49:38,765 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 00:49:38,765 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 00:49:38,765 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 00:49:38,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,766 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 00:49:38,766 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 00:49:38,766 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 00:49:38,766 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 00:49:38,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,768 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 00:49:38,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,769 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 00:49:38,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,770 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 00:49:38,770 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 00:49:38,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,772 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,772 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 00:49:38,772 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 00:49:38,772 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 00:49:38,772 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 00:49:38,772 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,772 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,772 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 00:49:38,772 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 00:49:38,772 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 00:49:38,773 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 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,773 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,774 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,775 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,776 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,777 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,778 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,779 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,788 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,794 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,801 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,801 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,801 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,803 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,804 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,806 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,807 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,811 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,816 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,817 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,820 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,821 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,823 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,824 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,825 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,826 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,827 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,831 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,854 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 00:49:38,854 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 00:49:38,854 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,855 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 00:49:38,856 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 00:49:38,856 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 00:49:38,856 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 00:49:38,856 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 00:49:38,856 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 00:49:38,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 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 00:49:38,858 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 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,858 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 00:49:38,858 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 00:49:38,858 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 00:49:38,858 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 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 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 00:49:38,859 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 00:49:38,859 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 00:49:38,859 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 00:49:38,859 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 00:49:38,859 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 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 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 00:49:38,860 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 00:49:38,860 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 00:49:38,860 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 00:49:38,860 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 00:49:38,860 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 00:49:38,860 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 00:49:38,860 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 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,861 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 00:49:38,861 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 00:49:38,861 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 00:49:38,861 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 00:49:38,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,861 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 00:49:38,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,862 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 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 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 00:49:38,863 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 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,863 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 00:49:38,864 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 00:49:38,864 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 00:49:38,864 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 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 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 00:49:38,864 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 00:49:38,864 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 00:49:38,864 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 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,864 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 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 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 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 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 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 00:49:38,866 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 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,866 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 00:49:38,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,867 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 00:49:38,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,867 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 00:49:38,867 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 00:49:38,867 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 00:49:38,867 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 00:49:38,867 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 00:49:38,867 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 00:49:38,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,867 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 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 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,869 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,870 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,870 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,870 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,870 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,870 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,870 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,871 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 00:49:38,871 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 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 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,873 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,874 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 00:49:38,874 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 00:49:38,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 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 00:49:38,875 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 00:49:38,875 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 00:49:38,875 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 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,875 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 00:49:38,875 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 00:49:38,875 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 00:49:38,875 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 00:49:38,875 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,882 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,886 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,888 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,889 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,890 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 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 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 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 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,895 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,895 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,895 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 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 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,896 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 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 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,897 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:38,905 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 00:49:38,940 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:49:38,945 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:49:38,945 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 00:49:38,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 770 places, 851 transitions, 1726 flow [2022-01-19 00:49:39,277 INFO L129 PetriNetUnfolder]: 91/848 cut-off events. [2022-01-19 00:49:39,278 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:49:39,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 848 events. 91/848 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3044 event pairs, 0 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 622. Up to 2 conditions per place. [2022-01-19 00:49:39,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 770 places, 851 transitions, 1726 flow [2022-01-19 00:49:39,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 756 places, 837 transitions, 1692 flow [2022-01-19 00:49:39,495 INFO L129 PetriNetUnfolder]: 89/827 cut-off events. [2022-01-19 00:49:39,496 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:49:39,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:39,497 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:39,497 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1905717660, now seen corresponding path program 1 times [2022-01-19 00:49:39,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:39,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349573110] [2022-01-19 00:49:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:39,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:39,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349573110] [2022-01-19 00:49:39,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349573110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:39,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:39,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 00:49:39,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347584631] [2022-01-19 00:49:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:39,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 00:49:39,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 00:49:39,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 00:49:39,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 807 out of 851 [2022-01-19 00:49:39,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 837 transitions, 1692 flow. Second operand has 2 states, 2 states have (on average 811.5) internal successors, (1623), 2 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:39,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:39,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 807 of 851 [2022-01-19 00:49:39,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:40,081 INFO L129 PetriNetUnfolder]: 54/800 cut-off events. [2022-01-19 00:49:40,081 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-01-19 00:49:40,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 800 events. 54/800 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2980 event pairs, 0 based on Foata normal form. 60/775 useless extension candidates. Maximal degree in co-relation 597. Up to 7 conditions per place. [2022-01-19 00:49:40,097 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 6 selfloop transitions, 0 changer transitions 7/800 dead transitions. [2022-01-19 00:49:40,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 800 transitions, 1630 flow [2022-01-19 00:49:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 00:49:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 00:49:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1657 transitions. [2022-01-19 00:49:40,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9735605170387779 [2022-01-19 00:49:40,113 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1657 transitions. [2022-01-19 00:49:40,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1657 transitions. [2022-01-19 00:49:40,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:40,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1657 transitions. [2022-01-19 00:49:40,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 828.5) internal successors, (1657), 2 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 851.0) internal successors, (2553), 3 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,132 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 851.0) internal successors, (2553), 3 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,134 INFO L186 Difference]: Start difference. First operand has 756 places, 837 transitions, 1692 flow. Second operand 2 states and 1657 transitions. [2022-01-19 00:49:40,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 800 transitions, 1630 flow [2022-01-19 00:49:40,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 800 transitions, 1618 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 00:49:40,153 INFO L242 Difference]: Finished difference. Result has 751 places, 793 transitions, 1592 flow [2022-01-19 00:49:40,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1592, PETRI_PLACES=751, PETRI_TRANSITIONS=793} [2022-01-19 00:49:40,160 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2022-01-19 00:49:40,161 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 793 transitions, 1592 flow [2022-01-19 00:49:40,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 811.5) internal successors, (1623), 2 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,161 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:40,162 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:40,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:49:40,162 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1986224669, now seen corresponding path program 1 times [2022-01-19 00:49:40,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:40,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33287940] [2022-01-19 00:49:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:40,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:40,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:40,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33287940] [2022-01-19 00:49:40,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33287940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:40,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:40,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:40,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129722403] [2022-01-19 00:49:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:40,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:40,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:40,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:40,334 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 00:49:40,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 793 transitions, 1592 flow. Second operand has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:40,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:40,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 00:49:40,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:40,995 INFO L129 PetriNetUnfolder]: 352/3450 cut-off events. [2022-01-19 00:49:40,995 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-01-19 00:49:41,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 3450 events. 352/3450 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 30838 event pairs, 96 based on Foata normal form. 0/3062 useless extension candidates. Maximal degree in co-relation 3767. Up to 185 conditions per place. [2022-01-19 00:49:41,071 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 33 selfloop transitions, 2 changer transitions 0/808 dead transitions. [2022-01-19 00:49:41,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 808 transitions, 1697 flow [2022-01-19 00:49:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 00:49:41,076 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 00:49:41,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 00:49:41,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 00:49:41,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:41,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 00:49:41,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:41,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:41,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:41,085 INFO L186 Difference]: Start difference. First operand has 751 places, 793 transitions, 1592 flow. Second operand 3 states and 2416 transitions. [2022-01-19 00:49:41,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 808 transitions, 1697 flow [2022-01-19 00:49:41,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 808 transitions, 1697 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:49:41,095 INFO L242 Difference]: Finished difference. Result has 748 places, 795 transitions, 1612 flow [2022-01-19 00:49:41,096 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=748, PETRI_TRANSITIONS=795} [2022-01-19 00:49:41,097 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -8 predicate places. [2022-01-19 00:49:41,097 INFO L470 AbstractCegarLoop]: Abstraction has has 748 places, 795 transitions, 1612 flow [2022-01-19 00:49:41,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:41,098 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:41,098 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:41,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:49:41,098 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1365782035, now seen corresponding path program 2 times [2022-01-19 00:49:41,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:41,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188217970] [2022-01-19 00:49:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:41,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:41,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:41,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188217970] [2022-01-19 00:49:41,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188217970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:41,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:41,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:41,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402962681] [2022-01-19 00:49:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:41,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:41,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:41,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:41,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 00:49:41,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 795 transitions, 1612 flow. Second operand has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:41,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:41,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 00:49:41,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:41,967 INFO L129 PetriNetUnfolder]: 378/3800 cut-off events. [2022-01-19 00:49:41,967 INFO L130 PetriNetUnfolder]: For 112/121 co-relation queries the response was YES. [2022-01-19 00:49:42,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 3800 events. 378/3800 cut-off events. For 112/121 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 34195 event pairs, 98 based on Foata normal form. 6/3425 useless extension candidates. Maximal degree in co-relation 4202. Up to 201 conditions per place. [2022-01-19 00:49:42,037 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 33 selfloop transitions, 4 changer transitions 0/810 dead transitions. [2022-01-19 00:49:42,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 810 transitions, 1725 flow [2022-01-19 00:49:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 00:49:42,040 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 00:49:42,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 00:49:42,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 00:49:42,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:42,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 00:49:42,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:42,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:42,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:42,050 INFO L186 Difference]: Start difference. First operand has 748 places, 795 transitions, 1612 flow. Second operand 3 states and 2416 transitions. [2022-01-19 00:49:42,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 810 transitions, 1725 flow [2022-01-19 00:49:42,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 810 transitions, 1723 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:42,061 INFO L242 Difference]: Finished difference. Result has 751 places, 797 transitions, 1642 flow [2022-01-19 00:49:42,062 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=751, PETRI_TRANSITIONS=797} [2022-01-19 00:49:42,063 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2022-01-19 00:49:42,064 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 797 transitions, 1642 flow [2022-01-19 00:49:42,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:42,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:42,065 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:42,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:49:42,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash 360113765, now seen corresponding path program 1 times [2022-01-19 00:49:42,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:42,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969337478] [2022-01-19 00:49:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:42,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:42,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:42,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969337478] [2022-01-19 00:49:42,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969337478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:42,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:42,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:42,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740277853] [2022-01-19 00:49:42,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:42,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:42,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:42,145 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 00:49:42,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 797 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:42,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:42,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 00:49:42,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:43,304 INFO L129 PetriNetUnfolder]: 789/6867 cut-off events. [2022-01-19 00:49:43,304 INFO L130 PetriNetUnfolder]: For 396/464 co-relation queries the response was YES. [2022-01-19 00:49:43,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7567 conditions, 6867 events. 789/6867 cut-off events. For 396/464 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 70955 event pairs, 210 based on Foata normal form. 4/6042 useless extension candidates. Maximal degree in co-relation 7561. Up to 390 conditions per place. [2022-01-19 00:49:43,398 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 32 selfloop transitions, 5 changer transitions 0/812 dead transitions. [2022-01-19 00:49:43,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 812 transitions, 1757 flow [2022-01-19 00:49:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2022-01-19 00:49:43,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-01-19 00:49:43,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2022-01-19 00:49:43,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2022-01-19 00:49:43,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:43,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2022-01-19 00:49:43,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.0) internal successors, (2415), 3 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:43,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:43,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:43,412 INFO L186 Difference]: Start difference. First operand has 751 places, 797 transitions, 1642 flow. Second operand 3 states and 2415 transitions. [2022-01-19 00:49:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 812 transitions, 1757 flow [2022-01-19 00:49:43,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 812 transitions, 1745 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:43,424 INFO L242 Difference]: Finished difference. Result has 753 places, 800 transitions, 1675 flow [2022-01-19 00:49:43,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=753, PETRI_TRANSITIONS=800} [2022-01-19 00:49:43,426 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -3 predicate places. [2022-01-19 00:49:43,426 INFO L470 AbstractCegarLoop]: Abstraction has has 753 places, 800 transitions, 1675 flow [2022-01-19 00:49:43,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:43,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:43,427 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:43,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:49:43,428 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1778547265, now seen corresponding path program 2 times [2022-01-19 00:49:43,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:43,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885056185] [2022-01-19 00:49:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:43,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:43,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885056185] [2022-01-19 00:49:43,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885056185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:43,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:43,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:43,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230534762] [2022-01-19 00:49:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:43,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:43,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:43,475 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 00:49:43,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 800 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:43,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:43,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 00:49:43,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:44,592 INFO L129 PetriNetUnfolder]: 771/6975 cut-off events. [2022-01-19 00:49:44,592 INFO L130 PetriNetUnfolder]: For 566/636 co-relation queries the response was YES. [2022-01-19 00:49:44,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7788 conditions, 6975 events. 771/6975 cut-off events. For 566/636 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 72272 event pairs, 211 based on Foata normal form. 9/6203 useless extension candidates. Maximal degree in co-relation 7781. Up to 405 conditions per place. [2022-01-19 00:49:44,673 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 37 selfloop transitions, 3 changer transitions 0/815 dead transitions. [2022-01-19 00:49:44,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 815 transitions, 1801 flow [2022-01-19 00:49:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2022-01-19 00:49:44,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-01-19 00:49:44,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2022-01-19 00:49:44,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2022-01-19 00:49:44,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:44,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2022-01-19 00:49:44,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.0) internal successors, (2415), 3 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:44,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:44,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:44,690 INFO L186 Difference]: Start difference. First operand has 753 places, 800 transitions, 1675 flow. Second operand 3 states and 2415 transitions. [2022-01-19 00:49:44,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 815 transitions, 1801 flow [2022-01-19 00:49:44,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 815 transitions, 1791 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:44,700 INFO L242 Difference]: Finished difference. Result has 755 places, 803 transitions, 1707 flow [2022-01-19 00:49:44,701 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1707, PETRI_PLACES=755, PETRI_TRANSITIONS=803} [2022-01-19 00:49:44,701 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -1 predicate places. [2022-01-19 00:49:44,701 INFO L470 AbstractCegarLoop]: Abstraction has has 755 places, 803 transitions, 1707 flow [2022-01-19 00:49:44,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:44,702 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:44,702 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:44,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:49:44,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1706386129, now seen corresponding path program 1 times [2022-01-19 00:49:44,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:44,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424840222] [2022-01-19 00:49:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:44,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:44,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:44,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424840222] [2022-01-19 00:49:44,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424840222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:44,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:44,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:44,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038141773] [2022-01-19 00:49:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:44,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:44,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:44,746 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 00:49:44,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 803 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:44,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:44,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 00:49:44,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:45,452 INFO L129 PetriNetUnfolder]: 296/3239 cut-off events. [2022-01-19 00:49:45,452 INFO L130 PetriNetUnfolder]: For 432/539 co-relation queries the response was YES. [2022-01-19 00:49:45,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 3239 events. 296/3239 cut-off events. For 432/539 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 29008 event pairs, 71 based on Foata normal form. 10/2970 useless extension candidates. Maximal degree in co-relation 3759. Up to 185 conditions per place. [2022-01-19 00:49:45,533 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 35 selfloop transitions, 4 changer transitions 0/818 dead transitions. [2022-01-19 00:49:45,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 818 transitions, 1828 flow [2022-01-19 00:49:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 00:49:45,537 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 00:49:45,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 00:49:45,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 00:49:45,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:45,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 00:49:45,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,544 INFO L186 Difference]: Start difference. First operand has 755 places, 803 transitions, 1707 flow. Second operand 3 states and 2416 transitions. [2022-01-19 00:49:45,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 818 transitions, 1828 flow [2022-01-19 00:49:45,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 818 transitions, 1819 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:45,554 INFO L242 Difference]: Finished difference. Result has 758 places, 805 transitions, 1738 flow [2022-01-19 00:49:45,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1738, PETRI_PLACES=758, PETRI_TRANSITIONS=805} [2022-01-19 00:49:45,555 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 2 predicate places. [2022-01-19 00:49:45,555 INFO L470 AbstractCegarLoop]: Abstraction has has 758 places, 805 transitions, 1738 flow [2022-01-19 00:49:45,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:45,556 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:45,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:49:45,556 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2139301649, now seen corresponding path program 2 times [2022-01-19 00:49:45,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:45,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608708655] [2022-01-19 00:49:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:45,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:45,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:45,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608708655] [2022-01-19 00:49:45,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608708655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:45,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:45,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:45,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923148284] [2022-01-19 00:49:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:45,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:45,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:45,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2022-01-19 00:49:45,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 805 transitions, 1738 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:45,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2022-01-19 00:49:45,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:46,314 INFO L129 PetriNetUnfolder]: 259/2956 cut-off events. [2022-01-19 00:49:46,315 INFO L130 PetriNetUnfolder]: For 637/733 co-relation queries the response was YES. [2022-01-19 00:49:46,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 2956 events. 259/2956 cut-off events. For 637/733 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 25755 event pairs, 74 based on Foata normal form. 8/2722 useless extension candidates. Maximal degree in co-relation 3542. Up to 190 conditions per place. [2022-01-19 00:49:46,401 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 35 selfloop transitions, 6 changer transitions 0/818 dead transitions. [2022-01-19 00:49:46,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 818 transitions, 1857 flow [2022-01-19 00:49:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2022-01-19 00:49:46,406 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2022-01-19 00:49:46,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2022-01-19 00:49:46,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2022-01-19 00:49:46,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:46,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2022-01-19 00:49:46,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,413 INFO L186 Difference]: Start difference. First operand has 758 places, 805 transitions, 1738 flow. Second operand 3 states and 2416 transitions. [2022-01-19 00:49:46,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 818 transitions, 1857 flow [2022-01-19 00:49:46,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 818 transitions, 1853 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:46,426 INFO L242 Difference]: Finished difference. Result has 761 places, 805 transitions, 1776 flow [2022-01-19 00:49:46,427 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=761, PETRI_TRANSITIONS=805} [2022-01-19 00:49:46,428 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 5 predicate places. [2022-01-19 00:49:46,428 INFO L470 AbstractCegarLoop]: Abstraction has has 761 places, 805 transitions, 1776 flow [2022-01-19 00:49:46,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,429 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:46,429 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:46,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:49:46,429 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1541370568, now seen corresponding path program 1 times [2022-01-19 00:49:46,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:46,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330841704] [2022-01-19 00:49:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:46,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:46,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:46,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330841704] [2022-01-19 00:49:46,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330841704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:46,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:46,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:49:46,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142496509] [2022-01-19 00:49:46,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:46,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:46,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:49:46,516 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 774 out of 851 [2022-01-19 00:49:46,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 805 transitions, 1776 flow. Second operand has 5 states, 5 states have (on average 779.4) internal successors, (3897), 5 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:46,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 774 of 851 [2022-01-19 00:49:46,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:46,823 INFO L129 PetriNetUnfolder]: 54/1036 cut-off events. [2022-01-19 00:49:46,823 INFO L130 PetriNetUnfolder]: For 141/179 co-relation queries the response was YES. [2022-01-19 00:49:46,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 1036 events. 54/1036 cut-off events. For 141/179 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5277 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1196. Up to 55 conditions per place. [2022-01-19 00:49:46,849 INFO L132 encePairwiseOnDemand]: 836/851 looper letters, 39 selfloop transitions, 12 changer transitions 0/817 dead transitions. [2022-01-19 00:49:46,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 817 transitions, 1902 flow [2022-01-19 00:49:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:49:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:49:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3924 transitions. [2022-01-19 00:49:46,854 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9222091656874265 [2022-01-19 00:49:46,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3924 transitions. [2022-01-19 00:49:46,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3924 transitions. [2022-01-19 00:49:46,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:46,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3924 transitions. [2022-01-19 00:49:46,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 784.8) internal successors, (3924), 5 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,865 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,865 INFO L186 Difference]: Start difference. First operand has 761 places, 805 transitions, 1776 flow. Second operand 5 states and 3924 transitions. [2022-01-19 00:49:46,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 817 transitions, 1902 flow [2022-01-19 00:49:46,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 763 places, 817 transitions, 1886 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:46,876 INFO L242 Difference]: Finished difference. Result has 764 places, 808 transitions, 1808 flow [2022-01-19 00:49:46,876 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=764, PETRI_TRANSITIONS=808} [2022-01-19 00:49:46,877 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 8 predicate places. [2022-01-19 00:49:46,877 INFO L470 AbstractCegarLoop]: Abstraction has has 764 places, 808 transitions, 1808 flow [2022-01-19 00:49:46,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 779.4) internal successors, (3897), 5 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:46,878 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:46,878 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:46,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:49:46,878 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash -502605305, now seen corresponding path program 1 times [2022-01-19 00:49:46,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:46,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861170110] [2022-01-19 00:49:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:46,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:49:46,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:46,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861170110] [2022-01-19 00:49:46,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861170110] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:49:46,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926127710] [2022-01-19 00:49:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:46,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:49:46,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:49:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 00:49:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:47,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 00:49:47,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:49:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:49:47,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:49:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 00:49:47,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926127710] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:49:47,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:49:47,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-01-19 00:49:47,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488028693] [2022-01-19 00:49:47,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:49:47,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 00:49:47,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:47,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 00:49:47,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-19 00:49:47,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2022-01-19 00:49:47,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 808 transitions, 1808 flow. Second operand has 15 states, 15 states have (on average 775.0666666666667) internal successors, (11626), 15 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:47,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:47,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2022-01-19 00:49:47,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:48,353 INFO L129 PetriNetUnfolder]: 54/1060 cut-off events. [2022-01-19 00:49:48,353 INFO L130 PetriNetUnfolder]: For 133/170 co-relation queries the response was YES. [2022-01-19 00:49:48,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 1060 events. 54/1060 cut-off events. For 133/170 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5260 event pairs, 0 based on Foata normal form. 6/987 useless extension candidates. Maximal degree in co-relation 1260. Up to 46 conditions per place. [2022-01-19 00:49:48,380 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 42 selfloop transitions, 33 changer transitions 0/838 dead transitions. [2022-01-19 00:49:48,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 838 transitions, 2024 flow [2022-01-19 00:49:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:49:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:49:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8562 transitions. [2022-01-19 00:49:48,390 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9146458711676103 [2022-01-19 00:49:48,390 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8562 transitions. [2022-01-19 00:49:48,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8562 transitions. [2022-01-19 00:49:48,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:48,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8562 transitions. [2022-01-19 00:49:48,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 778.3636363636364) internal successors, (8562), 11 states have internal predecessors, (8562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,413 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,413 INFO L186 Difference]: Start difference. First operand has 764 places, 808 transitions, 1808 flow. Second operand 11 states and 8562 transitions. [2022-01-19 00:49:48,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 838 transitions, 2024 flow [2022-01-19 00:49:48,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 771 places, 838 transitions, 2006 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 00:49:48,424 INFO L242 Difference]: Finished difference. Result has 774 places, 826 transitions, 1957 flow [2022-01-19 00:49:48,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1957, PETRI_PLACES=774, PETRI_TRANSITIONS=826} [2022-01-19 00:49:48,425 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 18 predicate places. [2022-01-19 00:49:48,425 INFO L470 AbstractCegarLoop]: Abstraction has has 774 places, 826 transitions, 1957 flow [2022-01-19 00:49:48,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 775.0666666666667) internal successors, (11626), 15 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:48,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:48,427 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:48,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-19 00:49:48,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:48,644 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1742006581, now seen corresponding path program 2 times [2022-01-19 00:49:48,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:48,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049659897] [2022-01-19 00:49:48,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:48,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 00:49:48,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049659897] [2022-01-19 00:49:48,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049659897] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:49:48,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290364914] [2022-01-19 00:49:48,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 00:49:48,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:49:48,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:49:48,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 00:49:48,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 00:49:48,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:49:48,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 00:49:48,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:49:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-19 00:49:49,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 00:49:49,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290364914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:49,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 00:49:49,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 00:49:49,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897581768] [2022-01-19 00:49:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:49,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:49,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 00:49:49,257 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2022-01-19 00:49:49,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 826 transitions, 1957 flow. Second operand has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:49,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:49,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2022-01-19 00:49:49,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:50,858 INFO L129 PetriNetUnfolder]: 1481/7153 cut-off events. [2022-01-19 00:49:50,858 INFO L130 PetriNetUnfolder]: For 3573/3940 co-relation queries the response was YES. [2022-01-19 00:49:50,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11183 conditions, 7153 events. 1481/7153 cut-off events. For 3573/3940 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 75410 event pairs, 700 based on Foata normal form. 4/6534 useless extension candidates. Maximal degree in co-relation 11169. Up to 1335 conditions per place. [2022-01-19 00:49:51,020 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 111 selfloop transitions, 23 changer transitions 2/896 dead transitions. [2022-01-19 00:49:51,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 896 transitions, 2413 flow [2022-01-19 00:49:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:49:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:49:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5414 transitions. [2022-01-19 00:49:51,027 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088467349336915 [2022-01-19 00:49:51,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5414 transitions. [2022-01-19 00:49:51,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5414 transitions. [2022-01-19 00:49:51,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:51,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5414 transitions. [2022-01-19 00:49:51,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 773.4285714285714) internal successors, (5414), 7 states have internal predecessors, (5414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:51,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:51,039 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:51,039 INFO L186 Difference]: Start difference. First operand has 774 places, 826 transitions, 1957 flow. Second operand 7 states and 5414 transitions. [2022-01-19 00:49:51,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 896 transitions, 2413 flow [2022-01-19 00:49:51,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 896 transitions, 2388 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-01-19 00:49:51,051 INFO L242 Difference]: Finished difference. Result has 780 places, 838 transitions, 2035 flow [2022-01-19 00:49:51,052 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2035, PETRI_PLACES=780, PETRI_TRANSITIONS=838} [2022-01-19 00:49:51,052 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 24 predicate places. [2022-01-19 00:49:51,052 INFO L470 AbstractCegarLoop]: Abstraction has has 780 places, 838 transitions, 2035 flow [2022-01-19 00:49:51,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:51,053 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:51,053 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:51,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 00:49:51,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 00:49:51,267 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1654571657, now seen corresponding path program 3 times [2022-01-19 00:49:51,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:51,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389204166] [2022-01-19 00:49:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:51,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 00:49:51,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:51,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389204166] [2022-01-19 00:49:51,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389204166] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:49:51,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612364833] [2022-01-19 00:49:51,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 00:49:51,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:49:51,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:49:51,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 00:49:51,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-19 00:49:51,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:49:51,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 00:49:51,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:49:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-19 00:49:51,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 00:49:51,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612364833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:51,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 00:49:51,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 00:49:51,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21070670] [2022-01-19 00:49:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:51,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:49:51,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:49:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 00:49:51,811 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2022-01-19 00:49:51,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 838 transitions, 2035 flow. Second operand has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:51,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:51,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2022-01-19 00:49:51,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:53,584 INFO L129 PetriNetUnfolder]: 1489/7547 cut-off events. [2022-01-19 00:49:53,585 INFO L130 PetriNetUnfolder]: For 5189/5647 co-relation queries the response was YES. [2022-01-19 00:49:53,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 7547 events. 1489/7547 cut-off events. For 5189/5647 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 80398 event pairs, 369 based on Foata normal form. 81/7141 useless extension candidates. Maximal degree in co-relation 11652. Up to 855 conditions per place. [2022-01-19 00:49:53,712 INFO L132 encePairwiseOnDemand]: 824/851 looper letters, 133 selfloop transitions, 43 changer transitions 1/937 dead transitions. [2022-01-19 00:49:53,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 937 transitions, 2763 flow [2022-01-19 00:49:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:49:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:49:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6949 transitions. [2022-01-19 00:49:53,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072986029507769 [2022-01-19 00:49:53,720 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6949 transitions. [2022-01-19 00:49:53,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6949 transitions. [2022-01-19 00:49:53,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:53,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6949 transitions. [2022-01-19 00:49:53,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 772.1111111111111) internal successors, (6949), 9 states have internal predecessors, (6949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:53,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:53,734 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:53,734 INFO L186 Difference]: Start difference. First operand has 780 places, 838 transitions, 2035 flow. Second operand 9 states and 6949 transitions. [2022-01-19 00:49:53,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 937 transitions, 2763 flow [2022-01-19 00:49:53,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 937 transitions, 2763 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:49:53,748 INFO L242 Difference]: Finished difference. Result has 792 places, 864 transitions, 2357 flow [2022-01-19 00:49:53,749 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2357, PETRI_PLACES=792, PETRI_TRANSITIONS=864} [2022-01-19 00:49:53,749 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 36 predicate places. [2022-01-19 00:49:53,749 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 864 transitions, 2357 flow [2022-01-19 00:49:53,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:53,750 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:53,750 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:53,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 00:49:53,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:53,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash -526497641, now seen corresponding path program 4 times [2022-01-19 00:49:53,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064668511] [2022-01-19 00:49:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:53,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 00:49:54,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:54,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064668511] [2022-01-19 00:49:54,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064668511] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:49:54,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359953181] [2022-01-19 00:49:54,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 00:49:54,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:49:54,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:49:54,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 00:49:54,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 00:49:54,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:49:54,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 00:49:54,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:49:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 00:49:54,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:49:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 00:49:54,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359953181] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:49:54,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:49:54,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-01-19 00:49:54,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989809763] [2022-01-19 00:49:54,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:49:54,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 00:49:54,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:54,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 00:49:54,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-01-19 00:49:54,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2022-01-19 00:49:54,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 864 transitions, 2357 flow. Second operand has 22 states, 22 states have (on average 774.6818181818181) internal successors, (17043), 22 states have internal predecessors, (17043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:54,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2022-01-19 00:49:54,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:55,648 INFO L129 PetriNetUnfolder]: 142/1959 cut-off events. [2022-01-19 00:49:55,649 INFO L130 PetriNetUnfolder]: For 1243/1393 co-relation queries the response was YES. [2022-01-19 00:49:55,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1959 events. 142/1959 cut-off events. For 1243/1393 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14170 event pairs, 9 based on Foata normal form. 6/1839 useless extension candidates. Maximal degree in co-relation 2813. Up to 75 conditions per place. [2022-01-19 00:49:55,701 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 54 selfloop transitions, 51 changer transitions 0/906 dead transitions. [2022-01-19 00:49:55,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 906 transitions, 2735 flow [2022-01-19 00:49:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:49:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:49:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 13218 transitions. [2022-01-19 00:49:55,714 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9136655837423101 [2022-01-19 00:49:55,714 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 13218 transitions. [2022-01-19 00:49:55,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 13218 transitions. [2022-01-19 00:49:55,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:55,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 13218 transitions. [2022-01-19 00:49:55,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 777.5294117647059) internal successors, (13218), 17 states have internal predecessors, (13218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 851.0) internal successors, (15318), 18 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,735 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 851.0) internal successors, (15318), 18 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,735 INFO L186 Difference]: Start difference. First operand has 792 places, 864 transitions, 2357 flow. Second operand 17 states and 13218 transitions. [2022-01-19 00:49:55,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 906 transitions, 2735 flow [2022-01-19 00:49:55,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 906 transitions, 2729 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-01-19 00:49:55,749 INFO L242 Difference]: Finished difference. Result has 811 places, 885 transitions, 2614 flow [2022-01-19 00:49:55,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2614, PETRI_PLACES=811, PETRI_TRANSITIONS=885} [2022-01-19 00:49:55,750 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 55 predicate places. [2022-01-19 00:49:55,750 INFO L470 AbstractCegarLoop]: Abstraction has has 811 places, 885 transitions, 2614 flow [2022-01-19 00:49:55,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 774.6818181818181) internal successors, (17043), 22 states have internal predecessors, (17043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,751 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:55,752 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:55,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 00:49:55,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:49:55,968 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash 862760163, now seen corresponding path program 5 times [2022-01-19 00:49:55,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762276366] [2022-01-19 00:49:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:55,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:49:56,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:56,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762276366] [2022-01-19 00:49:56,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762276366] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:56,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:56,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:56,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940275765] [2022-01-19 00:49:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:56,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:56,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:56,055 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 00:49:56,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 885 transitions, 2614 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:56,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 00:49:56,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:57,496 INFO L129 PetriNetUnfolder]: 584/6149 cut-off events. [2022-01-19 00:49:57,496 INFO L130 PetriNetUnfolder]: For 1859/2037 co-relation queries the response was YES. [2022-01-19 00:49:57,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 6149 events. 584/6149 cut-off events. For 1859/2037 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 61001 event pairs, 103 based on Foata normal form. 2/5625 useless extension candidates. Maximal degree in co-relation 8004. Up to 300 conditions per place. [2022-01-19 00:49:57,592 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 28 selfloop transitions, 4 changer transitions 0/894 dead transitions. [2022-01-19 00:49:57,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 894 transitions, 2700 flow [2022-01-19 00:49:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2403 transitions. [2022-01-19 00:49:57,595 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412455934195064 [2022-01-19 00:49:57,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2403 transitions. [2022-01-19 00:49:57,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2403 transitions. [2022-01-19 00:49:57,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:57,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2403 transitions. [2022-01-19 00:49:57,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 801.0) internal successors, (2403), 3 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,599 INFO L186 Difference]: Start difference. First operand has 811 places, 885 transitions, 2614 flow. Second operand 3 states and 2403 transitions. [2022-01-19 00:49:57,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 894 transitions, 2700 flow [2022-01-19 00:49:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 894 transitions, 2633 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-01-19 00:49:57,613 INFO L242 Difference]: Finished difference. Result has 806 places, 886 transitions, 2565 flow [2022-01-19 00:49:57,614 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2565, PETRI_PLACES=806, PETRI_TRANSITIONS=886} [2022-01-19 00:49:57,615 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 50 predicate places. [2022-01-19 00:49:57,615 INFO L470 AbstractCegarLoop]: Abstraction has has 806 places, 886 transitions, 2565 flow [2022-01-19 00:49:57,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,615 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:57,615 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:57,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:49:57,615 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1570533334, now seen corresponding path program 1 times [2022-01-19 00:49:57,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171407111] [2022-01-19 00:49:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:57,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:49:57,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171407111] [2022-01-19 00:49:57,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171407111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:57,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:57,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:57,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488431539] [2022-01-19 00:49:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:57,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:57,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:57,676 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 00:49:57,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 886 transitions, 2565 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:57,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 00:49:57,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:00,168 INFO L129 PetriNetUnfolder]: 629/8651 cut-off events. [2022-01-19 00:50:00,168 INFO L130 PetriNetUnfolder]: For 2559/2857 co-relation queries the response was YES. [2022-01-19 00:50:00,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11007 conditions, 8651 events. 629/8651 cut-off events. For 2559/2857 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 87955 event pairs, 38 based on Foata normal form. 0/7969 useless extension candidates. Maximal degree in co-relation 10980. Up to 179 conditions per place. [2022-01-19 00:50:00,350 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 29 selfloop transitions, 4 changer transitions 0/896 dead transitions. [2022-01-19 00:50:00,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 896 transitions, 2656 flow [2022-01-19 00:50:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:50:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:50:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2404 transitions. [2022-01-19 00:50:00,354 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416372894633764 [2022-01-19 00:50:00,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2404 transitions. [2022-01-19 00:50:00,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2404 transitions. [2022-01-19 00:50:00,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:00,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2404 transitions. [2022-01-19 00:50:00,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 801.3333333333334) internal successors, (2404), 3 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,358 INFO L186 Difference]: Start difference. First operand has 806 places, 886 transitions, 2565 flow. Second operand 3 states and 2404 transitions. [2022-01-19 00:50:00,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 896 transitions, 2656 flow [2022-01-19 00:50:00,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 896 transitions, 2652 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:50:00,383 INFO L242 Difference]: Finished difference. Result has 808 places, 887 transitions, 2579 flow [2022-01-19 00:50:00,384 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2561, PETRI_DIFFERENCE_MINUEND_PLACES=805, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2579, PETRI_PLACES=808, PETRI_TRANSITIONS=887} [2022-01-19 00:50:00,384 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 52 predicate places. [2022-01-19 00:50:00,385 INFO L470 AbstractCegarLoop]: Abstraction has has 808 places, 887 transitions, 2579 flow [2022-01-19 00:50:00,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,385 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:00,385 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:00,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:50:00,385 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1945096870, now seen corresponding path program 1 times [2022-01-19 00:50:00,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904480836] [2022-01-19 00:50:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:00,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:50:00,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:00,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904480836] [2022-01-19 00:50:00,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904480836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:00,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:00,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:50:00,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173144826] [2022-01-19 00:50:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:00,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:50:00,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:50:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:50:00,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2022-01-19 00:50:00,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 887 transitions, 2579 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:00,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2022-01-19 00:50:00,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:03,029 INFO L129 PetriNetUnfolder]: 1137/9273 cut-off events. [2022-01-19 00:50:03,029 INFO L130 PetriNetUnfolder]: For 2029/2488 co-relation queries the response was YES. [2022-01-19 00:50:03,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11478 conditions, 9273 events. 1137/9273 cut-off events. For 2029/2488 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 101223 event pairs, 380 based on Foata normal form. 1/8072 useless extension candidates. Maximal degree in co-relation 11450. Up to 952 conditions per place. [2022-01-19 00:50:03,271 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 27 selfloop transitions, 4 changer transitions 0/895 dead transitions. [2022-01-19 00:50:03,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 895 transitions, 2660 flow [2022-01-19 00:50:03,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:50:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:50:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2402 transitions. [2022-01-19 00:50:03,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9408538973756365 [2022-01-19 00:50:03,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2402 transitions. [2022-01-19 00:50:03,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2402 transitions. [2022-01-19 00:50:03,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:03,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2402 transitions. [2022-01-19 00:50:03,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 800.6666666666666) internal successors, (2402), 3 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,279 INFO L186 Difference]: Start difference. First operand has 808 places, 887 transitions, 2579 flow. Second operand 3 states and 2402 transitions. [2022-01-19 00:50:03,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 895 transitions, 2660 flow [2022-01-19 00:50:03,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 895 transitions, 2656 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:50:03,296 INFO L242 Difference]: Finished difference. Result has 810 places, 888 transitions, 2593 flow [2022-01-19 00:50:03,297 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2593, PETRI_PLACES=810, PETRI_TRANSITIONS=888} [2022-01-19 00:50:03,297 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 54 predicate places. [2022-01-19 00:50:03,297 INFO L470 AbstractCegarLoop]: Abstraction has has 810 places, 888 transitions, 2593 flow [2022-01-19 00:50:03,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,298 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:03,298 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:03,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:50:03,298 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1735256126, now seen corresponding path program 1 times [2022-01-19 00:50:03,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:03,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135709439] [2022-01-19 00:50:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:03,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:50:03,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135709439] [2022-01-19 00:50:03,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135709439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:03,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:03,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:50:03,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475536636] [2022-01-19 00:50:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:03,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:50:03,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:50:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:50:03,429 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:50:03,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 888 transitions, 2593 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:03,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:50:03,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:14,563 INFO L129 PetriNetUnfolder]: 8778/52330 cut-off events. [2022-01-19 00:50:14,563 INFO L130 PetriNetUnfolder]: For 37937/44699 co-relation queries the response was YES. [2022-01-19 00:50:15,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81506 conditions, 52330 events. 8778/52330 cut-off events. For 37937/44699 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 760276 event pairs, 3260 based on Foata normal form. 310/49102 useless extension candidates. Maximal degree in co-relation 81477. Up to 4529 conditions per place. [2022-01-19 00:50:15,520 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 214 selfloop transitions, 21 changer transitions 2/1034 dead transitions. [2022-01-19 00:50:15,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 1034 transitions, 3682 flow [2022-01-19 00:50:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:50:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:50:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5432 transitions. [2022-01-19 00:50:15,524 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9118683901292597 [2022-01-19 00:50:15,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5432 transitions. [2022-01-19 00:50:15,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5432 transitions. [2022-01-19 00:50:15,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:15,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5432 transitions. [2022-01-19 00:50:15,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 776.0) internal successors, (5432), 7 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,532 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,532 INFO L186 Difference]: Start difference. First operand has 810 places, 888 transitions, 2593 flow. Second operand 7 states and 5432 transitions. [2022-01-19 00:50:15,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 1034 transitions, 3682 flow [2022-01-19 00:50:15,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 1034 transitions, 3678 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:50:15,653 INFO L242 Difference]: Finished difference. Result has 820 places, 910 transitions, 2877 flow [2022-01-19 00:50:15,654 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2589, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2877, PETRI_PLACES=820, PETRI_TRANSITIONS=910} [2022-01-19 00:50:15,654 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 64 predicate places. [2022-01-19 00:50:15,654 INFO L470 AbstractCegarLoop]: Abstraction has has 820 places, 910 transitions, 2877 flow [2022-01-19 00:50:15,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,655 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:15,655 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:15,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:50:15,655 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -223892668, now seen corresponding path program 2 times [2022-01-19 00:50:15,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:15,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167759505] [2022-01-19 00:50:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:15,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:50:15,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:15,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167759505] [2022-01-19 00:50:15,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167759505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:15,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:15,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:50:15,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178566551] [2022-01-19 00:50:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:15,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:50:15,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:50:15,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:50:15,759 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:50:15,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 910 transitions, 2877 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:15,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:50:15,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:26,420 INFO L129 PetriNetUnfolder]: 8593/48956 cut-off events. [2022-01-19 00:50:26,420 INFO L130 PetriNetUnfolder]: For 51841/60724 co-relation queries the response was YES. [2022-01-19 00:50:27,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81244 conditions, 48956 events. 8593/48956 cut-off events. For 51841/60724 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 699842 event pairs, 3042 based on Foata normal form. 435/46751 useless extension candidates. Maximal degree in co-relation 81211. Up to 4529 conditions per place. [2022-01-19 00:50:27,622 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 184 selfloop transitions, 21 changer transitions 3/1005 dead transitions. [2022-01-19 00:50:27,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 1005 transitions, 3719 flow [2022-01-19 00:50:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:50:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:50:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5402 transitions. [2022-01-19 00:50:27,626 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906832298136646 [2022-01-19 00:50:27,626 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5402 transitions. [2022-01-19 00:50:27,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5402 transitions. [2022-01-19 00:50:27,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:27,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5402 transitions. [2022-01-19 00:50:27,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 771.7142857142857) internal successors, (5402), 7 states have internal predecessors, (5402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:27,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:27,635 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:27,635 INFO L186 Difference]: Start difference. First operand has 820 places, 910 transitions, 2877 flow. Second operand 7 states and 5402 transitions. [2022-01-19 00:50:27,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 1005 transitions, 3719 flow [2022-01-19 00:50:27,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 1005 transitions, 3719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:50:27,813 INFO L242 Difference]: Finished difference. Result has 828 places, 912 transitions, 2977 flow [2022-01-19 00:50:27,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2977, PETRI_PLACES=828, PETRI_TRANSITIONS=912} [2022-01-19 00:50:27,814 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 72 predicate places. [2022-01-19 00:50:27,814 INFO L470 AbstractCegarLoop]: Abstraction has has 828 places, 912 transitions, 2977 flow [2022-01-19 00:50:27,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:27,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:27,815 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:27,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:50:27,815 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:27,815 INFO L85 PathProgramCache]: Analyzing trace with hash -557134478, now seen corresponding path program 3 times [2022-01-19 00:50:27,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:27,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978352577] [2022-01-19 00:50:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:27,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:50:27,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:27,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978352577] [2022-01-19 00:50:27,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978352577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:27,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:27,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:50:27,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553498203] [2022-01-19 00:50:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:27,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:50:27,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:50:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:50:27,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:50:27,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 912 transitions, 2977 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:27,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:27,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:50:27,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:39,949 INFO L129 PetriNetUnfolder]: 9322/54905 cut-off events. [2022-01-19 00:50:39,949 INFO L130 PetriNetUnfolder]: For 66735/75920 co-relation queries the response was YES. [2022-01-19 00:50:40,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91388 conditions, 54905 events. 9322/54905 cut-off events. For 66735/75920 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 808336 event pairs, 4814 based on Foata normal form. 327/52394 useless extension candidates. Maximal degree in co-relation 91352. Up to 8166 conditions per place. [2022-01-19 00:50:41,253 INFO L132 encePairwiseOnDemand]: 835/851 looper letters, 199 selfloop transitions, 35 changer transitions 4/1035 dead transitions. [2022-01-19 00:50:41,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 1035 transitions, 3932 flow [2022-01-19 00:50:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:50:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:50:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4666 transitions. [2022-01-19 00:50:41,256 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9138268703486094 [2022-01-19 00:50:41,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4666 transitions. [2022-01-19 00:50:41,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4666 transitions. [2022-01-19 00:50:41,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:41,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4666 transitions. [2022-01-19 00:50:41,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 777.6666666666666) internal successors, (4666), 6 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,262 INFO L186 Difference]: Start difference. First operand has 828 places, 912 transitions, 2977 flow. Second operand 6 states and 4666 transitions. [2022-01-19 00:50:41,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 1035 transitions, 3932 flow [2022-01-19 00:50:41,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 1035 transitions, 3883 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:41,431 INFO L242 Difference]: Finished difference. Result has 834 places, 935 transitions, 3267 flow [2022-01-19 00:50:41,432 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3267, PETRI_PLACES=834, PETRI_TRANSITIONS=935} [2022-01-19 00:50:41,432 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 78 predicate places. [2022-01-19 00:50:41,432 INFO L470 AbstractCegarLoop]: Abstraction has has 834 places, 935 transitions, 3267 flow [2022-01-19 00:50:41,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,433 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:41,433 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:41,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:50:41,433 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash -779960328, now seen corresponding path program 4 times [2022-01-19 00:50:41,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:41,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278067359] [2022-01-19 00:50:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:41,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:50:41,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:41,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278067359] [2022-01-19 00:50:41,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278067359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:41,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:41,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:50:41,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166969033] [2022-01-19 00:50:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:41,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:50:41,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:50:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:50:41,519 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:50:41,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 935 transitions, 3267 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:41,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:50:41,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:55,842 INFO L129 PetriNetUnfolder]: 9788/63753 cut-off events. [2022-01-19 00:50:55,843 INFO L130 PetriNetUnfolder]: For 76890/83300 co-relation queries the response was YES. [2022-01-19 00:50:57,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104705 conditions, 63753 events. 9788/63753 cut-off events. For 76890/83300 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 976826 event pairs, 5758 based on Foata normal form. 41/60431 useless extension candidates. Maximal degree in co-relation 104665. Up to 10305 conditions per place. [2022-01-19 00:50:57,386 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 214 selfloop transitions, 24 changer transitions 13/1048 dead transitions. [2022-01-19 00:50:57,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 1048 transitions, 4153 flow [2022-01-19 00:50:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:50:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:50:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5413 transitions. [2022-01-19 00:50:57,390 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9086788652006044 [2022-01-19 00:50:57,390 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5413 transitions. [2022-01-19 00:50:57,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5413 transitions. [2022-01-19 00:50:57,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:57,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5413 transitions. [2022-01-19 00:50:57,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 773.2857142857143) internal successors, (5413), 7 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:57,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:57,396 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:57,396 INFO L186 Difference]: Start difference. First operand has 834 places, 935 transitions, 3267 flow. Second operand 7 states and 5413 transitions. [2022-01-19 00:50:57,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 1048 transitions, 4153 flow [2022-01-19 00:50:58,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 1048 transitions, 4143 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-01-19 00:50:58,036 INFO L242 Difference]: Finished difference. Result has 842 places, 938 transitions, 3368 flow [2022-01-19 00:50:58,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3368, PETRI_PLACES=842, PETRI_TRANSITIONS=938} [2022-01-19 00:50:58,037 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 86 predicate places. [2022-01-19 00:50:58,037 INFO L470 AbstractCegarLoop]: Abstraction has has 842 places, 938 transitions, 3368 flow [2022-01-19 00:50:58,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:58,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:58,038 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:58,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:50:58,038 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 173589260, now seen corresponding path program 1 times [2022-01-19 00:50:58,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:58,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43656386] [2022-01-19 00:50:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:58,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:50:58,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:58,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43656386] [2022-01-19 00:50:58,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43656386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:58,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:58,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:50:58,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028037296] [2022-01-19 00:50:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:58,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:50:58,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:50:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:50:58,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 851 [2022-01-19 00:50:58,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 842 places, 938 transitions, 3368 flow. Second operand has 6 states, 6 states have (on average 764.5) internal successors, (4587), 6 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:58,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:58,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 851 [2022-01-19 00:50:58,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:01,341 INFO L129 PetriNetUnfolder]: 839/11109 cut-off events. [2022-01-19 00:51:01,341 INFO L130 PetriNetUnfolder]: For 9757/12404 co-relation queries the response was YES. [2022-01-19 00:51:01,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 11109 events. 839/11109 cut-off events. For 9757/12404 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 127064 event pairs, 77 based on Foata normal form. 58/10286 useless extension candidates. Maximal degree in co-relation 15355. Up to 741 conditions per place. [2022-01-19 00:51:01,771 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 55 selfloop transitions, 3 changer transitions 4/952 dead transitions. [2022-01-19 00:51:01,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 952 transitions, 3529 flow [2022-01-19 00:51:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:51:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:51:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5369 transitions. [2022-01-19 00:51:01,775 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9012925969447708 [2022-01-19 00:51:01,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5369 transitions. [2022-01-19 00:51:01,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5369 transitions. [2022-01-19 00:51:01,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:01,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5369 transitions. [2022-01-19 00:51:01,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 767.0) internal successors, (5369), 7 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,784 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,784 INFO L186 Difference]: Start difference. First operand has 842 places, 938 transitions, 3368 flow. Second operand 7 states and 5369 transitions. [2022-01-19 00:51:01,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 952 transitions, 3529 flow [2022-01-19 00:51:01,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 843 places, 952 transitions, 3506 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 00:51:01,821 INFO L242 Difference]: Finished difference. Result has 848 places, 940 transitions, 3370 flow [2022-01-19 00:51:01,822 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3345, PETRI_DIFFERENCE_MINUEND_PLACES=837, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3370, PETRI_PLACES=848, PETRI_TRANSITIONS=940} [2022-01-19 00:51:01,822 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 92 predicate places. [2022-01-19 00:51:01,823 INFO L470 AbstractCegarLoop]: Abstraction has has 848 places, 940 transitions, 3370 flow [2022-01-19 00:51:01,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 764.5) internal successors, (4587), 6 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,823 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:01,823 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:01,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:51:01,824 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -623110652, now seen corresponding path program 5 times [2022-01-19 00:51:01,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:01,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360747718] [2022-01-19 00:51:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:01,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:51:01,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:01,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360747718] [2022-01-19 00:51:01,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360747718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:01,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:01,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:51:01,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730646553] [2022-01-19 00:51:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:01,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:51:01,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:01,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:51:01,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:51:01,931 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:51:01,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 940 transitions, 3370 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:01,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:51:01,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:16,665 INFO L129 PetriNetUnfolder]: 9797/64246 cut-off events. [2022-01-19 00:51:16,665 INFO L130 PetriNetUnfolder]: For 83351/89923 co-relation queries the response was YES. [2022-01-19 00:51:18,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107357 conditions, 64246 events. 9797/64246 cut-off events. For 83351/89923 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 986947 event pairs, 5244 based on Foata normal form. 204/61268 useless extension candidates. Maximal degree in co-relation 107310. Up to 9165 conditions per place. [2022-01-19 00:51:18,459 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 215 selfloop transitions, 43 changer transitions 5/1062 dead transitions. [2022-01-19 00:51:18,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 1062 transitions, 4341 flow [2022-01-19 00:51:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:51:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:51:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5433 transitions. [2022-01-19 00:51:18,463 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9120362598623468 [2022-01-19 00:51:18,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5433 transitions. [2022-01-19 00:51:18,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5433 transitions. [2022-01-19 00:51:18,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:18,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5433 transitions. [2022-01-19 00:51:18,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 776.1428571428571) internal successors, (5433), 7 states have internal predecessors, (5433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:18,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:18,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:18,469 INFO L186 Difference]: Start difference. First operand has 848 places, 940 transitions, 3370 flow. Second operand 7 states and 5433 transitions. [2022-01-19 00:51:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 1062 transitions, 4341 flow [2022-01-19 00:51:18,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 1062 transitions, 4336 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 00:51:18,954 INFO L242 Difference]: Finished difference. Result has 854 places, 943 transitions, 3526 flow [2022-01-19 00:51:18,955 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3365, PETRI_DIFFERENCE_MINUEND_PLACES=843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3526, PETRI_PLACES=854, PETRI_TRANSITIONS=943} [2022-01-19 00:51:18,955 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 98 predicate places. [2022-01-19 00:51:18,955 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 943 transitions, 3526 flow [2022-01-19 00:51:18,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:18,956 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:18,956 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:18,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:51:18,956 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1979499548, now seen corresponding path program 6 times [2022-01-19 00:51:18,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:18,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780912773] [2022-01-19 00:51:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:18,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:51:19,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:19,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780912773] [2022-01-19 00:51:19,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780912773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:19,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:19,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:51:19,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933308952] [2022-01-19 00:51:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:19,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:51:19,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:51:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:51:19,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:51:19,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 943 transitions, 3526 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:19,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:19,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:51:19,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:33,988 INFO L129 PetriNetUnfolder]: 9544/62437 cut-off events. [2022-01-19 00:51:33,989 INFO L130 PetriNetUnfolder]: For 106699/113969 co-relation queries the response was YES. [2022-01-19 00:51:35,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106187 conditions, 62437 events. 9544/62437 cut-off events. For 106699/113969 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 953071 event pairs, 6147 based on Foata normal form. 125/59416 useless extension candidates. Maximal degree in co-relation 106137. Up to 11200 conditions per place. [2022-01-19 00:51:35,577 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 193 selfloop transitions, 21 changer transitions 19/1032 dead transitions. [2022-01-19 00:51:35,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 1032 transitions, 4441 flow [2022-01-19 00:51:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:51:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:51:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5380 transitions. [2022-01-19 00:51:35,580 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9031391640087292 [2022-01-19 00:51:35,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5380 transitions. [2022-01-19 00:51:35,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5380 transitions. [2022-01-19 00:51:35,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:35,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5380 transitions. [2022-01-19 00:51:35,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 768.5714285714286) internal successors, (5380), 7 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:35,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:35,586 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:35,587 INFO L186 Difference]: Start difference. First operand has 854 places, 943 transitions, 3526 flow. Second operand 7 states and 5380 transitions. [2022-01-19 00:51:35,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 1032 transitions, 4441 flow [2022-01-19 00:51:36,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 857 places, 1032 transitions, 4397 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-01-19 00:51:36,291 INFO L242 Difference]: Finished difference. Result has 861 places, 954 transitions, 3675 flow [2022-01-19 00:51:36,292 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=851, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3675, PETRI_PLACES=861, PETRI_TRANSITIONS=954} [2022-01-19 00:51:36,292 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 105 predicate places. [2022-01-19 00:51:36,292 INFO L470 AbstractCegarLoop]: Abstraction has has 861 places, 954 transitions, 3675 flow [2022-01-19 00:51:36,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:36,293 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:36,293 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:36,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:51:36,293 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash -30601328, now seen corresponding path program 7 times [2022-01-19 00:51:36,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:36,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241460026] [2022-01-19 00:51:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:36,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:51:36,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:36,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241460026] [2022-01-19 00:51:36,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241460026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:36,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:36,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:51:36,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842651748] [2022-01-19 00:51:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:36,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:51:36,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:51:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:51:36,423 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:51:36,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 954 transitions, 3675 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:36,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:36,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:51:36,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:53,673 INFO L129 PetriNetUnfolder]: 11198/77159 cut-off events. [2022-01-19 00:51:53,673 INFO L130 PetriNetUnfolder]: For 116743/121649 co-relation queries the response was YES. [2022-01-19 00:51:55,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124743 conditions, 77159 events. 11198/77159 cut-off events. For 116743/121649 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 1220803 event pairs, 4495 based on Foata normal form. 366/72638 useless extension candidates. Maximal degree in co-relation 124689. Up to 6724 conditions per place. [2022-01-19 00:51:56,041 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 206 selfloop transitions, 118 changer transitions 8/1131 dead transitions. [2022-01-19 00:51:56,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 1131 transitions, 5350 flow [2022-01-19 00:51:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:51:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:51:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6961 transitions. [2022-01-19 00:51:56,045 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088653871262566 [2022-01-19 00:51:56,045 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6961 transitions. [2022-01-19 00:51:56,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6961 transitions. [2022-01-19 00:51:56,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:56,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6961 transitions. [2022-01-19 00:51:56,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 773.4444444444445) internal successors, (6961), 9 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:56,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:56,053 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:56,053 INFO L186 Difference]: Start difference. First operand has 861 places, 954 transitions, 3675 flow. Second operand 9 states and 6961 transitions. [2022-01-19 00:51:56,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 1131 transitions, 5350 flow [2022-01-19 00:51:56,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 868 places, 1131 transitions, 5328 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 00:51:56,689 INFO L242 Difference]: Finished difference. Result has 875 places, 1019 transitions, 4668 flow [2022-01-19 00:51:56,690 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3661, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4668, PETRI_PLACES=875, PETRI_TRANSITIONS=1019} [2022-01-19 00:51:56,691 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 119 predicate places. [2022-01-19 00:51:56,691 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 1019 transitions, 4668 flow [2022-01-19 00:51:56,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:56,691 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:56,691 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:56,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:51:56,692 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 381741258, now seen corresponding path program 8 times [2022-01-19 00:51:56,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:56,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903100271] [2022-01-19 00:51:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:56,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:51:56,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:56,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903100271] [2022-01-19 00:51:56,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903100271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:56,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:56,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:51:56,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209375961] [2022-01-19 00:51:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:56,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:51:56,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:51:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:51:56,789 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:51:56,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 1019 transitions, 4668 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:56,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:56,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:51:56,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:52:14,448 INFO L129 PetriNetUnfolder]: 10965/74335 cut-off events. [2022-01-19 00:52:14,448 INFO L130 PetriNetUnfolder]: For 147327/152218 co-relation queries the response was YES. [2022-01-19 00:52:16,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129898 conditions, 74335 events. 10965/74335 cut-off events. For 147327/152218 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 1167604 event pairs, 4473 based on Foata normal form. 369/70322 useless extension candidates. Maximal degree in co-relation 129838. Up to 6724 conditions per place. [2022-01-19 00:52:16,352 INFO L132 encePairwiseOnDemand]: 813/851 looper letters, 173 selfloop transitions, 112 changer transitions 15/1099 dead transitions. [2022-01-19 00:52:16,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 1099 transitions, 5686 flow [2022-01-19 00:52:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:52:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:52:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6164 transitions. [2022-01-19 00:52:16,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2022-01-19 00:52:16,356 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6164 transitions. [2022-01-19 00:52:16,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6164 transitions. [2022-01-19 00:52:16,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:52:16,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6164 transitions. [2022-01-19 00:52:16,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 770.5) internal successors, (6164), 8 states have internal predecessors, (6164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:16,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:16,364 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:16,364 INFO L186 Difference]: Start difference. First operand has 875 places, 1019 transitions, 4668 flow. Second operand 8 states and 6164 transitions. [2022-01-19 00:52:16,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 1099 transitions, 5686 flow [2022-01-19 00:52:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 1099 transitions, 5676 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-01-19 00:52:17,641 INFO L242 Difference]: Finished difference. Result has 883 places, 1019 transitions, 5032 flow [2022-01-19 00:52:17,642 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4650, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5032, PETRI_PLACES=883, PETRI_TRANSITIONS=1019} [2022-01-19 00:52:17,642 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 127 predicate places. [2022-01-19 00:52:17,643 INFO L470 AbstractCegarLoop]: Abstraction has has 883 places, 1019 transitions, 5032 flow [2022-01-19 00:52:17,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:17,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:52:17,643 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:52:17,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:52:17,643 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:52:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:52:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1027995298, now seen corresponding path program 9 times [2022-01-19 00:52:17,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:52:17,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967675223] [2022-01-19 00:52:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:52:17,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:52:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:52:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:52:17,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:52:17,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967675223] [2022-01-19 00:52:17,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967675223] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:52:17,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:52:17,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:52:17,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812593795] [2022-01-19 00:52:17,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:52:17,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:52:17,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:52:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:52:17,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:52:17,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:52:17,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 1019 transitions, 5032 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:17,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:52:17,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:52:17,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:52:34,945 INFO L129 PetriNetUnfolder]: 10542/70042 cut-off events. [2022-01-19 00:52:34,946 INFO L130 PetriNetUnfolder]: For 180239/184855 co-relation queries the response was YES. [2022-01-19 00:52:36,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128298 conditions, 70042 events. 10542/70042 cut-off events. For 180239/184855 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 1089748 event pairs, 5498 based on Foata normal form. 274/66358 useless extension candidates. Maximal degree in co-relation 128234. Up to 8619 conditions per place. [2022-01-19 00:52:37,030 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 210 selfloop transitions, 50 changer transitions 14/1073 dead transitions. [2022-01-19 00:52:37,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 1073 transitions, 5819 flow [2022-01-19 00:52:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:52:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:52:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4632 transitions. [2022-01-19 00:52:37,033 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9071680376028202 [2022-01-19 00:52:37,033 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4632 transitions. [2022-01-19 00:52:37,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4632 transitions. [2022-01-19 00:52:37,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:52:37,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4632 transitions. [2022-01-19 00:52:37,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 772.0) internal successors, (4632), 6 states have internal predecessors, (4632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:37,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:37,038 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:37,038 INFO L186 Difference]: Start difference. First operand has 883 places, 1019 transitions, 5032 flow. Second operand 6 states and 4632 transitions. [2022-01-19 00:52:37,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 1073 transitions, 5819 flow [2022-01-19 00:52:38,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 1073 transitions, 5638 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-01-19 00:52:38,530 INFO L242 Difference]: Finished difference. Result has 886 places, 1018 transitions, 4977 flow [2022-01-19 00:52:38,531 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4802, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4977, PETRI_PLACES=886, PETRI_TRANSITIONS=1018} [2022-01-19 00:52:38,531 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 130 predicate places. [2022-01-19 00:52:38,532 INFO L470 AbstractCegarLoop]: Abstraction has has 886 places, 1018 transitions, 4977 flow [2022-01-19 00:52:38,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:38,532 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:52:38,532 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:52:38,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:52:38,532 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:52:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:52:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1379995286, now seen corresponding path program 1 times [2022-01-19 00:52:38,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:52:38,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499630786] [2022-01-19 00:52:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:52:38,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:52:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:52:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:52:38,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:52:38,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499630786] [2022-01-19 00:52:38,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499630786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:52:38,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:52:38,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:52:38,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187464786] [2022-01-19 00:52:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:52:38,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:52:38,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:52:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:52:38,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:52:38,621 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 851 [2022-01-19 00:52:38,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 1018 transitions, 4977 flow. Second operand has 7 states, 7 states have (on average 742.4285714285714) internal successors, (5197), 7 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:52:38,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:52:38,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 851 [2022-01-19 00:52:38,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:52:53,516 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), 253#L96-14true, Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:53,518 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2022-01-19 00:52:53,518 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 00:52:53,525 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 00:52:53,525 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 00:52:53,796 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:53,796 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-01-19 00:52:53,796 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 00:52:53,796 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 00:52:53,797 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 00:52:54,049 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 606#L96-16true, Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:54,050 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-01-19 00:52:54,050 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 00:52:54,050 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 00:52:54,050 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 00:52:56,398 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), 680#L160-2true, Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:56,399 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-01-19 00:52:56,399 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 00:52:56,399 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 00:52:56,399 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 00:52:56,684 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 253#L96-14true, Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:56,684 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2022-01-19 00:52:56,684 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 00:52:56,684 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 00:52:56,684 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2022-01-19 00:52:56,684 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2022-01-19 00:52:56,972 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:56,973 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-01-19 00:52:56,973 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 00:52:56,973 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 00:52:56,973 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-01-19 00:52:56,973 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2022-01-19 00:52:57,273 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 606#L96-16true, Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:57,274 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-01-19 00:52:57,274 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 00:52:57,274 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 00:52:57,274 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-01-19 00:52:57,274 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2022-01-19 00:52:59,704 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), 680#L160-2true, Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 36#L123-15true, Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:52:59,704 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-01-19 00:52:59,704 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 00:52:59,705 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2022-01-19 00:52:59,705 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 00:52:59,705 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2022-01-19 00:53:22,770 INFO L129 PetriNetUnfolder]: 35999/188452 cut-off events. [2022-01-19 00:53:22,770 INFO L130 PetriNetUnfolder]: For 140435/151291 co-relation queries the response was YES. [2022-01-19 00:53:27,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263519 conditions, 188452 events. 35999/188452 cut-off events. For 140435/151291 co-relation queries the response was YES. Maximal size of possible extension queue 3111. Compared 3175488 event pairs, 15632 based on Foata normal form. 300/167831 useless extension candidates. Maximal degree in co-relation 263454. Up to 31354 conditions per place. [2022-01-19 00:53:27,918 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 129 selfloop transitions, 5 changer transitions 4/1085 dead transitions. [2022-01-19 00:53:27,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 1085 transitions, 5403 flow [2022-01-19 00:53:27,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:53:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:53:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6026 transitions. [2022-01-19 00:53:27,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851351351351351 [2022-01-19 00:53:27,922 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6026 transitions. [2022-01-19 00:53:27,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6026 transitions. [2022-01-19 00:53:27,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:53:27,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6026 transitions. [2022-01-19 00:53:27,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 753.25) internal successors, (6026), 8 states have internal predecessors, (6026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:27,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:27,928 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:27,928 INFO L186 Difference]: Start difference. First operand has 886 places, 1018 transitions, 4977 flow. Second operand 8 states and 6026 transitions. [2022-01-19 00:53:27,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 1085 transitions, 5403 flow [2022-01-19 00:53:29,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 892 places, 1085 transitions, 5344 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 00:53:29,497 INFO L242 Difference]: Finished difference. Result has 897 places, 1020 transitions, 4947 flow [2022-01-19 00:53:29,498 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4918, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4947, PETRI_PLACES=897, PETRI_TRANSITIONS=1020} [2022-01-19 00:53:29,498 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 141 predicate places. [2022-01-19 00:53:29,498 INFO L470 AbstractCegarLoop]: Abstraction has has 897 places, 1020 transitions, 4947 flow [2022-01-19 00:53:29,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 742.4285714285714) internal successors, (5197), 7 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:29,499 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:53:29,499 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:53:29,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:53:29,499 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:53:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:53:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -674811482, now seen corresponding path program 1 times [2022-01-19 00:53:29,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:53:29,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109510610] [2022-01-19 00:53:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:53:29,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:53:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:53:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:53:29,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:53:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109510610] [2022-01-19 00:53:29,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109510610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:53:29,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:53:29,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:53:29,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108903432] [2022-01-19 00:53:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:53:29,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:53:29,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:53:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:53:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:53:29,583 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 851 [2022-01-19 00:53:29,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 1020 transitions, 4947 flow. Second operand has 8 states, 8 states have (on average 738.875) internal successors, (5911), 8 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:53:29,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:53:29,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 851 [2022-01-19 00:53:29,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:53:44,759 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6318#(= ~break_17~0 0), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:53:44,759 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-01-19 00:53:44,759 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 00:53:44,759 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 00:53:44,759 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 00:53:47,633 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 680#L160-2true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6318#(= ~break_17~0 0), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:53:47,633 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-01-19 00:53:47,633 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 00:53:47,633 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 00:53:47,633 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 00:53:48,257 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:53:48,257 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-01-19 00:53:48,257 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 00:53:48,257 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 00:53:48,257 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-01-19 00:53:48,257 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2022-01-19 00:53:51,121 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= 1005 |v_thread3Thread1of1ForFork1_#t~ite83#1_1|) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), 680#L160-2true, Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2022-01-19 00:53:51,121 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-01-19 00:53:51,121 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 00:53:51,121 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 00:53:51,121 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2022-01-19 00:53:51,121 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-01-19 00:54:20,330 INFO L129 PetriNetUnfolder]: 43180/195755 cut-off events. [2022-01-19 00:54:20,330 INFO L130 PetriNetUnfolder]: For 138591/158791 co-relation queries the response was YES. [2022-01-19 00:54:25,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 291251 conditions, 195755 events. 43180/195755 cut-off events. For 138591/158791 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 3241485 event pairs, 14598 based on Foata normal form. 406/176212 useless extension candidates. Maximal degree in co-relation 291181. Up to 29037 conditions per place. [2022-01-19 00:54:25,951 INFO L132 encePairwiseOnDemand]: 841/851 looper letters, 167 selfloop transitions, 7 changer transitions 9/1128 dead transitions. [2022-01-19 00:54:25,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 1128 transitions, 5566 flow [2022-01-19 00:54:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 00:54:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 00:54:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 7512 transitions. [2022-01-19 00:54:25,954 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827262044653349 [2022-01-19 00:54:25,954 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 7512 transitions. [2022-01-19 00:54:25,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 7512 transitions. [2022-01-19 00:54:25,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:54:25,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 7512 transitions. [2022-01-19 00:54:25,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 751.2) internal successors, (7512), 10 states have internal predecessors, (7512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:25,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 851.0) internal successors, (9361), 11 states have internal predecessors, (9361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:25,963 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 851.0) internal successors, (9361), 11 states have internal predecessors, (9361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:25,963 INFO L186 Difference]: Start difference. First operand has 897 places, 1020 transitions, 4947 flow. Second operand 10 states and 7512 transitions. [2022-01-19 00:54:25,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 1128 transitions, 5566 flow [2022-01-19 00:54:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 1128 transitions, 5555 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-19 00:54:27,924 INFO L242 Difference]: Finished difference. Result has 907 places, 1024 transitions, 4983 flow [2022-01-19 00:54:27,925 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4938, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4983, PETRI_PLACES=907, PETRI_TRANSITIONS=1024} [2022-01-19 00:54:27,925 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 151 predicate places. [2022-01-19 00:54:27,925 INFO L470 AbstractCegarLoop]: Abstraction has has 907 places, 1024 transitions, 4983 flow [2022-01-19 00:54:27,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 738.875) internal successors, (5911), 8 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:27,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:54:27,926 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:54:27,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:54:27,926 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:54:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:54:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2042486976, now seen corresponding path program 1 times [2022-01-19 00:54:27,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:54:27,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463184678] [2022-01-19 00:54:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:54:27,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:54:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:54:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:54:27,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:54:27,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463184678] [2022-01-19 00:54:27,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463184678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:54:27,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:54:27,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:54:27,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398832785] [2022-01-19 00:54:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:54:27,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:54:27,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:54:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:54:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:54:27,991 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:54:27,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 1024 transitions, 4983 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:27,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:54:27,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:54:27,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:54:35,586 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2686] thread1EXIT-->L159-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem112#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem112#1=|v_ULTIMATE.start_main_#t~mem112#1_5|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem112#1=|v_ULTIMATE.start_main_#t~mem112#1_5|} AuxVars[] AssignedVars[][972], [Black: 6516#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|) (<= 1005 ~result_18~0)), Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6512#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite84#1|) (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|)), Black: 6387#(<= (+ ~result_12~0 995) 0), Black: 6523#(and (<= 1005 ~result_18~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 778#(not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), Black: 6521#(and (<= 1005 ~result_18~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6503#true, Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6405#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 788#true, 6406#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 6422#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6423#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 796#(not (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0)), Black: 6425#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 800#true, 6336#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 6537#(and (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (= (+ ~is_null_9~0 (* (- 256) (div ~is_null_9~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), 487#L123-4true, Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6460#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)))), Black: 6331#true, 6350#(or (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), 498#L96-4true, Black: 6475#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6473#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))) (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0)) (not (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6373#(= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0), Black: 6374#(and (= (+ ~is_null_1~0 (* (- 256) (div ~is_null_1~0 256))) 0) (= (+ (* (- 256) (div ~is_null_5~0 256)) ~is_null_5~0) 0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0), Black: 6507#(<= 1005 ~result_18~0), Black: 6514#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite84#1|) (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|) (<= 1005 ~result_18~0))]) [2022-01-19 00:54:35,586 INFO L384 tUnfolder$Statistics]: this new event has 383 ancestors and is cut-off event [2022-01-19 00:54:35,586 INFO L387 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2022-01-19 00:54:35,586 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2022-01-19 00:54:35,586 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2022-01-19 00:54:38,114 INFO L129 PetriNetUnfolder]: 4018/39684 cut-off events. [2022-01-19 00:54:38,114 INFO L130 PetriNetUnfolder]: For 117653/124569 co-relation queries the response was YES. [2022-01-19 00:54:38,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76394 conditions, 39684 events. 4018/39684 cut-off events. For 117653/124569 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 567835 event pairs, 1094 based on Foata normal form. 230/37513 useless extension candidates. Maximal degree in co-relation 76319. Up to 2163 conditions per place. [2022-01-19 00:54:39,046 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 92 selfloop transitions, 27 changer transitions 34/1069 dead transitions. [2022-01-19 00:54:39,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 1069 transitions, 5623 flow [2022-01-19 00:54:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:54:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:54:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3990 transitions. [2022-01-19 00:54:39,048 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9377203290246768 [2022-01-19 00:54:39,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3990 transitions. [2022-01-19 00:54:39,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3990 transitions. [2022-01-19 00:54:39,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:54:39,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3990 transitions. [2022-01-19 00:54:39,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 798.0) internal successors, (3990), 5 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:39,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:39,053 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:39,053 INFO L186 Difference]: Start difference. First operand has 907 places, 1024 transitions, 4983 flow. Second operand 5 states and 3990 transitions. [2022-01-19 00:54:39,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 1069 transitions, 5623 flow [2022-01-19 00:54:39,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1069 transitions, 5614 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-01-19 00:54:39,924 INFO L242 Difference]: Finished difference. Result has 908 places, 1010 transitions, 4784 flow [2022-01-19 00:54:39,925 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4974, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4784, PETRI_PLACES=908, PETRI_TRANSITIONS=1010} [2022-01-19 00:54:39,926 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 152 predicate places. [2022-01-19 00:54:39,926 INFO L470 AbstractCegarLoop]: Abstraction has has 908 places, 1010 transitions, 4784 flow [2022-01-19 00:54:39,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:39,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:54:39,926 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:54:39,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 00:54:39,927 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:54:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:54:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 654373954, now seen corresponding path program 2 times [2022-01-19 00:54:39,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:54:39,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008577167] [2022-01-19 00:54:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:54:39,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:54:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:54:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:54:40,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:54:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008577167] [2022-01-19 00:54:40,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008577167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:54:40,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:54:40,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:54:40,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294237149] [2022-01-19 00:54:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:54:40,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:54:40,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:54:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:54:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:54:40,015 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:54:40,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 1010 transitions, 4784 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:40,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:54:40,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:54:40,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:54:48,976 INFO L129 PetriNetUnfolder]: 3510/33096 cut-off events. [2022-01-19 00:54:48,976 INFO L130 PetriNetUnfolder]: For 146259/157774 co-relation queries the response was YES. [2022-01-19 00:54:49,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69504 conditions, 33096 events. 3510/33096 cut-off events. For 146259/157774 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 467131 event pairs, 597 based on Foata normal form. 606/31882 useless extension candidates. Maximal degree in co-relation 69428. Up to 1479 conditions per place. [2022-01-19 00:54:49,844 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 118 selfloop transitions, 46 changer transitions 13/1093 dead transitions. [2022-01-19 00:54:49,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 1093 transitions, 6219 flow [2022-01-19 00:54:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:54:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:54:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2022-01-19 00:54:49,847 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2022-01-19 00:54:49,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2022-01-19 00:54:49,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2022-01-19 00:54:49,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:54:49,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2022-01-19 00:54:49,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 801.2) internal successors, (4006), 5 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:49,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:49,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:49,851 INFO L186 Difference]: Start difference. First operand has 908 places, 1010 transitions, 4784 flow. Second operand 5 states and 4006 transitions. [2022-01-19 00:54:49,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 1093 transitions, 6219 flow [2022-01-19 00:54:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1093 transitions, 6061 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-01-19 00:54:50,781 INFO L242 Difference]: Finished difference. Result has 909 places, 1034 transitions, 5380 flow [2022-01-19 00:54:50,782 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4684, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5380, PETRI_PLACES=909, PETRI_TRANSITIONS=1034} [2022-01-19 00:54:50,782 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 153 predicate places. [2022-01-19 00:54:50,782 INFO L470 AbstractCegarLoop]: Abstraction has has 909 places, 1034 transitions, 5380 flow [2022-01-19 00:54:50,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:50,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:54:50,783 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:54:50,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 00:54:50,783 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:54:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:54:50,783 INFO L85 PathProgramCache]: Analyzing trace with hash -203898288, now seen corresponding path program 3 times [2022-01-19 00:54:50,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:54:50,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776308781] [2022-01-19 00:54:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:54:50,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:54:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:54:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:54:50,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:54:50,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776308781] [2022-01-19 00:54:50,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776308781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:54:50,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:54:50,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:54:50,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101120541] [2022-01-19 00:54:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:54:50,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:54:50,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:54:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:54:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:54:50,844 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:54:50,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 1034 transitions, 5380 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:54:50,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:54:50,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:54:50,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:55:01,498 INFO L129 PetriNetUnfolder]: 3917/40555 cut-off events. [2022-01-19 00:55:01,498 INFO L130 PetriNetUnfolder]: For 152315/167837 co-relation queries the response was YES. [2022-01-19 00:55:02,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77886 conditions, 40555 events. 3917/40555 cut-off events. For 152315/167837 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 586792 event pairs, 740 based on Foata normal form. 1034/39172 useless extension candidates. Maximal degree in co-relation 77810. Up to 1530 conditions per place. [2022-01-19 00:55:02,538 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 140 selfloop transitions, 49 changer transitions 24/1129 dead transitions. [2022-01-19 00:55:02,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 1129 transitions, 7081 flow [2022-01-19 00:55:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:55:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:55:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4010 transitions. [2022-01-19 00:55:02,541 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9424206815511164 [2022-01-19 00:55:02,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4010 transitions. [2022-01-19 00:55:02,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4010 transitions. [2022-01-19 00:55:02,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:55:02,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4010 transitions. [2022-01-19 00:55:02,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:02,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:02,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:02,545 INFO L186 Difference]: Start difference. First operand has 909 places, 1034 transitions, 5380 flow. Second operand 5 states and 4010 transitions. [2022-01-19 00:55:02,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 1129 transitions, 7081 flow [2022-01-19 00:55:03,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 1129 transitions, 7075 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-01-19 00:55:03,398 INFO L242 Difference]: Finished difference. Result has 917 places, 1051 transitions, 5927 flow [2022-01-19 00:55:03,398 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=5376, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5927, PETRI_PLACES=917, PETRI_TRANSITIONS=1051} [2022-01-19 00:55:03,398 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 161 predicate places. [2022-01-19 00:55:03,399 INFO L470 AbstractCegarLoop]: Abstraction has has 917 places, 1051 transitions, 5927 flow [2022-01-19 00:55:03,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:03,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:55:03,399 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:55:03,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 00:55:03,399 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:55:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:55:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 582216258, now seen corresponding path program 4 times [2022-01-19 00:55:03,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:55:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073492474] [2022-01-19 00:55:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:55:03,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:55:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:55:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:55:03,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:55:03,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073492474] [2022-01-19 00:55:03,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073492474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:55:03,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:55:03,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:55:03,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39144809] [2022-01-19 00:55:03,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:55:03,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:55:03,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:55:03,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:55:03,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:55:03,462 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:55:03,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 1051 transitions, 5927 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:03,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:55:03,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:55:03,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:55:13,951 INFO L129 PetriNetUnfolder]: 3729/38781 cut-off events. [2022-01-19 00:55:13,951 INFO L130 PetriNetUnfolder]: For 164374/182131 co-relation queries the response was YES. [2022-01-19 00:55:14,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77305 conditions, 38781 events. 3729/38781 cut-off events. For 164374/182131 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 556581 event pairs, 718 based on Foata normal form. 525/37031 useless extension candidates. Maximal degree in co-relation 77225. Up to 1395 conditions per place. [2022-01-19 00:55:14,858 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 126 selfloop transitions, 40 changer transitions 2/1084 dead transitions. [2022-01-19 00:55:14,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 1084 transitions, 6434 flow [2022-01-19 00:55:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:55:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:55:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3200 transitions. [2022-01-19 00:55:14,860 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9400705052878966 [2022-01-19 00:55:14,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3200 transitions. [2022-01-19 00:55:14,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3200 transitions. [2022-01-19 00:55:14,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:55:14,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3200 transitions. [2022-01-19 00:55:14,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 800.0) internal successors, (3200), 4 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:14,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:14,864 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:14,864 INFO L186 Difference]: Start difference. First operand has 917 places, 1051 transitions, 5927 flow. Second operand 4 states and 3200 transitions. [2022-01-19 00:55:14,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 1084 transitions, 6434 flow [2022-01-19 00:55:15,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 1084 transitions, 6388 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-01-19 00:55:15,646 INFO L242 Difference]: Finished difference. Result has 921 places, 1052 transitions, 6041 flow [2022-01-19 00:55:15,647 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=5884, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6041, PETRI_PLACES=921, PETRI_TRANSITIONS=1052} [2022-01-19 00:55:15,647 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 165 predicate places. [2022-01-19 00:55:15,647 INFO L470 AbstractCegarLoop]: Abstraction has has 921 places, 1052 transitions, 6041 flow [2022-01-19 00:55:15,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:15,648 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:55:15,648 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:55:15,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 00:55:15,648 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:55:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:55:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash 499597566, now seen corresponding path program 1 times [2022-01-19 00:55:15,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:55:15,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992728728] [2022-01-19 00:55:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:55:15,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:55:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:55:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:55:15,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:55:15,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992728728] [2022-01-19 00:55:15,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992728728] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:55:15,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:55:15,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:55:15,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002577492] [2022-01-19 00:55:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:55:15,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:55:15,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:55:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:55:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:55:15,840 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:55:15,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 1052 transitions, 6041 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:15,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:55:15,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:55:15,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:55:26,331 INFO L129 PetriNetUnfolder]: 3902/39029 cut-off events. [2022-01-19 00:55:26,331 INFO L130 PetriNetUnfolder]: For 176578/191838 co-relation queries the response was YES. [2022-01-19 00:55:27,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78936 conditions, 39029 events. 3902/39029 cut-off events. For 176578/191838 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 559885 event pairs, 720 based on Foata normal form. 660/37406 useless extension candidates. Maximal degree in co-relation 78855. Up to 1390 conditions per place. [2022-01-19 00:55:27,420 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 143 selfloop transitions, 30 changer transitions 20/1109 dead transitions. [2022-01-19 00:55:27,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 1109 transitions, 7261 flow [2022-01-19 00:55:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:55:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:55:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3201 transitions. [2022-01-19 00:55:27,422 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9403642773207991 [2022-01-19 00:55:27,422 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3201 transitions. [2022-01-19 00:55:27,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3201 transitions. [2022-01-19 00:55:27,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:55:27,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3201 transitions. [2022-01-19 00:55:27,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 800.25) internal successors, (3201), 4 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:27,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:27,426 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:27,426 INFO L186 Difference]: Start difference. First operand has 921 places, 1052 transitions, 6041 flow. Second operand 4 states and 3201 transitions. [2022-01-19 00:55:27,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 1109 transitions, 7261 flow [2022-01-19 00:55:28,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 1109 transitions, 7257 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-01-19 00:55:28,280 INFO L242 Difference]: Finished difference. Result has 927 places, 1055 transitions, 6225 flow [2022-01-19 00:55:28,280 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6225, PETRI_PLACES=927, PETRI_TRANSITIONS=1055} [2022-01-19 00:55:28,281 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 171 predicate places. [2022-01-19 00:55:28,281 INFO L470 AbstractCegarLoop]: Abstraction has has 927 places, 1055 transitions, 6225 flow [2022-01-19 00:55:28,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:28,281 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:55:28,281 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:55:28,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 00:55:28,281 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:55:28,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:55:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash -712975400, now seen corresponding path program 2 times [2022-01-19 00:55:28,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:55:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204597674] [2022-01-19 00:55:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:55:28,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:55:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:55:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:55:28,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:55:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204597674] [2022-01-19 00:55:28,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204597674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:55:28,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:55:28,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:55:28,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472859176] [2022-01-19 00:55:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:55:28,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:55:28,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:55:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:55:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:55:28,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:55:28,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 1055 transitions, 6225 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:28,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:55:28,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:55:28,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:55:41,137 INFO L129 PetriNetUnfolder]: 4182/46385 cut-off events. [2022-01-19 00:55:41,137 INFO L130 PetriNetUnfolder]: For 218429/235687 co-relation queries the response was YES. [2022-01-19 00:55:42,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87731 conditions, 46385 events. 4182/46385 cut-off events. For 218429/235687 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 680463 event pairs, 1029 based on Foata normal form. 506/44034 useless extension candidates. Maximal degree in co-relation 87647. Up to 2472 conditions per place. [2022-01-19 00:55:42,467 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 129 selfloop transitions, 40 changer transitions 11/1096 dead transitions. [2022-01-19 00:55:42,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 1096 transitions, 6818 flow [2022-01-19 00:55:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:55:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:55:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3991 transitions. [2022-01-19 00:55:42,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379553466509988 [2022-01-19 00:55:42,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3991 transitions. [2022-01-19 00:55:42,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3991 transitions. [2022-01-19 00:55:42,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:55:42,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3991 transitions. [2022-01-19 00:55:42,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 798.2) internal successors, (3991), 5 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:42,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:42,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:42,474 INFO L186 Difference]: Start difference. First operand has 927 places, 1055 transitions, 6225 flow. Second operand 5 states and 3991 transitions. [2022-01-19 00:55:42,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 1096 transitions, 6818 flow [2022-01-19 00:55:43,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 1096 transitions, 6818 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:55:43,523 INFO L242 Difference]: Finished difference. Result has 934 places, 1057 transitions, 6376 flow [2022-01-19 00:55:43,524 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6376, PETRI_PLACES=934, PETRI_TRANSITIONS=1057} [2022-01-19 00:55:43,524 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 178 predicate places. [2022-01-19 00:55:43,524 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 1057 transitions, 6376 flow [2022-01-19 00:55:43,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:43,525 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:55:43,525 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:55:43,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 00:55:43,525 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:55:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:55:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 862920256, now seen corresponding path program 3 times [2022-01-19 00:55:43,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:55:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014885086] [2022-01-19 00:55:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:55:43,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:55:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:55:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:55:43,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:55:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014885086] [2022-01-19 00:55:43,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014885086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:55:43,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:55:43,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:55:43,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631063599] [2022-01-19 00:55:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:55:43,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:55:43,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:55:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:55:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:55:43,603 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:55:43,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 1057 transitions, 6376 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:43,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:55:43,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:55:43,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:55:55,595 INFO L129 PetriNetUnfolder]: 3761/42128 cut-off events. [2022-01-19 00:55:55,595 INFO L130 PetriNetUnfolder]: For 248281/268563 co-relation queries the response was YES. [2022-01-19 00:55:56,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83972 conditions, 42128 events. 3761/42128 cut-off events. For 248281/268563 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 618743 event pairs, 1037 based on Foata normal form. 487/40193 useless extension candidates. Maximal degree in co-relation 83884. Up to 2209 conditions per place. [2022-01-19 00:55:56,465 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 115 selfloop transitions, 49 changer transitions 13/1093 dead transitions. [2022-01-19 00:55:56,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 1093 transitions, 6915 flow [2022-01-19 00:55:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:55:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:55:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2022-01-19 00:55:56,468 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2022-01-19 00:55:56,468 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2022-01-19 00:55:56,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2022-01-19 00:55:56,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:55:56,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2022-01-19 00:55:56,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 797.8) internal successors, (3989), 5 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:56,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:56,472 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:56,472 INFO L186 Difference]: Start difference. First operand has 934 places, 1057 transitions, 6376 flow. Second operand 5 states and 3989 transitions. [2022-01-19 00:55:56,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 1093 transitions, 6915 flow [2022-01-19 00:55:57,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 1093 transitions, 6837 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 00:55:57,610 INFO L242 Difference]: Finished difference. Result has 939 places, 1057 transitions, 6437 flow [2022-01-19 00:55:57,610 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6298, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6437, PETRI_PLACES=939, PETRI_TRANSITIONS=1057} [2022-01-19 00:55:57,610 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 183 predicate places. [2022-01-19 00:55:57,610 INFO L470 AbstractCegarLoop]: Abstraction has has 939 places, 1057 transitions, 6437 flow [2022-01-19 00:55:57,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:57,611 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:55:57,611 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:55:57,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 00:55:57,611 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:55:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:55:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1232968302, now seen corresponding path program 4 times [2022-01-19 00:55:57,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:55:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497264578] [2022-01-19 00:55:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:55:57,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:55:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:55:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:55:57,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:55:57,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497264578] [2022-01-19 00:55:57,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497264578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:55:57,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:55:57,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:55:57,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659450029] [2022-01-19 00:55:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:55:57,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:55:57,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:55:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:55:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:55:57,687 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:55:57,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 1057 transitions, 6437 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:55:57,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:55:57,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:55:57,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:56:08,509 INFO L129 PetriNetUnfolder]: 3519/37563 cut-off events. [2022-01-19 00:56:08,509 INFO L130 PetriNetUnfolder]: For 274958/302299 co-relation queries the response was YES. [2022-01-19 00:56:09,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80098 conditions, 37563 events. 3519/37563 cut-off events. For 274958/302299 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 547857 event pairs, 547 based on Foata normal form. 1497/37049 useless extension candidates. Maximal degree in co-relation 80007. Up to 1472 conditions per place. [2022-01-19 00:56:09,485 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 164 selfloop transitions, 48 changer transitions 15/1143 dead transitions. [2022-01-19 00:56:09,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 1143 transitions, 7983 flow [2022-01-19 00:56:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:56:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:56:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4002 transitions. [2022-01-19 00:56:09,488 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2022-01-19 00:56:09,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4002 transitions. [2022-01-19 00:56:09,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4002 transitions. [2022-01-19 00:56:09,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:56:09,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4002 transitions. [2022-01-19 00:56:09,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 800.4) internal successors, (4002), 5 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:09,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:09,492 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:09,493 INFO L186 Difference]: Start difference. First operand has 939 places, 1057 transitions, 6437 flow. Second operand 5 states and 4002 transitions. [2022-01-19 00:56:09,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 1143 transitions, 7983 flow [2022-01-19 00:56:10,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 1143 transitions, 7889 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 00:56:10,505 INFO L242 Difference]: Finished difference. Result has 944 places, 1076 transitions, 6963 flow [2022-01-19 00:56:10,506 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6353, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6963, PETRI_PLACES=944, PETRI_TRANSITIONS=1076} [2022-01-19 00:56:10,506 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 188 predicate places. [2022-01-19 00:56:10,506 INFO L470 AbstractCegarLoop]: Abstraction has has 944 places, 1076 transitions, 6963 flow [2022-01-19 00:56:10,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:10,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:56:10,507 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:56:10,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 00:56:10,507 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:56:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:56:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 13610576, now seen corresponding path program 5 times [2022-01-19 00:56:10,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:56:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459195033] [2022-01-19 00:56:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:56:10,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:56:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:56:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:56:10,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:56:10,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459195033] [2022-01-19 00:56:10,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459195033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:56:10,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:56:10,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:56:10,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243696239] [2022-01-19 00:56:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:56:10,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:56:10,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:56:10,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:56:10,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:56:10,575 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:56:10,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 1076 transitions, 6963 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:10,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:56:10,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:56:10,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:56:22,940 INFO L129 PetriNetUnfolder]: 3835/42373 cut-off events. [2022-01-19 00:56:22,940 INFO L130 PetriNetUnfolder]: For 285346/313489 co-relation queries the response was YES. [2022-01-19 00:56:24,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85507 conditions, 42373 events. 3835/42373 cut-off events. For 285346/313489 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 618626 event pairs, 651 based on Foata normal form. 1604/41539 useless extension candidates. Maximal degree in co-relation 85413. Up to 1447 conditions per place. [2022-01-19 00:56:24,455 INFO L132 encePairwiseOnDemand]: 839/851 looper letters, 165 selfloop transitions, 57 changer transitions 9/1147 dead transitions. [2022-01-19 00:56:24,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1147 transitions, 8095 flow [2022-01-19 00:56:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:56:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:56:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2022-01-19 00:56:24,458 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2022-01-19 00:56:24,458 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2022-01-19 00:56:24,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2022-01-19 00:56:24,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:56:24,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2022-01-19 00:56:24,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 801.2) internal successors, (4006), 5 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:24,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:24,462 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:24,462 INFO L186 Difference]: Start difference. First operand has 944 places, 1076 transitions, 6963 flow. Second operand 5 states and 4006 transitions. [2022-01-19 00:56:24,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1147 transitions, 8095 flow [2022-01-19 00:56:25,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 1147 transitions, 8069 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-01-19 00:56:25,634 INFO L242 Difference]: Finished difference. Result has 952 places, 1088 transitions, 7398 flow [2022-01-19 00:56:25,635 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6887, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7398, PETRI_PLACES=952, PETRI_TRANSITIONS=1088} [2022-01-19 00:56:25,635 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 196 predicate places. [2022-01-19 00:56:25,635 INFO L470 AbstractCegarLoop]: Abstraction has has 952 places, 1088 transitions, 7398 flow [2022-01-19 00:56:25,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:25,636 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:56:25,636 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:56:25,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 00:56:25,636 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:56:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:56:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash 993155130, now seen corresponding path program 6 times [2022-01-19 00:56:25,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:56:25,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517900226] [2022-01-19 00:56:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:56:25,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:56:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:56:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:56:25,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:56:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517900226] [2022-01-19 00:56:25,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517900226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:56:25,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:56:25,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:56:25,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031051750] [2022-01-19 00:56:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:56:25,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:56:25,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:56:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:56:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:56:25,695 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:56:25,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 1088 transitions, 7398 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:25,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:56:25,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:56:25,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:56:38,075 INFO L129 PetriNetUnfolder]: 3828/41448 cut-off events. [2022-01-19 00:56:38,075 INFO L130 PetriNetUnfolder]: For 319949/350046 co-relation queries the response was YES. [2022-01-19 00:56:39,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85690 conditions, 41448 events. 3828/41448 cut-off events. For 319949/350046 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 601600 event pairs, 948 based on Foata normal form. 1394/40439 useless extension candidates. Maximal degree in co-relation 85592. Up to 2399 conditions per place. [2022-01-19 00:56:39,321 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 46 changer transitions 6/1123 dead transitions. [2022-01-19 00:56:39,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 1123 transitions, 8034 flow [2022-01-19 00:56:39,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:56:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:56:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2022-01-19 00:56:39,323 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2022-01-19 00:56:39,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2022-01-19 00:56:39,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2022-01-19 00:56:39,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:56:39,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2022-01-19 00:56:39,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 799.75) internal successors, (3199), 4 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:39,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:39,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:39,327 INFO L186 Difference]: Start difference. First operand has 952 places, 1088 transitions, 7398 flow. Second operand 4 states and 3199 transitions. [2022-01-19 00:56:39,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 1123 transitions, 8034 flow [2022-01-19 00:56:40,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 1123 transitions, 7985 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 00:56:40,492 INFO L242 Difference]: Finished difference. Result has 954 places, 1087 transitions, 7422 flow [2022-01-19 00:56:40,492 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7330, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7422, PETRI_PLACES=954, PETRI_TRANSITIONS=1087} [2022-01-19 00:56:40,493 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 198 predicate places. [2022-01-19 00:56:40,493 INFO L470 AbstractCegarLoop]: Abstraction has has 954 places, 1087 transitions, 7422 flow [2022-01-19 00:56:40,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:40,493 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:56:40,493 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:56:40,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 00:56:40,493 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:56:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:56:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1985037212, now seen corresponding path program 5 times [2022-01-19 00:56:40,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:56:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839858019] [2022-01-19 00:56:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:56:40,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:56:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:56:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:56:40,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:56:40,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839858019] [2022-01-19 00:56:40,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839858019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:56:40,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:56:40,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:56:40,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081202857] [2022-01-19 00:56:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:56:40,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:56:40,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:56:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:56:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:56:40,556 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:56:40,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 1087 transitions, 7422 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:40,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:56:40,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:56:40,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:56:54,084 INFO L129 PetriNetUnfolder]: 4217/47713 cut-off events. [2022-01-19 00:56:54,084 INFO L130 PetriNetUnfolder]: For 323729/350891 co-relation queries the response was YES. [2022-01-19 00:56:55,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93396 conditions, 47713 events. 4217/47713 cut-off events. For 323729/350891 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 702743 event pairs, 1043 based on Foata normal form. 429/45246 useless extension candidates. Maximal degree in co-relation 93297. Up to 2748 conditions per place. [2022-01-19 00:56:55,709 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 165 selfloop transitions, 27 changer transitions 17/1125 dead transitions. [2022-01-19 00:56:55,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 1125 transitions, 8035 flow [2022-01-19 00:56:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:56:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:56:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2022-01-19 00:56:55,711 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2022-01-19 00:56:55,711 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2022-01-19 00:56:55,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2022-01-19 00:56:55,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:56:55,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2022-01-19 00:56:55,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 797.8) internal successors, (3989), 5 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:55,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:55,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:55,716 INFO L186 Difference]: Start difference. First operand has 954 places, 1087 transitions, 7422 flow. Second operand 5 states and 3989 transitions. [2022-01-19 00:56:55,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 1125 transitions, 8035 flow [2022-01-19 00:56:57,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 1125 transitions, 8001 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:56:57,080 INFO L242 Difference]: Finished difference. Result has 959 places, 1085 transitions, 7379 flow [2022-01-19 00:56:57,080 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7388, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7379, PETRI_PLACES=959, PETRI_TRANSITIONS=1085} [2022-01-19 00:56:57,081 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2022-01-19 00:56:57,081 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1085 transitions, 7379 flow [2022-01-19 00:56:57,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:57,081 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:56:57,081 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:56:57,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 00:56:57,082 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:56:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:56:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1649567170, now seen corresponding path program 6 times [2022-01-19 00:56:57,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:56:57,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461047604] [2022-01-19 00:56:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:56:57,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:56:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:56:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:56:57,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:56:57,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461047604] [2022-01-19 00:56:57,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461047604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:56:57,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:56:57,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:56:57,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981134880] [2022-01-19 00:56:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:56:57,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:56:57,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:56:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:56:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:56:57,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2022-01-19 00:56:57,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 1085 transitions, 7379 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:56:57,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:56:57,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2022-01-19 00:56:57,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:57:09,895 INFO L129 PetriNetUnfolder]: 3851/43147 cut-off events. [2022-01-19 00:57:09,895 INFO L130 PetriNetUnfolder]: For 328119/358515 co-relation queries the response was YES. [2022-01-19 00:57:11,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88416 conditions, 43147 events. 3851/43147 cut-off events. For 328119/358515 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 630526 event pairs, 941 based on Foata normal form. 1160/41790 useless extension candidates. Maximal degree in co-relation 88315. Up to 2396 conditions per place. [2022-01-19 00:57:11,181 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 36 changer transitions 12/1119 dead transitions. [2022-01-19 00:57:11,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1119 transitions, 8002 flow [2022-01-19 00:57:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:57:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:57:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2022-01-19 00:57:11,183 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2022-01-19 00:57:11,183 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2022-01-19 00:57:11,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2022-01-19 00:57:11,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:57:11,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2022-01-19 00:57:11,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 799.75) internal successors, (3199), 4 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:11,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:11,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:11,186 INFO L186 Difference]: Start difference. First operand has 959 places, 1085 transitions, 7379 flow. Second operand 4 states and 3199 transitions. [2022-01-19 00:57:11,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1119 transitions, 8002 flow [2022-01-19 00:57:12,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 1119 transitions, 7933 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-01-19 00:57:12,643 INFO L242 Difference]: Finished difference. Result has 959 places, 1078 transitions, 7199 flow [2022-01-19 00:57:12,643 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7284, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7199, PETRI_PLACES=959, PETRI_TRANSITIONS=1078} [2022-01-19 00:57:12,643 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2022-01-19 00:57:12,644 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1078 transitions, 7199 flow [2022-01-19 00:57:12,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:12,644 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:57:12,644 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:57:12,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 00:57:12,644 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:57:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:57:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2120308048, now seen corresponding path program 1 times [2022-01-19 00:57:12,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:57:12,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674481506] [2022-01-19 00:57:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:57:12,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:57:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:57:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:57:12,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:57:12,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674481506] [2022-01-19 00:57:12,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674481506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:57:12,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:57:12,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:57:12,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106688518] [2022-01-19 00:57:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:57:12,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:57:12,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:57:12,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:57:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:57:12,739 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:57:12,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 1078 transitions, 7199 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:12,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:57:12,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:57:12,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:57:35,757 INFO L129 PetriNetUnfolder]: 9968/76017 cut-off events. [2022-01-19 00:57:35,757 INFO L130 PetriNetUnfolder]: For 579542/639740 co-relation queries the response was YES. [2022-01-19 00:57:38,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172449 conditions, 76017 events. 9968/76017 cut-off events. For 579542/639740 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 1209904 event pairs, 1613 based on Foata normal form. 1647/74686 useless extension candidates. Maximal degree in co-relation 172349. Up to 6506 conditions per place. [2022-01-19 00:57:38,576 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 354 selfloop transitions, 108 changer transitions 74/1341 dead transitions. [2022-01-19 00:57:38,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 1341 transitions, 12182 flow [2022-01-19 00:57:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:57:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:57:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8482 transitions. [2022-01-19 00:57:38,580 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906099775664993 [2022-01-19 00:57:38,580 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8482 transitions. [2022-01-19 00:57:38,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8482 transitions. [2022-01-19 00:57:38,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:57:38,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8482 transitions. [2022-01-19 00:57:38,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 771.0909090909091) internal successors, (8482), 11 states have internal predecessors, (8482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:38,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:38,588 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:38,588 INFO L186 Difference]: Start difference. First operand has 959 places, 1078 transitions, 7199 flow. Second operand 11 states and 8482 transitions. [2022-01-19 00:57:38,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 1341 transitions, 12182 flow [2022-01-19 00:57:42,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 1341 transitions, 12111 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:57:42,644 INFO L242 Difference]: Finished difference. Result has 977 places, 1108 transitions, 8590 flow [2022-01-19 00:57:42,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7101, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=988, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8590, PETRI_PLACES=977, PETRI_TRANSITIONS=1108} [2022-01-19 00:57:42,645 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 221 predicate places. [2022-01-19 00:57:42,645 INFO L470 AbstractCegarLoop]: Abstraction has has 977 places, 1108 transitions, 8590 flow [2022-01-19 00:57:42,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:42,645 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:57:42,646 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:57:42,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 00:57:42,646 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:57:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:57:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -212299800, now seen corresponding path program 2 times [2022-01-19 00:57:42,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:57:42,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216148392] [2022-01-19 00:57:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:57:42,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:57:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:57:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:57:42,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:57:42,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216148392] [2022-01-19 00:57:42,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216148392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:57:42,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:57:42,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:57:42,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231734493] [2022-01-19 00:57:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:57:42,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:57:42,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:57:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:57:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:57:42,728 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:57:42,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 1108 transitions, 8590 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:57:42,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:57:42,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:57:42,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:58:10,308 INFO L129 PetriNetUnfolder]: 10420/84409 cut-off events. [2022-01-19 00:58:10,308 INFO L130 PetriNetUnfolder]: For 511901/566181 co-relation queries the response was YES. [2022-01-19 00:58:13,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185627 conditions, 84409 events. 10420/84409 cut-off events. For 511901/566181 co-relation queries the response was YES. Maximal size of possible extension queue 1457. Compared 1374969 event pairs, 3280 based on Foata normal form. 867/81455 useless extension candidates. Maximal degree in co-relation 185519. Up to 6015 conditions per place. [2022-01-19 00:58:13,643 INFO L132 encePairwiseOnDemand]: 833/851 looper letters, 325 selfloop transitions, 110 changer transitions 97/1337 dead transitions. [2022-01-19 00:58:13,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1337 transitions, 11729 flow [2022-01-19 00:58:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:58:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:58:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6950 transitions. [2022-01-19 00:58:13,647 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9074291682987335 [2022-01-19 00:58:13,647 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6950 transitions. [2022-01-19 00:58:13,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6950 transitions. [2022-01-19 00:58:13,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:58:13,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6950 transitions. [2022-01-19 00:58:13,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 772.2222222222222) internal successors, (6950), 9 states have internal predecessors, (6950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:13,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:13,655 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:13,655 INFO L186 Difference]: Start difference. First operand has 977 places, 1108 transitions, 8590 flow. Second operand 9 states and 6950 transitions. [2022-01-19 00:58:13,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1337 transitions, 11729 flow [2022-01-19 00:58:18,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 1337 transitions, 11589 flow, removed 59 selfloop flow, removed 1 redundant places. [2022-01-19 00:58:18,393 INFO L242 Difference]: Finished difference. Result has 988 places, 1120 transitions, 8736 flow [2022-01-19 00:58:18,394 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8736, PETRI_PLACES=988, PETRI_TRANSITIONS=1120} [2022-01-19 00:58:18,394 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 232 predicate places. [2022-01-19 00:58:18,394 INFO L470 AbstractCegarLoop]: Abstraction has has 988 places, 1120 transitions, 8736 flow [2022-01-19 00:58:18,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:18,394 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:58:18,395 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:58:18,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 00:58:18,395 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:58:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:58:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1953128738, now seen corresponding path program 3 times [2022-01-19 00:58:18,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:58:18,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41867960] [2022-01-19 00:58:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:58:18,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:58:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:58:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:58:18,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:58:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41867960] [2022-01-19 00:58:18,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41867960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:58:18,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:58:18,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:58:18,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873987116] [2022-01-19 00:58:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:58:18,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:58:18,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:58:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:58:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:58:18,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 00:58:18,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1120 transitions, 8736 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:18,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:58:18,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 00:58:18,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:58:43,045 INFO L129 PetriNetUnfolder]: 10107/77075 cut-off events. [2022-01-19 00:58:43,045 INFO L130 PetriNetUnfolder]: For 536213/590314 co-relation queries the response was YES. [2022-01-19 00:58:46,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177042 conditions, 77075 events. 10107/77075 cut-off events. For 536213/590314 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 1232092 event pairs, 4813 based on Foata normal form. 515/74119 useless extension candidates. Maximal degree in co-relation 176929. Up to 10257 conditions per place. [2022-01-19 00:58:46,415 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 343 selfloop transitions, 75 changer transitions 17/1240 dead transitions. [2022-01-19 00:58:46,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1240 transitions, 10594 flow [2022-01-19 00:58:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:58:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:58:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6165 transitions. [2022-01-19 00:58:46,418 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9055522914218567 [2022-01-19 00:58:46,418 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6165 transitions. [2022-01-19 00:58:46,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6165 transitions. [2022-01-19 00:58:46,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:58:46,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6165 transitions. [2022-01-19 00:58:46,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 770.625) internal successors, (6165), 8 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:46,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:46,425 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:46,425 INFO L186 Difference]: Start difference. First operand has 988 places, 1120 transitions, 8736 flow. Second operand 8 states and 6165 transitions. [2022-01-19 00:58:46,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1240 transitions, 10594 flow [2022-01-19 00:58:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1240 transitions, 10430 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-01-19 00:58:51,452 INFO L242 Difference]: Finished difference. Result has 998 places, 1136 transitions, 9134 flow [2022-01-19 00:58:51,453 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=8606, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9134, PETRI_PLACES=998, PETRI_TRANSITIONS=1136} [2022-01-19 00:58:51,453 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 242 predicate places. [2022-01-19 00:58:51,453 INFO L470 AbstractCegarLoop]: Abstraction has has 998 places, 1136 transitions, 9134 flow [2022-01-19 00:58:51,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:51,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:58:51,454 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:58:51,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 00:58:51,454 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:58:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:58:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1902964794, now seen corresponding path program 4 times [2022-01-19 00:58:51,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:58:51,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54772599] [2022-01-19 00:58:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:58:51,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:58:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:58:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:58:51,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:58:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54772599] [2022-01-19 00:58:51,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54772599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:58:51,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:58:51,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:58:51,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963523035] [2022-01-19 00:58:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:58:51,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:58:51,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:58:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:58:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:58:51,544 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 851 [2022-01-19 00:58:51,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1136 transitions, 9134 flow. Second operand has 6 states, 6 states have (on average 750.5) internal successors, (4503), 6 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:58:51,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:58:51,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 851 [2022-01-19 00:58:51,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:59:25,789 INFO L129 PetriNetUnfolder]: 12624/97793 cut-off events. [2022-01-19 00:59:25,789 INFO L130 PetriNetUnfolder]: For 644388/702317 co-relation queries the response was YES. [2022-01-19 00:59:29,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224155 conditions, 97793 events. 12624/97793 cut-off events. For 644388/702317 co-relation queries the response was YES. Maximal size of possible extension queue 1570. Compared 1612549 event pairs, 3823 based on Foata normal form. 1129/94857 useless extension candidates. Maximal degree in co-relation 224039. Up to 7454 conditions per place. [2022-01-19 00:59:30,239 INFO L132 encePairwiseOnDemand]: 808/851 looper letters, 375 selfloop transitions, 251 changer transitions 81/1510 dead transitions. [2022-01-19 00:59:30,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1510 transitions, 15660 flow [2022-01-19 00:59:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:59:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:59:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8510 transitions. [2022-01-19 00:59:30,244 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2022-01-19 00:59:30,244 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8510 transitions. [2022-01-19 00:59:30,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8510 transitions. [2022-01-19 00:59:30,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:59:30,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8510 transitions. [2022-01-19 00:59:30,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 773.6363636363636) internal successors, (8510), 11 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:59:30,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:59:30,254 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:59:30,254 INFO L186 Difference]: Start difference. First operand has 998 places, 1136 transitions, 9134 flow. Second operand 11 states and 8510 transitions. [2022-01-19 00:59:30,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 1510 transitions, 15660 flow [2022-01-19 00:59:37,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1510 transitions, 15630 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-01-19 00:59:37,379 INFO L242 Difference]: Finished difference. Result has 1016 places, 1250 transitions, 11900 flow [2022-01-19 00:59:37,379 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=9116, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11900, PETRI_PLACES=1016, PETRI_TRANSITIONS=1250} [2022-01-19 00:59:37,380 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 260 predicate places. [2022-01-19 00:59:37,380 INFO L470 AbstractCegarLoop]: Abstraction has has 1016 places, 1250 transitions, 11900 flow [2022-01-19 00:59:37,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 750.5) internal successors, (4503), 6 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:59:37,380 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:59:37,381 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:59:37,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 00:59:37,381 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:59:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:59:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash -236582252, now seen corresponding path program 5 times [2022-01-19 00:59:37,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:59:37,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640097791] [2022-01-19 00:59:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:59:37,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:59:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:59:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 00:59:37,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:59:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640097791] [2022-01-19 00:59:37,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640097791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:59:37,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:59:37,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:59:37,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261452065] [2022-01-19 00:59:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:59:37,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:59:37,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:59:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:59:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:59:37,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 851 [2022-01-19 00:59:37,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1250 transitions, 11900 flow. Second operand has 6 states, 6 states have (on average 750.5) internal successors, (4503), 6 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:59:37,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:59:37,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 851 [2022-01-19 00:59:37,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:00:15,691 INFO L129 PetriNetUnfolder]: 14208/111331 cut-off events. [2022-01-19 01:00:15,691 INFO L130 PetriNetUnfolder]: For 851192/952253 co-relation queries the response was YES. [2022-01-19 01:00:20,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267160 conditions, 111331 events. 14208/111331 cut-off events. For 851192/952253 co-relation queries the response was YES. Maximal size of possible extension queue 1768. Compared 1876565 event pairs, 4308 based on Foata normal form. 732/107068 useless extension candidates. Maximal degree in co-relation 267036. Up to 7096 conditions per place. [2022-01-19 01:00:21,453 INFO L132 encePairwiseOnDemand]: 832/851 looper letters, 490 selfloop transitions, 111 changer transitions 31/1435 dead transitions. [2022-01-19 01:00:21,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1435 transitions, 15496 flow [2022-01-19 01:00:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 01:00:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 01:00:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5426 transitions. [2022-01-19 01:00:21,456 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910861171730737 [2022-01-19 01:00:21,456 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5426 transitions. [2022-01-19 01:00:21,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5426 transitions. [2022-01-19 01:00:21,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:00:21,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5426 transitions. [2022-01-19 01:00:21,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 775.1428571428571) internal successors, (5426), 7 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:00:21,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:00:21,462 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:00:21,462 INFO L186 Difference]: Start difference. First operand has 1016 places, 1250 transitions, 11900 flow. Second operand 7 states and 5426 transitions. [2022-01-19 01:00:21,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1435 transitions, 15496 flow [2022-01-19 01:00:32,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1435 transitions, 15339 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-01-19 01:00:32,287 INFO L242 Difference]: Finished difference. Result has 1021 places, 1267 transitions, 12689 flow [2022-01-19 01:00:32,288 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=11773, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12689, PETRI_PLACES=1021, PETRI_TRANSITIONS=1267} [2022-01-19 01:00:32,288 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 265 predicate places. [2022-01-19 01:00:32,288 INFO L470 AbstractCegarLoop]: Abstraction has has 1021 places, 1267 transitions, 12689 flow [2022-01-19 01:00:32,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 750.5) internal successors, (4503), 6 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:00:32,289 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:00:32,289 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:32,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 01:00:32,289 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 01:00:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:00:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -298215338, now seen corresponding path program 6 times [2022-01-19 01:00:32,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:00:32,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012260545] [2022-01-19 01:00:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:00:32,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:00:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:00:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-01-19 01:00:32,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:00:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012260545] [2022-01-19 01:00:32,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012260545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:00:32,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:00:32,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 01:00:32,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215877509] [2022-01-19 01:00:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:00:32,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 01:00:32,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:00:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 01:00:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 01:00:32,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2022-01-19 01:00:32,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1267 transitions, 12689 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:00:32,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:00:32,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2022-01-19 01:00:32,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-01-19 01:00:57,669 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 01:00:58,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-01-19 01:01:00,633 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 01:01:00,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-19 01:01:00,633 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-19 01:01:00,634 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 01:01:00,634 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 01:01:00,634 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 01:01:00,637 INFO L732 BasicCegarLoop]: Path program histogram: [9, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:01:00,640 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 01:01:00,640 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 01:01:00,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 01:01:00 BasicIcfg [2022-01-19 01:01:00,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 01:01:00,645 INFO L158 Benchmark]: Toolchain (without parser) took 683200.79ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 324.4MB in the beginning and 12.6GB in the end (delta: -12.3GB). Peak memory consumption was 8.2GB. Max. memory is 16.0GB. [2022-01-19 01:01:00,645 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 341.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 01:01:00,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.30ms. Allocated memory is still 379.6MB. Free memory was 324.2MB in the beginning and 345.4MB in the end (delta: -21.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.0GB. [2022-01-19 01:01:00,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.47ms. Allocated memory is still 379.6MB. Free memory was 345.4MB in the beginning and 341.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 01:01:00,645 INFO L158 Benchmark]: Boogie Preprocessor took 41.33ms. Allocated memory is still 379.6MB. Free memory was 341.2MB in the beginning and 338.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 01:01:00,645 INFO L158 Benchmark]: RCFGBuilder took 813.62ms. Allocated memory is still 379.6MB. Free memory was 338.0MB in the beginning and 296.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2022-01-19 01:01:00,645 INFO L158 Benchmark]: TraceAbstraction took 681990.33ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 296.1MB in the beginning and 12.6GB in the end (delta: -12.3GB). Peak memory consumption was 8.2GB. Max. memory is 16.0GB. [2022-01-19 01:01:00,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 341.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 288.30ms. Allocated memory is still 379.6MB. Free memory was 324.2MB in the beginning and 345.4MB in the end (delta: -21.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.47ms. Allocated memory is still 379.6MB. Free memory was 345.4MB in the beginning and 341.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.33ms. Allocated memory is still 379.6MB. Free memory was 341.2MB in the beginning and 338.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 813.62ms. Allocated memory is still 379.6MB. Free memory was 338.0MB in the beginning and 296.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 681990.33ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 296.1MB in the beginning and 12.6GB in the end (delta: -12.3GB). Peak memory consumption was 8.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1292 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.2s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 681.7s, OverallIterations: 45, TraceHistogramMax: 5, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 673.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3869 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3869 mSDsluCounter, 5386 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3819 mSDsCounter, 544 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7507 IncrementalHoareTripleChecker+Invalid, 8051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 544 mSolverCounterUnsat, 2525 mSDtfsCounter, 7507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2148 GetRequests, 1893 SyntacticMatches, 1 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12689occurred in iteration=44, InterpolantAutomatonStates: 269, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 16775 NumberOfCodeBlocks, 16639 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 17308 ConstructedInterpolants, 0 QuantifiedInterpolants, 36657 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2190 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 51 InterpolantComputations, 43 PerfectInterpolantSequences, 6777/6885 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown